or.h 148 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543
  1. /* Copyright (c) 2001 Matej Pfajfar.
  2. * Copyright (c) 2001-2004, Roger Dingledine.
  3. * Copyright (c) 2004-2006, Roger Dingledine, Nick Mathewson.
  4. * Copyright (c) 2007-2011, The Tor Project, Inc. */
  5. /* See LICENSE for licensing information */
  6. /**
  7. * \file or.h
  8. * \brief Master header file for Tor-specific functionality.
  9. **/
  10. #ifndef _TOR_OR_H
  11. #define _TOR_OR_H
  12. #include "orconfig.h"
  13. #ifdef __COVERITY__
  14. /* If we're building for a static analysis, turn on all the off-by-default
  15. * features. */
  16. #ifndef INSTRUMENT_DOWNLOADS
  17. #define INSTRUMENT_DOWNLOADS 1
  18. #endif
  19. #endif
  20. #ifdef MS_WINDOWS
  21. #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_NETINET_IN_H
  57. #include <netinet/in.h>
  58. #endif
  59. #ifdef HAVE_ARPA_INET_H
  60. #include <arpa/inet.h>
  61. #endif
  62. #ifdef HAVE_ERRNO_H
  63. #include <errno.h>
  64. #endif
  65. #ifdef HAVE_ASSERT_H
  66. #include <assert.h>
  67. #endif
  68. #ifdef HAVE_TIME_H
  69. #include <time.h>
  70. #endif
  71. #ifdef MS_WINDOWS
  72. #include <io.h>
  73. #include <process.h>
  74. #include <direct.h>
  75. #include <windows.h>
  76. #define snprintf _snprintf
  77. #endif
  78. #include "tortls.h"
  79. #include "../common/torlog.h"
  80. #include "container.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. #define END_STREAM_REASON_NOROUTE 8
  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. /** The target address is in a private network (like 127.0.0.1 or 10.0.0.1);
  537. * you don't want to do that over a randomly chosen exit */
  538. #define END_STREAM_REASON_PRIVATE_ADDR 262
  539. /** Bitwise-and this value with endreason to mask out all flags. */
  540. #define END_STREAM_REASON_MASK 511
  541. /** Bitwise-or this with the argument to control_event_stream_status
  542. * to indicate that the reason came from an END cell. */
  543. #define END_STREAM_REASON_FLAG_REMOTE 512
  544. /** Bitwise-or this with the argument to control_event_stream_status
  545. * to indicate that we already sent a CLOSED stream event. */
  546. #define END_STREAM_REASON_FLAG_ALREADY_SENT_CLOSED 1024
  547. /** Bitwise-or this with endreason to indicate that we already sent
  548. * a socks reply, and no further reply needs to be sent from
  549. * connection_mark_unattached_ap(). */
  550. #define END_STREAM_REASON_FLAG_ALREADY_SOCKS_REPLIED 2048
  551. /** Reason for remapping an AP connection's address: we have a cached
  552. * answer. */
  553. #define REMAP_STREAM_SOURCE_CACHE 1
  554. /** Reason for remapping an AP connection's address: the exit node told us an
  555. * answer. */
  556. #define REMAP_STREAM_SOURCE_EXIT 2
  557. /* 'type' values to use in RESOLVED cells. Specified in tor-spec.txt. */
  558. #define RESOLVED_TYPE_HOSTNAME 0
  559. #define RESOLVED_TYPE_IPV4 4
  560. #define RESOLVED_TYPE_IPV6 6
  561. #define RESOLVED_TYPE_ERROR_TRANSIENT 0xF0
  562. #define RESOLVED_TYPE_ERROR 0xF1
  563. /* Negative reasons are internal: we never send them in a DESTROY or TRUNCATE
  564. * call; they only go to the controller for tracking */
  565. /** Our post-timeout circuit time measurement period expired.
  566. * We must give up now */
  567. #define END_CIRC_REASON_MEASUREMENT_EXPIRED -3
  568. /** We couldn't build a path for this circuit. */
  569. #define END_CIRC_REASON_NOPATH -2
  570. /** Catch-all "other" reason for closing origin circuits. */
  571. #define END_CIRC_AT_ORIGIN -1
  572. /* Reasons why we (or a remote OR) might close a circuit. See tor-spec.txt for
  573. * documentation of these. */
  574. #define _END_CIRC_REASON_MIN 0
  575. #define END_CIRC_REASON_NONE 0
  576. #define END_CIRC_REASON_TORPROTOCOL 1
  577. #define END_CIRC_REASON_INTERNAL 2
  578. #define END_CIRC_REASON_REQUESTED 3
  579. #define END_CIRC_REASON_HIBERNATING 4
  580. #define END_CIRC_REASON_RESOURCELIMIT 5
  581. #define END_CIRC_REASON_CONNECTFAILED 6
  582. #define END_CIRC_REASON_OR_IDENTITY 7
  583. #define END_CIRC_REASON_OR_CONN_CLOSED 8
  584. #define END_CIRC_REASON_FINISHED 9
  585. #define END_CIRC_REASON_TIMEOUT 10
  586. #define END_CIRC_REASON_DESTROYED 11
  587. #define END_CIRC_REASON_NOSUCHSERVICE 12
  588. #define _END_CIRC_REASON_MAX 12
  589. /** Bitwise-OR this with the argument to circuit_mark_for_close() or
  590. * control_event_circuit_status() to indicate that the reason was
  591. * passed through from a destroy or truncate cell. */
  592. #define END_CIRC_REASON_FLAG_REMOTE 512
  593. /** Length of 'y' portion of 'y.onion' URL. */
  594. #define REND_SERVICE_ID_LEN_BASE32 16
  595. /** Length of 'y.onion' including '.onion' URL. */
  596. #define REND_SERVICE_ADDRESS_LEN (16+1+5)
  597. /** Length of a binary-encoded rendezvous service ID. */
  598. #define REND_SERVICE_ID_LEN 10
  599. /** Time period for which a v2 descriptor will be valid. */
  600. #define REND_TIME_PERIOD_V2_DESC_VALIDITY (24*60*60)
  601. /** Time period within which two sets of v2 descriptors will be uploaded in
  602. * parallel. */
  603. #define REND_TIME_PERIOD_OVERLAPPING_V2_DESCS (60*60)
  604. /** Number of non-consecutive replicas (i.e. distributed somewhere
  605. * in the ring) for a descriptor. */
  606. #define REND_NUMBER_OF_NON_CONSECUTIVE_REPLICAS 2
  607. /** Number of consecutive replicas for a descriptor. */
  608. #define REND_NUMBER_OF_CONSECUTIVE_REPLICAS 3
  609. /** Length of v2 descriptor ID (32 base32 chars = 160 bits). */
  610. #define REND_DESC_ID_V2_LEN_BASE32 32
  611. /** Length of the base32-encoded secret ID part of versioned hidden service
  612. * descriptors. */
  613. #define REND_SECRET_ID_PART_LEN_BASE32 32
  614. /** Length of the base32-encoded hash of an introduction point's
  615. * identity key. */
  616. #define REND_INTRO_POINT_ID_LEN_BASE32 32
  617. /** Length of the descriptor cookie that is used for client authorization
  618. * to hidden services. */
  619. #define REND_DESC_COOKIE_LEN 16
  620. /** Length of the base64-encoded descriptor cookie that is used for
  621. * exchanging client authorization between hidden service and client. */
  622. #define REND_DESC_COOKIE_LEN_BASE64 22
  623. /** Length of client identifier in encrypted introduction points for hidden
  624. * service authorization type 'basic'. */
  625. #define REND_BASIC_AUTH_CLIENT_ID_LEN 4
  626. /** Multiple of the number of clients to which the real number of clients
  627. * is padded with fake clients for hidden service authorization type
  628. * 'basic'. */
  629. #define REND_BASIC_AUTH_CLIENT_MULTIPLE 16
  630. /** Length of client entry consisting of client identifier and encrypted
  631. * session key for hidden service authorization type 'basic'. */
  632. #define REND_BASIC_AUTH_CLIENT_ENTRY_LEN (REND_BASIC_AUTH_CLIENT_ID_LEN \
  633. + CIPHER_KEY_LEN)
  634. /** Maximum size of v2 hidden service descriptors. */
  635. #define REND_DESC_MAX_SIZE (20 * 1024)
  636. /** Legal characters for use in authorized client names for a hidden
  637. * service. */
  638. #define REND_LEGAL_CLIENTNAME_CHARACTERS \
  639. "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789+-_"
  640. /** Maximum length of authorized client names for a hidden service. */
  641. #define REND_CLIENTNAME_MAX_LEN 16
  642. /** Length of the rendezvous cookie that is used to connect circuits at the
  643. * rendezvous point. */
  644. #define REND_COOKIE_LEN DIGEST_LEN
  645. /** Client authorization type that a hidden service performs. */
  646. typedef enum rend_auth_type_t {
  647. REND_NO_AUTH = 0,
  648. REND_BASIC_AUTH = 1,
  649. REND_STEALTH_AUTH = 2,
  650. } rend_auth_type_t;
  651. /** Client-side configuration of authorization for a hidden service. */
  652. typedef struct rend_service_authorization_t {
  653. char descriptor_cookie[REND_DESC_COOKIE_LEN];
  654. char onion_address[REND_SERVICE_ADDRESS_LEN+1];
  655. rend_auth_type_t auth_type;
  656. } rend_service_authorization_t;
  657. /** Client- and server-side data that is used for hidden service connection
  658. * establishment. Not all fields contain data depending on where this struct
  659. * is used. */
  660. typedef struct rend_data_t {
  661. /** Onion address (without the .onion part) that a client requests. */
  662. char onion_address[REND_SERVICE_ID_LEN_BASE32+1];
  663. /** (Optional) descriptor cookie that is used by a client. */
  664. char descriptor_cookie[REND_DESC_COOKIE_LEN];
  665. /** Authorization type for accessing a service used by a client. */
  666. rend_auth_type_t auth_type;
  667. /** Hash of the hidden service's PK used by a service. */
  668. char rend_pk_digest[DIGEST_LEN];
  669. /** Rendezvous cookie used by both, client and service. */
  670. char rend_cookie[REND_COOKIE_LEN];
  671. } rend_data_t;
  672. /** Time interval for tracking possible replays of INTRODUCE2 cells.
  673. * Incoming cells with timestamps half of this interval in the past or
  674. * future are dropped immediately. */
  675. #define REND_REPLAY_TIME_INTERVAL (60 * 60)
  676. /** Used to indicate which way a cell is going on a circuit. */
  677. typedef enum {
  678. CELL_DIRECTION_IN=1, /**< The cell is moving towards the origin. */
  679. CELL_DIRECTION_OUT=2, /**< The cell is moving away from the origin. */
  680. } cell_direction_t;
  681. /** Initial value for both sides of a circuit transmission window when the
  682. * circuit is initialized. Measured in cells. */
  683. #define CIRCWINDOW_START 1000
  684. #define CIRCWINDOW_START_MIN 100
  685. #define CIRCWINDOW_START_MAX 1000
  686. /** Amount to increment a circuit window when we get a circuit SENDME. */
  687. #define CIRCWINDOW_INCREMENT 100
  688. /** Initial value on both sides of a stream transmission window when the
  689. * stream is initialized. Measured in cells. */
  690. #define STREAMWINDOW_START 500
  691. /** Amount to increment a stream window when we get a stream SENDME. */
  692. #define STREAMWINDOW_INCREMENT 50
  693. /* Cell commands. These values are defined in tor-spec.txt. */
  694. #define CELL_PADDING 0
  695. #define CELL_CREATE 1
  696. #define CELL_CREATED 2
  697. #define CELL_RELAY 3
  698. #define CELL_DESTROY 4
  699. #define CELL_CREATE_FAST 5
  700. #define CELL_CREATED_FAST 6
  701. #define CELL_VERSIONS 7
  702. #define CELL_NETINFO 8
  703. #define CELL_RELAY_EARLY 9
  704. /** True iff the cell command <b>x</b> is one that implies a variable-length
  705. * cell. */
  706. #define CELL_COMMAND_IS_VAR_LENGTH(x) ((x) == CELL_VERSIONS)
  707. /** How long to test reachability before complaining to the user. */
  708. #define TIMEOUT_UNTIL_UNREACHABILITY_COMPLAINT (20*60)
  709. /** Legal characters in a nickname. */
  710. #define LEGAL_NICKNAME_CHARACTERS \
  711. "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789"
  712. /** Name to use in client TLS certificates if no nickname is given. Once
  713. * Tor 0.1.2.x is obsolete, we can remove this. */
  714. #define DEFAULT_CLIENT_NICKNAME "client"
  715. /** Number of bytes in a SOCKS4 header. */
  716. #define SOCKS4_NETWORK_LEN 8
  717. /*
  718. * Relay payload:
  719. * Relay command [1 byte]
  720. * Recognized [2 bytes]
  721. * Stream ID [2 bytes]
  722. * Partial SHA-1 [4 bytes]
  723. * Length [2 bytes]
  724. * Relay payload [498 bytes]
  725. */
  726. /** Number of bytes in a cell, minus cell header. */
  727. #define CELL_PAYLOAD_SIZE 509
  728. /** Number of bytes in a cell transmitted over the network. */
  729. #define CELL_NETWORK_SIZE 512
  730. /** Length of a header on a variable-length cell. */
  731. #define VAR_CELL_HEADER_SIZE 5
  732. /** Number of bytes in a relay cell's header (not including general cell
  733. * header). */
  734. #define RELAY_HEADER_SIZE (1+2+2+4+2)
  735. /** Largest number of bytes that can fit in a relay cell payload. */
  736. #define RELAY_PAYLOAD_SIZE (CELL_PAYLOAD_SIZE-RELAY_HEADER_SIZE)
  737. /** Identifies a circuit on an or_connection */
  738. typedef uint16_t circid_t;
  739. /** Identifies a stream on a circuit */
  740. typedef uint16_t streamid_t;
  741. /** Parsed onion routing cell. All communication between nodes
  742. * is via cells. */
  743. typedef struct cell_t {
  744. circid_t circ_id; /**< Circuit which received the cell. */
  745. uint8_t command; /**< Type of the cell: one of CELL_PADDING, CELL_CREATE,
  746. * CELL_DESTROY, etc */
  747. uint8_t payload[CELL_PAYLOAD_SIZE]; /**< Cell body. */
  748. } cell_t;
  749. /** Parsed variable-length onion routing cell. */
  750. typedef struct var_cell_t {
  751. uint8_t command;
  752. circid_t circ_id;
  753. uint16_t payload_len;
  754. uint8_t payload[1];
  755. } var_cell_t;
  756. /** A cell as packed for writing to the network. */
  757. typedef struct packed_cell_t {
  758. struct packed_cell_t *next; /**< Next cell queued on this circuit. */
  759. char body[CELL_NETWORK_SIZE]; /**< Cell as packed for network. */
  760. } packed_cell_t;
  761. /** Number of cells added to a circuit queue including their insertion
  762. * time on 10 millisecond detail; used for buffer statistics. */
  763. typedef struct insertion_time_elem_t {
  764. struct insertion_time_elem_t *next; /**< Next element in queue. */
  765. uint32_t insertion_time; /**< When were cells inserted (in 10 ms steps
  766. * starting at 0:00 of the current day)? */
  767. unsigned counter; /**< How many cells were inserted? */
  768. } insertion_time_elem_t;
  769. /** Queue of insertion times. */
  770. typedef struct insertion_time_queue_t {
  771. struct insertion_time_elem_t *first; /**< First element in queue. */
  772. struct insertion_time_elem_t *last; /**< Last element in queue. */
  773. } insertion_time_queue_t;
  774. /** A queue of cells on a circuit, waiting to be added to the
  775. * or_connection_t's outbuf. */
  776. typedef struct cell_queue_t {
  777. packed_cell_t *head; /**< The first cell, or NULL if the queue is empty. */
  778. packed_cell_t *tail; /**< The last cell, or NULL if the queue is empty. */
  779. int n; /**< The number of cells in the queue. */
  780. insertion_time_queue_t *insertion_times; /**< Insertion times of cells. */
  781. } cell_queue_t;
  782. /** Beginning of a RELAY cell payload. */
  783. typedef struct {
  784. uint8_t command; /**< The end-to-end relay command. */
  785. uint16_t recognized; /**< Used to tell whether cell is for us. */
  786. streamid_t stream_id; /**< Which stream is this cell associated with? */
  787. char integrity[4]; /**< Used to tell whether cell is corrupted. */
  788. uint16_t length; /**< How long is the payload body? */
  789. } relay_header_t;
  790. typedef struct buf_t buf_t;
  791. typedef struct socks_request_t socks_request_t;
  792. /* Values for connection_t.magic: used to make sure that downcasts (casts from
  793. * connection_t to foo_connection_t) are safe. */
  794. #define BASE_CONNECTION_MAGIC 0x7C3C304Eu
  795. #define OR_CONNECTION_MAGIC 0x7D31FF03u
  796. #define EDGE_CONNECTION_MAGIC 0xF0374013u
  797. #define DIR_CONNECTION_MAGIC 0x9988ffeeu
  798. #define CONTROL_CONNECTION_MAGIC 0x8abc765du
  799. /** Description of a connection to another host or process, and associated
  800. * data.
  801. *
  802. * A connection is named based on what it's connected to -- an "OR
  803. * connection" has a Tor node on the other end, an "exit
  804. * connection" has a website or other server on the other end, and an
  805. * "AP connection" has an application proxy (and thus a user) on the
  806. * other end.
  807. *
  808. * Every connection has a type and a state. Connections never change
  809. * their type, but can go through many state changes in their lifetime.
  810. *
  811. * Every connection has two associated input and output buffers.
  812. * Listeners don't use them. For non-listener connections, incoming
  813. * data is appended to conn->inbuf, and outgoing data is taken from
  814. * conn->outbuf. Connections differ primarily in the functions called
  815. * to fill and drain these buffers.
  816. */
  817. typedef struct connection_t {
  818. uint32_t magic; /**< For memory debugging: must equal one of
  819. * *_CONNECTION_MAGIC. */
  820. uint8_t state; /**< Current state of this connection. */
  821. unsigned int type:4; /**< What kind of connection is this? */
  822. unsigned int purpose:5; /**< Only used for DIR and EXIT types currently. */
  823. /* The next fields are all one-bit booleans. Some are only applicable to
  824. * connection subtypes, but we hold them here anyway, to save space.
  825. */
  826. unsigned int read_blocked_on_bw:1; /**< Boolean: should we start reading
  827. * again once the bandwidth throttler allows it? */
  828. unsigned int write_blocked_on_bw:1; /**< Boolean: should we start writing
  829. * again once the bandwidth throttler allows
  830. * writes? */
  831. unsigned int hold_open_until_flushed:1; /**< Despite this connection's being
  832. * marked for close, do we flush it
  833. * before closing it? */
  834. unsigned int inbuf_reached_eof:1; /**< Boolean: did read() return 0 on this
  835. * conn? */
  836. /** Set to 1 when we're inside connection_flushed_some to keep us from
  837. * calling connection_handle_write() recursively. */
  838. unsigned int in_flushed_some:1;
  839. /* For linked connections:
  840. */
  841. unsigned int linked:1; /**< True if there is, or has been, a linked_conn. */
  842. /** True iff we'd like to be notified about read events from the
  843. * linked conn. */
  844. unsigned int reading_from_linked_conn:1;
  845. /** True iff we're willing to write to the linked conn. */
  846. unsigned int writing_to_linked_conn:1;
  847. /** True iff we're currently able to read on the linked conn, and our
  848. * read_event should be made active with libevent. */
  849. unsigned int active_on_link:1;
  850. /** True iff we've called connection_close_immediate() on this linked
  851. * connection. */
  852. unsigned int linked_conn_is_closed:1;
  853. /** CONNECT/SOCKS proxy client handshake state (for outgoing connections). */
  854. unsigned int proxy_state:4;
  855. /** Our socket; -1 if this connection is closed, or has no socket. */
  856. evutil_socket_t s;
  857. int conn_array_index; /**< Index into the global connection array. */
  858. struct event *read_event; /**< Libevent event structure. */
  859. struct event *write_event; /**< Libevent event structure. */
  860. buf_t *inbuf; /**< Buffer holding data read over this connection. */
  861. buf_t *outbuf; /**< Buffer holding data to write over this connection. */
  862. size_t outbuf_flushlen; /**< How much data should we try to flush from the
  863. * outbuf? */
  864. time_t timestamp_lastread; /**< When was the last time libevent said we could
  865. * read? */
  866. time_t timestamp_lastwritten; /**< When was the last time libevent said we
  867. * could write? */
  868. time_t timestamp_created; /**< When was this connection_t created? */
  869. /* XXXX_IP6 make this IPv6-capable */
  870. int socket_family; /**< Address family of this connection's socket. Usually
  871. * AF_INET, but it can also be AF_UNIX, or in the future
  872. * AF_INET6 */
  873. tor_addr_t addr; /**< IP of the other side of the connection; used to
  874. * identify routers, along with port. */
  875. uint16_t port; /**< If non-zero, port on the other end
  876. * of the connection. */
  877. uint16_t marked_for_close; /**< Should we close this conn on the next
  878. * iteration of the main loop? (If true, holds
  879. * the line number where this connection was
  880. * marked.) */
  881. const char *marked_for_close_file; /**< For debugging: in which file were
  882. * we marked for close? */
  883. char *address; /**< FQDN (or IP) of the guy on the other end.
  884. * strdup into this, because free_connection() frees it. */
  885. /** Another connection that's connected to this one in lieu of a socket. */
  886. struct connection_t *linked_conn;
  887. /** Unique identifier for this connection on this Tor instance. */
  888. uint64_t global_identifier;
  889. /* XXXX022 move this field, and all the listener-only fields (just
  890. socket_family, I think), into a new listener_connection_t subtype. */
  891. /** If the connection is a CONN_TYPE_AP_DNS_LISTENER, this field points
  892. * to the evdns_server_port is uses to listen to and answer connections. */
  893. struct evdns_server_port *dns_server_port;
  894. /** Unique ID for measuring tunneled network status requests. */
  895. uint64_t dirreq_id;
  896. } connection_t;
  897. /** Stores flags and information related to the portion of a v2 Tor OR
  898. * connection handshake that happens after the TLS handshake is finished.
  899. */
  900. typedef struct or_handshake_state_t {
  901. /** When was the VERSIONS cell sent on this connection? Used to get
  902. * an estimate of the skew in the returning NETINFO reply. */
  903. time_t sent_versions_at;
  904. /** True iff we originated this connection */
  905. unsigned int started_here : 1;
  906. /** True iff we have received and processed a VERSIONS cell. */
  907. unsigned int received_versions : 1;
  908. } or_handshake_state_t;
  909. /** Subtype of connection_t for an "OR connection" -- that is, one that speaks
  910. * cells over TLS. */
  911. typedef struct or_connection_t {
  912. connection_t _base;
  913. /** Hash of the public RSA key for the other side's identity key, or zeroes
  914. * if the other side hasn't shown us a valid identity key. */
  915. char identity_digest[DIGEST_LEN];
  916. char *nickname; /**< Nickname of OR on other side (if any). */
  917. tor_tls_t *tls; /**< TLS connection state. */
  918. int tls_error; /**< Last tor_tls error code. */
  919. /** When we last used this conn for any client traffic. If not
  920. * recent, we can rate limit it further. */
  921. time_t client_used;
  922. tor_addr_t real_addr; /**< The actual address that this connection came from
  923. * or went to. The <b>addr</b> field is prone to
  924. * getting overridden by the address from the router
  925. * descriptor matching <b>identity_digest</b>. */
  926. circ_id_type_t circ_id_type:2; /**< When we send CREATE cells along this
  927. * connection, which half of the space should
  928. * we use? */
  929. /** Should this connection be used for extending circuits to the server
  930. * matching the <b>identity_digest</b> field? Set to true if we're pretty
  931. * sure we aren't getting MITMed, either because we're connected to an
  932. * address listed in a server descriptor, or because an authenticated
  933. * NETINFO cell listed the address we're connected to as recognized. */
  934. unsigned int is_canonical:1;
  935. /** True iff this connection shouldn't get any new circs attached to it,
  936. * because the connection is too old, or because there's a better one.
  937. * More generally, this flag is used to note an unhealthy connection;
  938. * for example, if a bad connection fails we shouldn't assume that the
  939. * router itself has a problem.
  940. */
  941. unsigned int is_bad_for_new_circs:1;
  942. uint8_t link_proto; /**< What protocol version are we using? 0 for
  943. * "none negotiated yet." */
  944. circid_t next_circ_id; /**< Which circ_id do we try to use next on
  945. * this connection? This is always in the
  946. * range 0..1<<15-1. */
  947. or_handshake_state_t *handshake_state; /**< If we are setting this connection
  948. * up, state information to do so. */
  949. time_t timestamp_lastempty; /**< When was the outbuf last completely empty?*/
  950. time_t timestamp_last_added_nonpadding; /** When did we last add a
  951. * non-padding cell to the outbuf? */
  952. /* bandwidth* and *_bucket only used by ORs in OPEN state: */
  953. int bandwidthrate; /**< Bytes/s added to the bucket. (OPEN ORs only.) */
  954. int bandwidthburst; /**< Max bucket size for this conn. (OPEN ORs only.) */
  955. int read_bucket; /**< When this hits 0, stop receiving. Every second we
  956. * add 'bandwidthrate' to this, capping it at
  957. * bandwidthburst. (OPEN ORs only) */
  958. int write_bucket; /**< When this hits 0, stop writing. Like read_bucket. */
  959. int n_circuits; /**< How many circuits use this connection as p_conn or
  960. * n_conn ? */
  961. /** Double-linked ring of circuits with queued cells waiting for room to
  962. * free up on this connection's outbuf. Every time we pull cells from a
  963. * circuit, we advance this pointer to the next circuit in the ring. */
  964. struct circuit_t *active_circuits;
  965. /** Priority queue of cell_ewma_t for circuits with queued cells waiting for
  966. * room to free up on this connection's outbuf. Kept in heap order
  967. * according to EWMA.
  968. *
  969. * This is redundant with active_circuits; if we ever decide only to use the
  970. * cell_ewma algorithm for choosing circuits, we can remove active_circuits.
  971. */
  972. smartlist_t *active_circuit_pqueue;
  973. /** The tick on which the cell_ewma_ts in active_circuit_pqueue last had
  974. * their ewma values rescaled. */
  975. unsigned active_circuit_pqueue_last_recalibrated;
  976. struct or_connection_t *next_with_same_id; /**< Next connection with same
  977. * identity digest as this one. */
  978. } or_connection_t;
  979. /** Subtype of connection_t for an "edge connection" -- that is, a socks (ap)
  980. * connection, or an exit. */
  981. typedef struct edge_connection_t {
  982. connection_t _base;
  983. struct edge_connection_t *next_stream; /**< Points to the next stream at this
  984. * edge, if any */
  985. struct crypt_path_t *cpath_layer; /**< A pointer to which node in the circ
  986. * this conn exits at. */
  987. int package_window; /**< How many more relay cells can I send into the
  988. * circuit? */
  989. int deliver_window; /**< How many more relay cells can end at me? */
  990. /** Nickname of planned exit node -- used with .exit support. */
  991. char *chosen_exit_name;
  992. socks_request_t *socks_request; /**< SOCKS structure describing request (AP
  993. * only.) */
  994. struct circuit_t *on_circuit; /**< The circuit (if any) that this edge
  995. * connection is using. */
  996. uint32_t address_ttl; /**< TTL for address-to-addr mapping on exit
  997. * connection. Exit connections only. */
  998. streamid_t stream_id; /**< The stream ID used for this edge connection on its
  999. * circuit */
  1000. /** The reason why this connection is closing; passed to the controller. */
  1001. uint16_t end_reason;
  1002. /** Bytes read since last call to control_event_stream_bandwidth_used() */
  1003. uint32_t n_read;
  1004. /** Bytes written since last call to control_event_stream_bandwidth_used() */
  1005. uint32_t n_written;
  1006. /** What rendezvous service are we querying for? (AP only) */
  1007. rend_data_t *rend_data;
  1008. /** Number of times we've reassigned this application connection to
  1009. * a new circuit. We keep track because the timeout is longer if we've
  1010. * already retried several times. */
  1011. uint8_t num_socks_retries;
  1012. /** True iff this connection is for a DNS request only. */
  1013. unsigned int is_dns_request:1;
  1014. /** True iff this stream must attach to a one-hop circuit (e.g. for
  1015. * begin_dir). */
  1016. unsigned int want_onehop:1;
  1017. /** True iff this stream should use a BEGIN_DIR relay command to establish
  1018. * itself rather than BEGIN (either via onehop or via a whole circuit). */
  1019. unsigned int use_begindir:1;
  1020. unsigned int edge_has_sent_end:1; /**< For debugging; only used on edge
  1021. * connections. Set once we've set the stream end,
  1022. * and check in connection_about_to_close_connection().
  1023. */
  1024. /** True iff we've blocked reading until the circuit has fewer queued
  1025. * cells. */
  1026. unsigned int edge_blocked_on_circ:1;
  1027. /** For AP connections only. If 1, and we fail to reach the chosen exit,
  1028. * stop requiring it. */
  1029. unsigned int chosen_exit_optional:1;
  1030. /** For AP connections only. If non-zero, this exit node was picked as
  1031. * a result of the TrackHostExit, and the value decrements every time
  1032. * we fail to complete a circuit to our chosen exit -- if it reaches
  1033. * zero, abandon the associated mapaddress. */
  1034. unsigned int chosen_exit_retries:3;
  1035. /** True iff this is an AP connection that came from a transparent or
  1036. * NATd connection */
  1037. unsigned int is_transparent_ap:1;
  1038. /** If this is a DNSPort connection, this field holds the pending DNS
  1039. * request that we're going to try to answer. */
  1040. struct evdns_server_request *dns_server_request;
  1041. } edge_connection_t;
  1042. /** Subtype of connection_t for an "directory connection" -- that is, an HTTP
  1043. * connection to retrieve or serve directory material. */
  1044. typedef struct dir_connection_t {
  1045. connection_t _base;
  1046. char *requested_resource; /**< Which 'resource' did we ask the directory
  1047. * for? */
  1048. unsigned int dirconn_direct:1; /**< Is this dirconn direct, or via Tor? */
  1049. /* Used only for server sides of some dir connections, to implement
  1050. * "spooling" of directory material to the outbuf. Otherwise, we'd have
  1051. * to append everything to the outbuf in one enormous chunk. */
  1052. /** What exactly are we spooling right now? */
  1053. enum {
  1054. DIR_SPOOL_NONE=0, DIR_SPOOL_SERVER_BY_DIGEST, DIR_SPOOL_SERVER_BY_FP,
  1055. DIR_SPOOL_EXTRA_BY_DIGEST, DIR_SPOOL_EXTRA_BY_FP,
  1056. DIR_SPOOL_CACHED_DIR, DIR_SPOOL_NETWORKSTATUS,
  1057. DIR_SPOOL_MICRODESC, /* NOTE: if we add another entry, add another bit. */
  1058. } dir_spool_src : 3;
  1059. /** If we're fetching descriptors, what router purpose shall we assign
  1060. * to them? */
  1061. uint8_t router_purpose;
  1062. /** List of fingerprints for networkstatuses or descriptors to be spooled. */
  1063. smartlist_t *fingerprint_stack;
  1064. /** A cached_dir_t object that we're currently spooling out */
  1065. struct cached_dir_t *cached_dir;
  1066. /** The current offset into cached_dir. */
  1067. off_t cached_dir_offset;
  1068. /** The zlib object doing on-the-fly compression for spooled data. */
  1069. tor_zlib_state_t *zlib_state;
  1070. /** What rendezvous service are we querying for? */
  1071. rend_data_t *rend_data;
  1072. char identity_digest[DIGEST_LEN]; /**< Hash of the public RSA key for
  1073. * the directory server's signing key. */
  1074. } dir_connection_t;
  1075. /** Subtype of connection_t for an connection to a controller. */
  1076. typedef struct control_connection_t {
  1077. connection_t _base;
  1078. uint32_t event_mask; /**< Bitfield: which events does this controller
  1079. * care about? */
  1080. /** True if we have sent a protocolinfo reply on this connection. */
  1081. unsigned int have_sent_protocolinfo:1;
  1082. /** Amount of space allocated in incoming_cmd. */
  1083. uint32_t incoming_cmd_len;
  1084. /** Number of bytes currently stored in incoming_cmd. */
  1085. uint32_t incoming_cmd_cur_len;
  1086. /** A control command that we're reading from the inbuf, but which has not
  1087. * yet arrived completely. */
  1088. char *incoming_cmd;
  1089. } control_connection_t;
  1090. /** Cast a connection_t subtype pointer to a connection_t **/
  1091. #define TO_CONN(c) (&(((c)->_base)))
  1092. /** Helper macro: Given a pointer to to._base, of type from*, return &to. */
  1093. #define DOWNCAST(to, ptr) ((to*)SUBTYPE_P(ptr, to, _base))
  1094. /** Convert a connection_t* to an or_connection_t*; assert if the cast is
  1095. * invalid. */
  1096. static or_connection_t *TO_OR_CONN(connection_t *);
  1097. /** Convert a connection_t* to a dir_connection_t*; assert if the cast is
  1098. * invalid. */
  1099. static dir_connection_t *TO_DIR_CONN(connection_t *);
  1100. /** Convert a connection_t* to an edge_connection_t*; assert if the cast is
  1101. * invalid. */
  1102. static edge_connection_t *TO_EDGE_CONN(connection_t *);
  1103. /** Convert a connection_t* to an control_connection_t*; assert if the cast is
  1104. * invalid. */
  1105. static control_connection_t *TO_CONTROL_CONN(connection_t *);
  1106. static INLINE or_connection_t *TO_OR_CONN(connection_t *c)
  1107. {
  1108. tor_assert(c->magic == OR_CONNECTION_MAGIC);
  1109. return DOWNCAST(or_connection_t, c);
  1110. }
  1111. static INLINE dir_connection_t *TO_DIR_CONN(connection_t *c)
  1112. {
  1113. tor_assert(c->magic == DIR_CONNECTION_MAGIC);
  1114. return DOWNCAST(dir_connection_t, c);
  1115. }
  1116. static INLINE edge_connection_t *TO_EDGE_CONN(connection_t *c)
  1117. {
  1118. tor_assert(c->magic == EDGE_CONNECTION_MAGIC);
  1119. return DOWNCAST(edge_connection_t, c);
  1120. }
  1121. static INLINE control_connection_t *TO_CONTROL_CONN(connection_t *c)
  1122. {
  1123. tor_assert(c->magic == CONTROL_CONNECTION_MAGIC);
  1124. return DOWNCAST(control_connection_t, c);
  1125. }
  1126. /** What action type does an address policy indicate: accept or reject? */
  1127. typedef enum {
  1128. ADDR_POLICY_ACCEPT=1,
  1129. ADDR_POLICY_REJECT=2,
  1130. } addr_policy_action_t;
  1131. /** A reference-counted address policy rule. */
  1132. typedef struct addr_policy_t {
  1133. int refcnt; /**< Reference count */
  1134. addr_policy_action_t policy_type:2;/**< What to do when the policy matches.*/
  1135. unsigned int is_private:1; /**< True iff this is the pseudo-address,
  1136. * "private". */
  1137. unsigned int is_canonical:1; /**< True iff this policy is the canonical
  1138. * copy (stored in a hash table to avoid
  1139. * duplication of common policies) */
  1140. maskbits_t maskbits; /**< Accept/reject all addresses <b>a</b> such that the
  1141. * first <b>maskbits</b> bits of <b>a</b> match
  1142. * <b>addr</b>. */
  1143. tor_addr_t addr; /**< Base address to accept or reject. */
  1144. uint16_t prt_min; /**< Lowest port number to accept/reject. */
  1145. uint16_t prt_max; /**< Highest port number to accept/reject. */
  1146. } addr_policy_t;
  1147. /** A cached_dir_t represents a cacheable directory object, along with its
  1148. * compressed form. */
  1149. typedef struct cached_dir_t {
  1150. char *dir; /**< Contents of this object, NUL-terminated. */
  1151. char *dir_z; /**< Compressed contents of this object. */
  1152. size_t dir_len; /**< Length of <b>dir</b> (not counting its NUL). */
  1153. size_t dir_z_len; /**< Length of <b>dir_z</b>. */
  1154. time_t published; /**< When was this object published. */
  1155. digests_t digests; /**< Digests of this object (networkstatus only) */
  1156. int refcnt; /**< Reference count for this cached_dir_t. */
  1157. } cached_dir_t;
  1158. /** Enum used to remember where a signed_descriptor_t is stored and how to
  1159. * manage the memory for signed_descriptor_body. */
  1160. typedef enum {
  1161. /** The descriptor isn't stored on disk at all: the copy in memory is
  1162. * canonical; the saved_offset field is meaningless. */
  1163. SAVED_NOWHERE=0,
  1164. /** The descriptor is stored in the cached_routers file: the
  1165. * signed_descriptor_body is meaningless; the signed_descriptor_len and
  1166. * saved_offset are used to index into the mmaped cache file. */
  1167. SAVED_IN_CACHE,
  1168. /** The descriptor is stored in the cached_routers.new file: the
  1169. * signed_descriptor_body and saved_offset fields are both set. */
  1170. /* FFFF (We could also mmap the file and grow the mmap as needed, or
  1171. * lazy-load the descriptor text by using seek and read. We don't, for
  1172. * now.)
  1173. */
  1174. SAVED_IN_JOURNAL
  1175. } saved_location_t;
  1176. /** Enumeration: what kind of download schedule are we using for a given
  1177. * object? */
  1178. typedef enum {
  1179. DL_SCHED_GENERIC = 0,
  1180. DL_SCHED_CONSENSUS = 1,
  1181. DL_SCHED_BRIDGE = 2,
  1182. } download_schedule_t;
  1183. /** Information about our plans for retrying downloads for a downloadable
  1184. * object. */
  1185. typedef struct download_status_t {
  1186. time_t next_attempt_at; /**< When should we try downloading this descriptor
  1187. * again? */
  1188. uint8_t n_download_failures; /**< Number of failures trying to download the
  1189. * most recent descriptor. */
  1190. download_schedule_t schedule : 8;
  1191. } download_status_t;
  1192. /** If n_download_failures is this high, the download can never happen. */
  1193. #define IMPOSSIBLE_TO_DOWNLOAD 255
  1194. /** The max size we expect router descriptor annotations we create to
  1195. * be. We'll accept larger ones if we see them on disk, but we won't
  1196. * create any that are larger than this. */
  1197. #define ROUTER_ANNOTATION_BUF_LEN 256
  1198. /** Information need to cache an onion router's descriptor. */
  1199. typedef struct signed_descriptor_t {
  1200. /** Pointer to the raw server descriptor, preceded by annotations. Not
  1201. * necessarily NUL-terminated. If saved_location is SAVED_IN_CACHE, this
  1202. * pointer is null. */
  1203. char *signed_descriptor_body;
  1204. /** Length of the annotations preceding the server descriptor. */
  1205. size_t annotations_len;
  1206. /** Length of the server descriptor. */
  1207. size_t signed_descriptor_len;
  1208. /** Digest of the server descriptor, computed as specified in
  1209. * dir-spec.txt. */
  1210. char signed_descriptor_digest[DIGEST_LEN];
  1211. /** Identity digest of the router. */
  1212. char identity_digest[DIGEST_LEN];
  1213. /** Declared publication time of the descriptor. */
  1214. time_t published_on;
  1215. /** For routerdescs only: digest of the corresponding extrainfo. */
  1216. char extra_info_digest[DIGEST_LEN];
  1217. /** For routerdescs only: Status of downloading the corresponding
  1218. * extrainfo. */
  1219. download_status_t ei_dl_status;
  1220. /** Where is the descriptor saved? */
  1221. saved_location_t saved_location;
  1222. /** If saved_location is SAVED_IN_CACHE or SAVED_IN_JOURNAL, the offset of
  1223. * this descriptor in the corresponding file. */
  1224. off_t saved_offset;
  1225. /** What position is this descriptor within routerlist->routers or
  1226. * routerlist->old_routers? -1 for none. */
  1227. int routerlist_index;
  1228. /** The valid-until time of the most recent consensus that listed this
  1229. * descriptor, or a bit after the publication time of the most recent v2
  1230. * networkstatus that listed it. 0 for "never listed in a consensus or
  1231. * status, so far as we know." */
  1232. time_t last_listed_as_valid_until;
  1233. #ifdef TRACK_SERVED_TIME
  1234. /** The last time we served anybody this descriptor. Used for internal
  1235. * testing to see whether we're holding on to descriptors too long. */
  1236. time_t last_served_at; /*XXXX remove if not useful. */
  1237. #endif
  1238. /* If true, we do not ever try to save this object in the cache. */
  1239. unsigned int do_not_cache : 1;
  1240. /* If true, this item is meant to represent an extrainfo. */
  1241. unsigned int is_extrainfo : 1;
  1242. /* If true, we got an extrainfo for this item, and the digest was right,
  1243. * but it was incompatible. */
  1244. unsigned int extrainfo_is_bogus : 1;
  1245. /* If true, we are willing to transmit this item unencrypted. */
  1246. unsigned int send_unencrypted : 1;
  1247. } signed_descriptor_t;
  1248. /** A signed integer representing a country code. */
  1249. typedef int16_t country_t;
  1250. /** Information about another onion router in the network. */
  1251. typedef struct {
  1252. signed_descriptor_t cache_info;
  1253. char *address; /**< Location of OR: either a hostname or an IP address. */
  1254. char *nickname; /**< Human-readable OR name. */
  1255. uint32_t addr; /**< IPv4 address of OR, in host order. */
  1256. uint16_t or_port; /**< Port for TLS connections. */
  1257. uint16_t dir_port; /**< Port for HTTP directory connections. */
  1258. crypto_pk_env_t *onion_pkey; /**< Public RSA key for onions. */
  1259. crypto_pk_env_t *identity_pkey; /**< Public RSA key for signing. */
  1260. char *platform; /**< What software/operating system is this OR using? */
  1261. /* link info */
  1262. uint32_t bandwidthrate; /**< How many bytes does this OR add to its token
  1263. * bucket per second? */
  1264. uint32_t bandwidthburst; /**< How large is this OR's token bucket? */
  1265. /** How many bytes/s is this router known to handle? */
  1266. uint32_t bandwidthcapacity;
  1267. smartlist_t *exit_policy; /**< What streams will this OR permit
  1268. * to exit? NULL for 'reject *:*'. */
  1269. long uptime; /**< How many seconds the router claims to have been up */
  1270. smartlist_t *declared_family; /**< Nicknames of router which this router
  1271. * claims are its family. */
  1272. char *contact_info; /**< Declared contact info for this router. */
  1273. unsigned int is_hibernating:1; /**< Whether the router claims to be
  1274. * hibernating */
  1275. unsigned int has_old_dnsworkers:1; /**< Whether the router is using
  1276. * dnsworker code. */
  1277. unsigned int caches_extra_info:1; /**< Whether the router caches and serves
  1278. * extrainfo documents. */
  1279. unsigned int allow_single_hop_exits:1; /**< Whether the router allows
  1280. * single hop exits. */
  1281. /* local info */
  1282. unsigned int is_running:1; /**< As far as we know, is this OR currently
  1283. * running? */
  1284. unsigned int is_valid:1; /**< Has a trusted dirserver validated this OR?
  1285. * (For Authdir: Have we validated this OR?)
  1286. */
  1287. unsigned int is_named:1; /**< Do we believe the nickname that this OR gives
  1288. * us? */
  1289. unsigned int is_fast:1; /** Do we think this is a fast OR? */
  1290. unsigned int is_stable:1; /** Do we think this is a stable OR? */
  1291. unsigned int is_possible_guard:1; /**< Do we think this is an OK guard? */
  1292. unsigned int is_exit:1; /**< Do we think this is an OK exit? */
  1293. unsigned int is_bad_exit:1; /**< Do we think this exit is censored, borked,
  1294. * or otherwise nasty? */
  1295. unsigned int is_bad_directory:1; /**< Do we think this directory is junky,
  1296. * underpowered, or otherwise useless? */
  1297. unsigned int wants_to_be_hs_dir:1; /**< True iff this router claims to be
  1298. * a hidden service directory. */
  1299. unsigned int is_hs_dir:1; /**< True iff this router is a hidden service
  1300. * directory according to the authorities. */
  1301. unsigned int policy_is_reject_star:1; /**< True iff the exit policy for this
  1302. * router rejects everything. */
  1303. /** True if, after we have added this router, we should re-launch
  1304. * tests for it. */
  1305. unsigned int needs_retest_if_added:1;
  1306. /** Tor can use this router for general positions in circuits. */
  1307. #define ROUTER_PURPOSE_GENERAL 0
  1308. /** Tor should avoid using this router for circuit-building. */
  1309. #define ROUTER_PURPOSE_CONTROLLER 1
  1310. /** Tor should use this router only for bridge positions in circuits. */
  1311. #define ROUTER_PURPOSE_BRIDGE 2
  1312. /** Tor should not use this router; it was marked in cached-descriptors with
  1313. * a purpose we didn't recognize. */
  1314. #define ROUTER_PURPOSE_UNKNOWN 255
  1315. uint8_t purpose; /** What positions in a circuit is this router good for? */
  1316. /* The below items are used only by authdirservers for
  1317. * reachability testing. */
  1318. /** When was the last time we could reach this OR? */
  1319. time_t last_reachable;
  1320. /** When did we start testing reachability for this OR? */
  1321. time_t testing_since;
  1322. /** According to the geoip db what country is this router in? */
  1323. country_t country;
  1324. } routerinfo_t;
  1325. /** Information needed to keep and cache a signed extra-info document. */
  1326. typedef struct extrainfo_t {
  1327. signed_descriptor_t cache_info;
  1328. /** The router's nickname. */
  1329. char nickname[MAX_NICKNAME_LEN+1];
  1330. /** True iff we found the right key for this extra-info, verified the
  1331. * signature, and found it to be bad. */
  1332. unsigned int bad_sig : 1;
  1333. /** If present, we didn't have the right key to verify this extra-info,
  1334. * so this is a copy of the signature in the document. */
  1335. char *pending_sig;
  1336. /** Length of pending_sig. */
  1337. size_t pending_sig_len;
  1338. } extrainfo_t;
  1339. /** Contents of a single router entry in a network status object.
  1340. */
  1341. typedef struct routerstatus_t {
  1342. time_t published_on; /**< When was this router published? */
  1343. char nickname[MAX_NICKNAME_LEN+1]; /**< The nickname this router says it
  1344. * has. */
  1345. char identity_digest[DIGEST_LEN]; /**< Digest of the router's identity
  1346. * key. */
  1347. char descriptor_digest[DIGEST_LEN]; /**< Digest of the router's most recent
  1348. * descriptor. */
  1349. uint32_t addr; /**< IPv4 address for this router. */
  1350. uint16_t or_port; /**< OR port for this router. */
  1351. uint16_t dir_port; /**< Directory port for this router. */
  1352. unsigned int is_authority:1; /**< True iff this router is an authority. */
  1353. unsigned int is_exit:1; /**< True iff this router is a good exit. */
  1354. unsigned int is_stable:1; /**< True iff this router stays up a long time. */
  1355. unsigned int is_fast:1; /**< True iff this router has good bandwidth. */
  1356. unsigned int is_running:1; /**< True iff this router is up. */
  1357. unsigned int is_named:1; /**< True iff "nickname" belongs to this router. */
  1358. unsigned int is_unnamed:1; /**< True iff "nickname" belongs to another
  1359. * router. */
  1360. unsigned int is_valid:1; /**< True iff this router isn't invalid. */
  1361. unsigned int is_v2_dir:1; /**< True iff this router can serve directory
  1362. * information with v2 of the directory
  1363. * protocol. (All directory caches cache v1
  1364. * directories.) */
  1365. unsigned int is_possible_guard:1; /**< True iff this router would be a good
  1366. * choice as an entry guard. */
  1367. unsigned int is_bad_exit:1; /**< True iff this node is a bad choice for
  1368. * an exit node. */
  1369. unsigned int is_bad_directory:1; /**< Do we think this directory is junky,
  1370. * underpowered, or otherwise useless? */
  1371. unsigned int is_hs_dir:1; /**< True iff this router is a v2-or-later hidden
  1372. * service directory. */
  1373. /** True iff we know version info for this router. (i.e., a "v" entry was
  1374. * included.) We'll replace all these with a big tor_version_t or a char[]
  1375. * if the number of traits we care about ever becomes incredibly big. */
  1376. unsigned int version_known:1;
  1377. /** True iff this router is a version that supports BEGIN_DIR cells. */
  1378. unsigned int version_supports_begindir:1;
  1379. /** True iff this router is a version that supports conditional consensus
  1380. * downloads (signed by list of authorities). */
  1381. unsigned int version_supports_conditional_consensus:1;
  1382. /** True iff this router is a version that we can post extrainfo docs to. */
  1383. unsigned int version_supports_extrainfo_upload:1;
  1384. /** True iff this router is a version that, if it caches directory info,
  1385. * we can get v3 downloads from. */
  1386. unsigned int version_supports_v3_dir:1;
  1387. unsigned int has_bandwidth:1; /**< The vote/consensus had bw info */
  1388. unsigned int has_exitsummary:1; /**< The vote/consensus had exit summaries */
  1389. unsigned int has_measured_bw:1; /**< The vote/consensus had a measured bw */
  1390. uint32_t measured_bw; /**< Measured bandwidth (capacity) of the router */
  1391. uint32_t bandwidth; /**< Bandwidth (capacity) of the router as reported in
  1392. * the vote/consensus, in kilobytes/sec. */
  1393. char *exitsummary; /**< exit policy summary -
  1394. * XXX weasel: this probably should not stay a string. */
  1395. /* ---- The fields below aren't derived from the networkstatus; they
  1396. * hold local information only. */
  1397. /** True if we, as a directory mirror, want to download the corresponding
  1398. * routerinfo from the authority who gave us this routerstatus. (That is,
  1399. * if we don't have the routerinfo, and if we haven't already tried to get it
  1400. * from this authority.) Applies in v2 networkstatus document only.
  1401. */
  1402. unsigned int need_to_mirror:1;
  1403. unsigned int name_lookup_warned:1; /**< Have we warned the user for referring
  1404. * to this (unnamed) router by nickname?
  1405. */
  1406. time_t last_dir_503_at; /**< When did this router last tell us that it
  1407. * was too busy to serve directory info? */
  1408. download_status_t dl_status;
  1409. } routerstatus_t;
  1410. /** A microdescriptor is the smallest amount of information needed to build a
  1411. * circuit through a router. They are generated by the directory authorities,
  1412. * using information from the uploaded routerinfo documents. They are not
  1413. * self-signed, but are rather authenticated by having their hash in a signed
  1414. * networkstatus document. */
  1415. typedef struct microdesc_t {
  1416. /** Hashtable node, used to look up the microdesc by its digest. */
  1417. HT_ENTRY(microdesc_t) node;
  1418. /* Cache information */
  1419. /** When was this microdescriptor last listed in a consensus document?
  1420. * Once a microdesc has been unlisted long enough, we can drop it.
  1421. */
  1422. time_t last_listed;
  1423. /** Where is this microdescriptor currently stored? */
  1424. saved_location_t saved_location : 3;
  1425. /** If true, do not attempt to cache this microdescriptor on disk. */
  1426. unsigned int no_save : 1;
  1427. /** If saved_location == SAVED_IN_CACHE, this field holds the offset of the
  1428. * microdescriptor in the cache. */
  1429. off_t off;
  1430. /* The string containing the microdesc. */
  1431. /** A pointer to the encoded body of the microdescriptor. If the
  1432. * saved_location is SAVED_IN_CACHE, then the body is a pointer into an
  1433. * mmap'd region. Otherwise, it is a malloc'd string. The string might not
  1434. * be NUL-terminated; take the length from <b>bodylen</b>. */
  1435. char *body;
  1436. /** The length of the microdescriptor in <b>body</b>. */
  1437. size_t bodylen;
  1438. /** A SHA256-digest of the microdescriptor. */
  1439. char digest[DIGEST256_LEN];
  1440. /* Fields in the microdescriptor. */
  1441. /** As routerinfo_t.onion_pkey */
  1442. crypto_pk_env_t *onion_pkey;
  1443. /** As routerinfo_t.family */
  1444. smartlist_t *family;
  1445. /** Encoded exit policy summary */
  1446. char *exitsummary; /**< exit policy summary -
  1447. * XXX this probably should not stay a string. */
  1448. } microdesc_t;
  1449. /** How many times will we try to download a router's descriptor before giving
  1450. * up? */
  1451. #define MAX_ROUTERDESC_DOWNLOAD_FAILURES 8
  1452. /** Contents of a v2 (non-consensus, non-vote) network status object. */
  1453. typedef struct networkstatus_v2_t {
  1454. /** When did we receive the network-status document? */
  1455. time_t received_on;
  1456. /** What was the digest of the document? */
  1457. char networkstatus_digest[DIGEST_LEN];
  1458. /* These fields come from the actual network-status document.*/
  1459. time_t published_on; /**< Declared publication date. */
  1460. char *source_address; /**< Canonical directory server hostname. */
  1461. uint32_t source_addr; /**< Canonical directory server IP. */
  1462. uint16_t source_dirport; /**< Canonical directory server dirport. */
  1463. unsigned int binds_names:1; /**< True iff this directory server binds
  1464. * names. */
  1465. unsigned int recommends_versions:1; /**< True iff this directory server
  1466. * recommends client and server software
  1467. * versions. */
  1468. unsigned int lists_bad_exits:1; /**< True iff this directory server marks
  1469. * malfunctioning exits as bad. */
  1470. /** True iff this directory server marks malfunctioning directories as
  1471. * bad. */
  1472. unsigned int lists_bad_directories:1;
  1473. char identity_digest[DIGEST_LEN]; /**< Digest of signing key. */
  1474. char *contact; /**< How to contact directory admin? (may be NULL). */
  1475. crypto_pk_env_t *signing_key; /**< Key used to sign this directory. */
  1476. char *client_versions; /**< comma-separated list of recommended client
  1477. * versions. */
  1478. char *server_versions; /**< comma-separated list of recommended server
  1479. * versions. */
  1480. smartlist_t *entries; /**< List of routerstatus_t*. This list is kept
  1481. * sorted by identity_digest. */
  1482. } networkstatus_v2_t;
  1483. typedef struct vote_microdesc_hash_t {
  1484. struct vote_microdesc_hash_t *next;
  1485. char *microdesc_hash_line;
  1486. } vote_microdesc_hash_t;
  1487. /** The claim about a single router, made in a vote. */
  1488. typedef struct vote_routerstatus_t {
  1489. routerstatus_t status; /**< Underlying 'status' object for this router.
  1490. * Flags are redundant. */
  1491. uint64_t flags; /**< Bit-field for all recognized flags; index into
  1492. * networkstatus_t.known_flags. */
  1493. char *version; /**< The version that the authority says this router is
  1494. * running. */
  1495. vote_microdesc_hash_t *microdesc;
  1496. } vote_routerstatus_t;
  1497. /** A signature of some document by an authority. */
  1498. typedef struct document_signature_t {
  1499. /** Declared SHA-1 digest of this voter's identity key */
  1500. char identity_digest[DIGEST_LEN];
  1501. /** Declared SHA-1 digest of signing key used by this voter. */
  1502. char signing_key_digest[DIGEST_LEN];
  1503. /** Algorithm used to compute the digest of the document. */
  1504. digest_algorithm_t alg;
  1505. /** Signature of the signed thing. */
  1506. char *signature;
  1507. /** Length of <b>signature</b> */
  1508. int signature_len;
  1509. unsigned int bad_signature : 1; /**< Set to true if we've tried to verify
  1510. * the sig, and we know it's bad. */
  1511. unsigned int good_signature : 1; /**< Set to true if we've verified the sig
  1512. * as good. */
  1513. } document_signature_t;
  1514. /** Information about a single voter in a vote or a consensus. */
  1515. typedef struct networkstatus_voter_info_t {
  1516. /** Declared SHA-1 digest of this voter's identity key */
  1517. char identity_digest[DIGEST_LEN];
  1518. char *nickname; /**< Nickname of this voter */
  1519. /** Digest of this voter's "legacy" identity key, if any. In vote only; for
  1520. * consensuses, we treat legacy keys as additional signers. */
  1521. char legacy_id_digest[DIGEST_LEN];
  1522. char *address; /**< Address of this voter, in string format. */
  1523. uint32_t addr; /**< Address of this voter, in IPv4, in host order. */
  1524. uint16_t dir_port; /**< Directory port of this voter */
  1525. uint16_t or_port; /**< OR port of this voter */
  1526. char *contact; /**< Contact information for this voter. */
  1527. char vote_digest[DIGEST_LEN]; /**< Digest of this voter's vote, as signed. */
  1528. /* Nothing from here on is signed. */
  1529. /** The signature of the document and the signature's status. */
  1530. smartlist_t *sigs;
  1531. } networkstatus_voter_info_t;
  1532. /** Enumerates the possible seriousness values of a networkstatus document. */
  1533. typedef enum {
  1534. NS_TYPE_VOTE,
  1535. NS_TYPE_CONSENSUS,
  1536. NS_TYPE_OPINION,
  1537. } networkstatus_type_t;
  1538. /** Enumerates recognized flavors of a consensus networkstatus document. All
  1539. * flavors of a consensus are generated from the same set of votes, but they
  1540. * present different types information to different versions of Tor. */
  1541. typedef enum {
  1542. FLAV_NS = 0,
  1543. FLAV_MICRODESC = 1,
  1544. } consensus_flavor_t;
  1545. /** Which consensus flavor do we actually want to use to build circuits? */
  1546. #define USABLE_CONSENSUS_FLAVOR FLAV_NS
  1547. /** How many different consensus flavors are there? */
  1548. #define N_CONSENSUS_FLAVORS ((int)(FLAV_MICRODESC)+1)
  1549. /** A common structure to hold a v3 network status vote, or a v3 network
  1550. * status consensus. */
  1551. typedef struct networkstatus_t {
  1552. networkstatus_type_t type : 8; /**< Vote, consensus, or opinion? */
  1553. consensus_flavor_t flavor : 8; /**< If a consensus, what kind? */
  1554. time_t published; /**< Vote only: Time when vote was written. */
  1555. time_t valid_after; /**< Time after which this vote or consensus applies. */
  1556. time_t fresh_until; /**< Time before which this is the most recent vote or
  1557. * consensus. */
  1558. time_t valid_until; /**< Time after which this vote or consensus should not
  1559. * be used. */
  1560. /** Consensus only: what method was used to produce this consensus? */
  1561. int consensus_method;
  1562. /** Vote only: what methods is this voter willing to use? */
  1563. smartlist_t *supported_methods;
  1564. /** How long does this vote/consensus claim that authorities take to
  1565. * distribute their votes to one another? */
  1566. int vote_seconds;
  1567. /** How long does this vote/consensus claim that authorities take to
  1568. * distribute their consensus signatures to one another? */
  1569. int dist_seconds;
  1570. /** Comma-separated list of recommended client software, or NULL if this
  1571. * voter has no opinion. */
  1572. char *client_versions;
  1573. char *server_versions;
  1574. /** List of flags that this vote/consensus applies to routers. If a flag is
  1575. * not listed here, the voter has no opinion on what its value should be. */
  1576. smartlist_t *known_flags;
  1577. /** List of key=value strings for the parameters in this vote or
  1578. * consensus, sorted by key. */
  1579. smartlist_t *net_params;
  1580. /** List of key=value strings for the bw weight parameters in the
  1581. * consensus. */
  1582. smartlist_t *weight_params;
  1583. /** List of networkstatus_voter_info_t. For a vote, only one element
  1584. * is included. For a consensus, one element is included for every voter
  1585. * whose vote contributed to the consensus. */
  1586. smartlist_t *voters;
  1587. struct authority_cert_t *cert; /**< Vote only: the voter's certificate. */
  1588. /** Digests of this document, as signed. */
  1589. digests_t digests;
  1590. /** List of router statuses, sorted by identity digest. For a vote,
  1591. * the elements are vote_routerstatus_t; for a consensus, the elements
  1592. * are routerstatus_t. */
  1593. smartlist_t *routerstatus_list;
  1594. /** If present, a map from descriptor digest to elements of
  1595. * routerstatus_list. */
  1596. digestmap_t *desc_digest_map;
  1597. } networkstatus_t;
  1598. /** A set of signatures for a networkstatus consensus. Unless otherwise
  1599. * noted, all fields are as for networkstatus_t. */
  1600. typedef struct ns_detached_signatures_t {
  1601. time_t valid_after;
  1602. time_t fresh_until;
  1603. time_t valid_until;
  1604. strmap_t *digests; /**< Map from flavor name to digestset_t */
  1605. strmap_t *signatures; /**< Map from flavor name to list of
  1606. * document_signature_t */
  1607. } ns_detached_signatures_t;
  1608. /** Allowable types of desc_store_t. */
  1609. typedef enum store_type_t {
  1610. ROUTER_STORE = 0,
  1611. EXTRAINFO_STORE = 1
  1612. } store_type_t;
  1613. /** A 'store' is a set of descriptors saved on disk, with accompanying
  1614. * journal, mmaped as needed, rebuilt as needed. */
  1615. typedef struct desc_store_t {
  1616. /** Filename (within DataDir) for the store. We append .tmp to this
  1617. * filename for a temporary file when rebuilding the store, and .new to this
  1618. * filename for the journal. */
  1619. const char *fname_base;
  1620. /** Alternative (obsolete) value for fname_base: if the file named by
  1621. * fname_base isn't present, we read from here instead, but we never write
  1622. * here. */
  1623. const char *fname_alt_base;
  1624. /** Human-readable description of what this store contains. */
  1625. const char *description;
  1626. tor_mmap_t *mmap; /**< A mmap for the main file in the store. */
  1627. store_type_t type; /**< What's stored in this store? */
  1628. /** The size of the router log, in bytes. */
  1629. size_t journal_len;
  1630. /** The size of the router store, in bytes. */
  1631. size_t store_len;
  1632. /** Total bytes dropped since last rebuild: this is space currently
  1633. * used in the cache and the journal that could be freed by a rebuild. */
  1634. size_t bytes_dropped;
  1635. } desc_store_t;
  1636. /** Contents of a directory of onion routers. */
  1637. typedef struct {
  1638. /** Map from server identity digest to a member of routers. */
  1639. struct digest_ri_map_t *identity_map;
  1640. /** Map from server descriptor digest to a signed_descriptor_t from
  1641. * routers or old_routers. */
  1642. struct digest_sd_map_t *desc_digest_map;
  1643. /** Map from extra-info digest to an extrainfo_t. Only exists for
  1644. * routers in routers or old_routers. */
  1645. struct digest_ei_map_t *extra_info_map;
  1646. /** Map from extra-info digests to a signed_descriptor_t for a router
  1647. * descriptor having that extra-info digest. Only exists for
  1648. * routers in routers or old_routers. */
  1649. struct digest_sd_map_t *desc_by_eid_map;
  1650. /** List of routerinfo_t for all currently live routers we know. */
  1651. smartlist_t *routers;
  1652. /** List of signed_descriptor_t for older router descriptors we're
  1653. * caching. */
  1654. smartlist_t *old_routers;
  1655. /** Store holding server descriptors. If present, any router whose
  1656. * cache_info.saved_location == SAVED_IN_CACHE is stored in this file
  1657. * starting at cache_info.saved_offset */
  1658. desc_store_t desc_store;
  1659. /** Store holding extra-info documents. */
  1660. desc_store_t extrainfo_store;
  1661. } routerlist_t;
  1662. /** Information on router used when extending a circuit. We don't need a
  1663. * full routerinfo_t to extend: we only need addr:port:keyid to build an OR
  1664. * connection, and onion_key to create the onionskin. Note that for onehop
  1665. * general-purpose tunnels, the onion_key is NULL. */
  1666. typedef struct extend_info_t {
  1667. char nickname[MAX_HEX_NICKNAME_LEN+1]; /**< This router's nickname for
  1668. * display. */
  1669. char identity_digest[DIGEST_LEN]; /**< Hash of this router's identity key. */
  1670. uint16_t port; /**< OR port. */
  1671. tor_addr_t addr; /**< IP address. */
  1672. crypto_pk_env_t *onion_key; /**< Current onionskin key. */
  1673. } extend_info_t;
  1674. /** Certificate for v3 directory protocol: binds long-term authority identity
  1675. * keys to medium-term authority signing keys. */
  1676. typedef struct authority_cert_t {
  1677. /** Information relating to caching this cert on disk and looking it up. */
  1678. signed_descriptor_t cache_info;
  1679. /** This authority's long-term authority identity key. */
  1680. crypto_pk_env_t *identity_key;
  1681. /** This authority's medium-term signing key. */
  1682. crypto_pk_env_t *signing_key;
  1683. /** The digest of <b>signing_key</b> */
  1684. char signing_key_digest[DIGEST_LEN];
  1685. /** The listed expiration time of this certificate. */
  1686. time_t expires;
  1687. /** This authority's IPv4 address, in host order. */
  1688. uint32_t addr;
  1689. /** This authority's directory port. */
  1690. uint16_t dir_port;
  1691. /** True iff this certificate was cross-certified by signing the identity
  1692. * key with the signing key. */
  1693. uint8_t is_cross_certified;
  1694. } authority_cert_t;
  1695. /** Bitfield enum type listing types of directory authority/directory
  1696. * server. */
  1697. typedef enum {
  1698. NO_AUTHORITY = 0,
  1699. /** Serves/signs v1 directory information: Big lists of routers, and short
  1700. * routerstatus documents. */
  1701. V1_AUTHORITY = 1 << 0,
  1702. /** Serves/signs v2 directory information: i.e. v2 networkstatus documents */
  1703. V2_AUTHORITY = 1 << 1,
  1704. /** Serves/signs v3 directory information: votes, consensuses, certs */
  1705. V3_AUTHORITY = 1 << 2,
  1706. /** Serves hidden service descriptors. */
  1707. HIDSERV_AUTHORITY = 1 << 3,
  1708. /** Serves bridge descriptors. */
  1709. BRIDGE_AUTHORITY = 1 << 4,
  1710. /** Serves extrainfo documents. (XXX Not precisely an authority type)*/
  1711. EXTRAINFO_CACHE = 1 << 5,
  1712. } authority_type_t;
  1713. #define CRYPT_PATH_MAGIC 0x70127012u
  1714. /** Holds accounting information for a single step in the layered encryption
  1715. * performed by a circuit. Used only at the client edge of a circuit. */
  1716. typedef struct crypt_path_t {
  1717. uint32_t magic;
  1718. /* crypto environments */
  1719. /** Encryption key and counter for cells heading towards the OR at this
  1720. * step. */
  1721. crypto_cipher_env_t *f_crypto;
  1722. /** Encryption key and counter for cells heading back from the OR at this
  1723. * step. */
  1724. crypto_cipher_env_t *b_crypto;
  1725. /** Digest state for cells heading towards the OR at this step. */
  1726. crypto_digest_env_t *f_digest; /* for integrity checking */
  1727. /** Digest state for cells heading away from the OR at this step. */
  1728. crypto_digest_env_t *b_digest;
  1729. /** Current state of Diffie-Hellman key negotiation with the OR at this
  1730. * step. */
  1731. crypto_dh_env_t *dh_handshake_state;
  1732. /** Current state of 'fast' (non-PK) key negotiation with the OR at this
  1733. * step. Used to save CPU when TLS is already providing all the
  1734. * authentication, secrecy, and integrity we need, and we're already
  1735. * distinguishable from an OR.
  1736. */
  1737. uint8_t fast_handshake_state[DIGEST_LEN];
  1738. /** Negotiated key material shared with the OR at this step. */
  1739. char handshake_digest[DIGEST_LEN];/* KH in tor-spec.txt */
  1740. /** Information to extend to the OR at this step. */
  1741. extend_info_t *extend_info;
  1742. /** Is the circuit built to this step? Must be one of:
  1743. * - CPATH_STATE_CLOSED (The circuit has not been extended to this step)
  1744. * - CPATH_STATE_AWAITING_KEYS (We have sent an EXTEND/CREATE to this step
  1745. * and not received an EXTENDED/CREATED)
  1746. * - CPATH_STATE_OPEN (The circuit has been extended to this step) */
  1747. uint8_t state;
  1748. #define CPATH_STATE_CLOSED 0
  1749. #define CPATH_STATE_AWAITING_KEYS 1
  1750. #define CPATH_STATE_OPEN 2
  1751. struct crypt_path_t *next; /**< Link to next crypt_path_t in the circuit.
  1752. * (The list is circular, so the last node
  1753. * links to the first.) */
  1754. struct crypt_path_t *prev; /**< Link to previous crypt_path_t in the
  1755. * circuit. */
  1756. int package_window; /**< How many cells are we allowed to originate ending
  1757. * at this step? */
  1758. int deliver_window; /**< How many cells are we willing to deliver originating
  1759. * at this step? */
  1760. } crypt_path_t;
  1761. #define CPATH_KEY_MATERIAL_LEN (20*2+16*2)
  1762. #define DH_KEY_LEN DH_BYTES
  1763. #define ONIONSKIN_CHALLENGE_LEN (PKCS1_OAEP_PADDING_OVERHEAD+\
  1764. CIPHER_KEY_LEN+\
  1765. DH_KEY_LEN)
  1766. #define ONIONSKIN_REPLY_LEN (DH_KEY_LEN+DIGEST_LEN)
  1767. /** Information used to build a circuit. */
  1768. typedef struct {
  1769. /** Intended length of the final circuit. */
  1770. int desired_path_len;
  1771. /** How to extend to the planned exit node. */
  1772. extend_info_t *chosen_exit;
  1773. /** Whether every node in the circ must have adequate uptime. */
  1774. int need_uptime;
  1775. /** Whether every node in the circ must have adequate capacity. */
  1776. int need_capacity;
  1777. /** Whether the last hop was picked with exiting in mind. */
  1778. int is_internal;
  1779. /** Did we pick this as a one-hop tunnel (not safe for other conns)?
  1780. * These are for encrypted connections that exit to this router, not
  1781. * for arbitrary exits from the circuit. */
  1782. int onehop_tunnel;
  1783. /** The crypt_path_t to append after rendezvous: used for rendezvous. */
  1784. crypt_path_t *pending_final_cpath;
  1785. /** How many times has building a circuit for this task failed? */
  1786. int failure_count;
  1787. /** At what time should we give up on this task? */
  1788. time_t expiry_time;
  1789. } cpath_build_state_t;
  1790. /**
  1791. * The cell_ewma_t structure keeps track of how many cells a circuit has
  1792. * transferred recently. It keeps an EWMA (exponentially weighted moving
  1793. * average) of the number of cells flushed from the circuit queue onto a
  1794. * connection in connection_or_flush_from_first_active_circuit().
  1795. */
  1796. typedef struct {
  1797. /** The last 'tick' at which we recalibrated cell_count.
  1798. *
  1799. * A cell sent at exactly the start of this tick has weight 1.0. Cells sent
  1800. * since the start of this tick have weight greater than 1.0; ones sent
  1801. * earlier have less weight. */
  1802. unsigned last_adjusted_tick;
  1803. /** The EWMA of the cell count. */
  1804. double cell_count;
  1805. /** True iff this is the cell count for a circuit's previous
  1806. * connection. */
  1807. unsigned int is_for_p_conn : 1;
  1808. /** The position of the circuit within the OR connection's priority
  1809. * queue. */
  1810. int heap_index;
  1811. } cell_ewma_t;
  1812. #define ORIGIN_CIRCUIT_MAGIC 0x35315243u
  1813. #define OR_CIRCUIT_MAGIC 0x98ABC04Fu
  1814. /**
  1815. * A circuit is a path over the onion routing
  1816. * network. Applications can connect to one end of the circuit, and can
  1817. * create exit connections at the other end of the circuit. AP and exit
  1818. * connections have only one circuit associated with them (and thus these
  1819. * connection types are closed when the circuit is closed), whereas
  1820. * OR connections multiplex many circuits at once, and stay standing even
  1821. * when there are no circuits running over them.
  1822. *
  1823. * A circuit_t structure can fill one of two roles. First, a or_circuit_t
  1824. * links two connections together: either an edge connection and an OR
  1825. * connection, or two OR connections. (When joined to an OR connection, a
  1826. * circuit_t affects only cells sent to a particular circID on that
  1827. * connection. When joined to an edge connection, a circuit_t affects all
  1828. * data.)
  1829. * Second, an origin_circuit_t holds the cipher keys and state for sending data
  1830. * along a given circuit. At the OP, it has a sequence of ciphers, each
  1831. * of which is shared with a single OR along the circuit. Separate
  1832. * ciphers are used for data going "forward" (away from the OP) and
  1833. * "backward" (towards the OP). At the OR, a circuit has only two stream
  1834. * ciphers: one for data going forward, and one for data going backward.
  1835. */
  1836. typedef struct circuit_t {
  1837. uint32_t magic; /**< For memory and type debugging: must equal
  1838. * ORIGIN_CIRCUIT_MAGIC or OR_CIRCUIT_MAGIC. */
  1839. /** Queue of cells waiting to be transmitted on n_conn. */
  1840. cell_queue_t n_conn_cells;
  1841. /** The OR connection that is next in this circuit. */
  1842. or_connection_t *n_conn;
  1843. /** The circuit_id used in the next (forward) hop of this circuit. */
  1844. circid_t n_circ_id;
  1845. /** The hop to which we want to extend this circuit. Should be NULL if
  1846. * the circuit has attached to a connection. */
  1847. extend_info_t *n_hop;
  1848. /** True iff we are waiting for n_conn_cells to become less full before
  1849. * allowing p_streams to add any more cells. (Origin circuit only.) */
  1850. unsigned int streams_blocked_on_n_conn : 1;
  1851. /** True iff we are waiting for p_conn_cells to become less full before
  1852. * allowing n_streams to add any more cells. (OR circuit only.) */
  1853. unsigned int streams_blocked_on_p_conn : 1;
  1854. uint8_t state; /**< Current status of this circuit. */
  1855. uint8_t purpose; /**< Why are we creating this circuit? */
  1856. /** How many relay data cells can we package (read from edge streams)
  1857. * on this circuit before we receive a circuit-level sendme cell asking
  1858. * for more? */
  1859. int package_window;
  1860. /** How many relay data cells will we deliver (write to edge streams)
  1861. * on this circuit? When deliver_window gets low, we send some
  1862. * circuit-level sendme cells to indicate that we're willing to accept
  1863. * more. */
  1864. int deliver_window;
  1865. /** For storage while n_conn is pending
  1866. * (state CIRCUIT_STATE_OR_WAIT). When defined, it is always
  1867. * length ONIONSKIN_CHALLENGE_LEN. */
  1868. char *n_conn_onionskin;
  1869. time_t timestamp_created; /**< When was this circuit created? */
  1870. time_t timestamp_dirty; /**< When the circuit was first used, or 0 if the
  1871. * circuit is clean. */
  1872. struct timeval highres_created; /**< When exactly was the circuit created? */
  1873. uint16_t marked_for_close; /**< Should we close this circuit at the end of
  1874. * the main loop? (If true, holds the line number
  1875. * where this circuit was marked.) */
  1876. const char *marked_for_close_file; /**< For debugging: in which file was this
  1877. * circuit marked for close? */
  1878. /** Next circuit in the doubly-linked ring of circuits waiting to add
  1879. * cells to n_conn. NULL if we have no cells pending, or if we're not
  1880. * linked to an OR connection. */
  1881. struct circuit_t *next_active_on_n_conn;
  1882. /** Previous circuit in the doubly-linked ring of circuits waiting to add
  1883. * cells to n_conn. NULL if we have no cells pending, or if we're not
  1884. * linked to an OR connection. */
  1885. struct circuit_t *prev_active_on_n_conn;
  1886. struct circuit_t *next; /**< Next circuit in linked list of all circuits. */
  1887. /** Unique ID for measuring tunneled network status requests. */
  1888. uint64_t dirreq_id;
  1889. /** The EWMA count for the number of cells flushed from the
  1890. * n_conn_cells queue. Used to determine which circuit to flush from next.
  1891. */
  1892. cell_ewma_t n_cell_ewma;
  1893. } circuit_t;
  1894. /** Largest number of relay_early cells that we can send on a given
  1895. * circuit. */
  1896. #define MAX_RELAY_EARLY_CELLS_PER_CIRCUIT 8
  1897. /** An origin_circuit_t holds data necessary to build and use a circuit.
  1898. */
  1899. typedef struct origin_circuit_t {
  1900. circuit_t _base;
  1901. /** Linked list of AP streams (or EXIT streams if hidden service)
  1902. * associated with this circuit. */
  1903. edge_connection_t *p_streams;
  1904. /** Build state for this circuit. It includes the intended path
  1905. * length, the chosen exit router, rendezvous information, etc.
  1906. */
  1907. cpath_build_state_t *build_state;
  1908. /** The doubly-linked list of crypt_path_t entries, one per hop,
  1909. * for this circuit. This includes ciphers for each hop,
  1910. * integrity-checking digests for each hop, and package/delivery
  1911. * windows for each hop.
  1912. */
  1913. crypt_path_t *cpath;
  1914. /** Holds all rendezvous data on either client or service side. */
  1915. rend_data_t *rend_data;
  1916. /** How many more relay_early cells can we send on this circuit, according
  1917. * to the specification? */
  1918. unsigned int remaining_relay_early_cells : 4;
  1919. /** Set if this circuit is insanely old and we already informed the user */
  1920. unsigned int is_ancient : 1;
  1921. /** Set if this circuit has already been opened. Used to detect
  1922. * cannibalized circuits. */
  1923. unsigned int has_opened : 1;
  1924. /** What commands were sent over this circuit that decremented the
  1925. * RELAY_EARLY counter? This is for debugging task 878. */
  1926. uint8_t relay_early_commands[MAX_RELAY_EARLY_CELLS_PER_CIRCUIT];
  1927. /** How many RELAY_EARLY cells have been sent over this circuit? This is
  1928. * for debugging task 878, too. */
  1929. int relay_early_cells_sent;
  1930. /** The next stream_id that will be tried when we're attempting to
  1931. * construct a new AP stream originating at this circuit. */
  1932. streamid_t next_stream_id;
  1933. /* The intro key replaces the hidden service's public key if purpose is
  1934. * S_ESTABLISH_INTRO or S_INTRO, provided that no unversioned rendezvous
  1935. * descriptor is used. */
  1936. crypto_pk_env_t *intro_key;
  1937. /** Quasi-global identifier for this circuit; used for control.c */
  1938. /* XXXX NM This can get re-used after 2**32 circuits. */
  1939. uint32_t global_identifier;
  1940. } origin_circuit_t;
  1941. /** An or_circuit_t holds information needed to implement a circuit at an
  1942. * OR. */
  1943. typedef struct or_circuit_t {
  1944. circuit_t _base;
  1945. /** Next circuit in the doubly-linked ring of circuits waiting to add
  1946. * cells to p_conn. NULL if we have no cells pending, or if we're not
  1947. * linked to an OR connection. */
  1948. struct circuit_t *next_active_on_p_conn;
  1949. /** Previous circuit in the doubly-linked ring of circuits waiting to add
  1950. * cells to p_conn. NULL if we have no cells pending, or if we're not
  1951. * linked to an OR connection. */
  1952. struct circuit_t *prev_active_on_p_conn;
  1953. /** The circuit_id used in the previous (backward) hop of this circuit. */
  1954. circid_t p_circ_id;
  1955. /** Queue of cells waiting to be transmitted on p_conn. */
  1956. cell_queue_t p_conn_cells;
  1957. /** The OR connection that is previous in this circuit. */
  1958. or_connection_t *p_conn;
  1959. /** Linked list of Exit streams associated with this circuit. */
  1960. edge_connection_t *n_streams;
  1961. /** Linked list of Exit streams associated with this circuit that are
  1962. * still being resolved. */
  1963. edge_connection_t *resolving_streams;
  1964. /** The cipher used by intermediate hops for cells heading toward the
  1965. * OP. */
  1966. crypto_cipher_env_t *p_crypto;
  1967. /** The cipher used by intermediate hops for cells heading away from
  1968. * the OP. */
  1969. crypto_cipher_env_t *n_crypto;
  1970. /** The integrity-checking digest used by intermediate hops, for
  1971. * cells packaged here and heading towards the OP.
  1972. */
  1973. crypto_digest_env_t *p_digest;
  1974. /** The integrity-checking digest used by intermediate hops, for
  1975. * cells packaged at the OP and arriving here.
  1976. */
  1977. crypto_digest_env_t *n_digest;
  1978. /** Points to spliced circuit if purpose is REND_ESTABLISHED, and circuit
  1979. * is not marked for close. */
  1980. struct or_circuit_t *rend_splice;
  1981. #if REND_COOKIE_LEN >= DIGEST_LEN
  1982. #define REND_TOKEN_LEN REND_COOKIE_LEN
  1983. #else
  1984. #define REND_TOKEN_LEN DIGEST_LEN
  1985. #endif
  1986. /** A hash of location-hidden service's PK if purpose is INTRO_POINT, or a
  1987. * rendezvous cookie if purpose is REND_POINT_WAITING. Filled with zeroes
  1988. * otherwise.
  1989. * ???? move to a subtype or adjunct structure? Wastes 20 bytes. -NM
  1990. */
  1991. char rend_token[REND_TOKEN_LEN];
  1992. /* ???? move to a subtype or adjunct structure? Wastes 20 bytes -NM */
  1993. char handshake_digest[DIGEST_LEN]; /**< Stores KH for the handshake. */
  1994. /** How many more relay_early cells can we send on this circuit, according
  1995. * to the specification? */
  1996. unsigned int remaining_relay_early_cells : 4;
  1997. /** True iff this circuit was made with a CREATE_FAST cell. */
  1998. unsigned int is_first_hop : 1;
  1999. /** Number of cells that were removed from circuit queue; reset every
  2000. * time when writing buffer stats to disk. */
  2001. uint32_t processed_cells;
  2002. /** Total time in milliseconds that cells spent in both app-ward and
  2003. * exit-ward queues of this circuit; reset every time when writing
  2004. * buffer stats to disk. */
  2005. uint64_t total_cell_waiting_time;
  2006. /** The EWMA count for the number of cells flushed from the
  2007. * p_conn_cells queue. */
  2008. cell_ewma_t p_cell_ewma;
  2009. } or_circuit_t;
  2010. /** Convert a circuit subtype to a circuit_t.*/
  2011. #define TO_CIRCUIT(x) (&((x)->_base))
  2012. /** Convert a circuit_t* to a pointer to the enclosing or_circuit_t. Asserts
  2013. * if the cast is impossible. */
  2014. static or_circuit_t *TO_OR_CIRCUIT(circuit_t *);
  2015. /** Convert a circuit_t* to a pointer to the enclosing origin_circuit_t.
  2016. * Asserts if the cast is impossible. */
  2017. static origin_circuit_t *TO_ORIGIN_CIRCUIT(circuit_t *);
  2018. static INLINE or_circuit_t *TO_OR_CIRCUIT(circuit_t *x)
  2019. {
  2020. tor_assert(x->magic == OR_CIRCUIT_MAGIC);
  2021. return DOWNCAST(or_circuit_t, x);
  2022. }
  2023. static INLINE origin_circuit_t *TO_ORIGIN_CIRCUIT(circuit_t *x)
  2024. {
  2025. tor_assert(x->magic == ORIGIN_CIRCUIT_MAGIC);
  2026. return DOWNCAST(origin_circuit_t, x);
  2027. }
  2028. /** Bitfield type: things that we're willing to use invalid routers for. */
  2029. typedef enum invalid_router_usage_t {
  2030. ALLOW_INVALID_ENTRY =1,
  2031. ALLOW_INVALID_EXIT =2,
  2032. ALLOW_INVALID_MIDDLE =4,
  2033. ALLOW_INVALID_RENDEZVOUS =8,
  2034. ALLOW_INVALID_INTRODUCTION=16,
  2035. } invalid_router_usage_t;
  2036. /* limits for TCP send and recv buffer size used for constrained sockets */
  2037. #define MIN_CONSTRAINED_TCP_BUFFER 2048
  2038. #define MAX_CONSTRAINED_TCP_BUFFER 262144 /* 256k */
  2039. /** A linked list of lines in a config file. */
  2040. typedef struct config_line_t {
  2041. char *key;
  2042. char *value;
  2043. struct config_line_t *next;
  2044. } config_line_t;
  2045. typedef struct routerset_t routerset_t;
  2046. /** Configuration options for a Tor process. */
  2047. typedef struct {
  2048. uint32_t _magic;
  2049. /** What should the tor process actually do? */
  2050. enum {
  2051. CMD_RUN_TOR=0, CMD_LIST_FINGERPRINT, CMD_HASH_PASSWORD,
  2052. CMD_VERIFY_CONFIG, CMD_RUN_UNITTESTS
  2053. } command;
  2054. const char *command_arg; /**< Argument for command-line option. */
  2055. config_line_t *Logs; /**< New-style list of configuration lines
  2056. * for logs */
  2057. int LogMessageDomains; /**< Boolean: Should we log the domain(s) in which
  2058. * each log message occurs? */
  2059. char *DebugLogFile; /**< Where to send verbose log messages. */
  2060. char *DataDirectory; /**< OR only: where to store long-term data. */
  2061. char *Nickname; /**< OR only: nickname of this onion router. */
  2062. char *Address; /**< OR only: configured address for this onion router. */
  2063. char *PidFile; /**< Where to store PID of Tor process. */
  2064. routerset_t *ExitNodes; /**< Structure containing nicknames, digests,
  2065. * country codes and IP address patterns of ORs to
  2066. * consider as exits. */
  2067. routerset_t *EntryNodes;/**< Structure containing nicknames, digests,
  2068. * country codes and IP address patterns of ORs to
  2069. * consider as entry points. */
  2070. int StrictNodes; /**< Boolean: When none of our EntryNodes or ExitNodes
  2071. * are up, or we need to access a node in ExcludeNodes,
  2072. * do we just fail instead? */
  2073. routerset_t *ExcludeNodes;/**< Structure containing nicknames, digests,
  2074. * country codes and IP address patterns of ORs
  2075. * not to use in circuits. But see StrictNodes
  2076. * above. */
  2077. routerset_t *ExcludeExitNodes;/**< Structure containing nicknames, digests,
  2078. * country codes and IP address patterns of
  2079. * ORs not to consider as exits. */
  2080. /** Union of ExcludeNodes and ExcludeExitNodes */
  2081. struct routerset_t *_ExcludeExitNodesUnion;
  2082. int DisableAllSwap; /**< Boolean: Attempt to call mlockall() on our
  2083. * process for all current and future memory. */
  2084. /** List of "entry", "middle", "exit", "introduction", "rendezvous". */
  2085. smartlist_t *AllowInvalidNodes;
  2086. /** Bitmask; derived from AllowInvalidNodes. */
  2087. invalid_router_usage_t _AllowInvalid;
  2088. config_line_t *ExitPolicy; /**< Lists of exit policy components. */
  2089. int ExitPolicyRejectPrivate; /**< Should we not exit to local addresses? */
  2090. config_line_t *SocksPolicy; /**< Lists of socks policy components */
  2091. config_line_t *DirPolicy; /**< Lists of dir policy components */
  2092. /** Addresses to bind for listening for SOCKS connections. */
  2093. config_line_t *SocksListenAddress;
  2094. /** Addresses to bind for listening for transparent pf/netfilter
  2095. * connections. */
  2096. config_line_t *TransListenAddress;
  2097. /** Addresses to bind for listening for transparent natd connections */
  2098. config_line_t *NATDListenAddress;
  2099. /** Addresses to bind for listening for SOCKS connections. */
  2100. config_line_t *DNSListenAddress;
  2101. /** Addresses to bind for listening for OR connections. */
  2102. config_line_t *ORListenAddress;
  2103. /** Addresses to bind for listening for directory connections. */
  2104. config_line_t *DirListenAddress;
  2105. /** Addresses to bind for listening for control connections. */
  2106. config_line_t *ControlListenAddress;
  2107. /** Local address to bind outbound sockets */
  2108. char *OutboundBindAddress;
  2109. /** Directory server only: which versions of
  2110. * Tor should we tell users to run? */
  2111. config_line_t *RecommendedVersions;
  2112. config_line_t *RecommendedClientVersions;
  2113. config_line_t *RecommendedServerVersions;
  2114. /** Whether dirservers refuse router descriptors with private IPs. */
  2115. int DirAllowPrivateAddresses;
  2116. char *User; /**< Name of user to run Tor as. */
  2117. char *Group; /**< Name of group to run Tor as. */
  2118. int ORPort; /**< Port to listen on for OR connections. */
  2119. int SocksPort; /**< Port to listen on for SOCKS connections. */
  2120. /** Port to listen on for transparent pf/netfilter connections. */
  2121. int TransPort;
  2122. int NATDPort; /**< Port to listen on for transparent natd connections. */
  2123. int ControlPort; /**< Port to listen on for control connections. */
  2124. config_line_t *ControlSocket; /**< List of Unix Domain Sockets to listen on
  2125. * for control connections. */
  2126. int DirPort; /**< Port to listen on for directory connections. */
  2127. int DNSPort; /**< Port to listen on for DNS requests. */
  2128. int AssumeReachable; /**< Whether to publish our descriptor regardless. */
  2129. int AuthoritativeDir; /**< Boolean: is this an authoritative directory? */
  2130. int V1AuthoritativeDir; /**< Boolean: is this an authoritative directory
  2131. * for version 1 directories? */
  2132. int V2AuthoritativeDir; /**< Boolean: is this an authoritative directory
  2133. * for version 2 directories? */
  2134. int V3AuthoritativeDir; /**< Boolean: is this an authoritative directory
  2135. * for version 3 directories? */
  2136. int HSAuthoritativeDir; /**< Boolean: does this an authoritative directory
  2137. * handle hidden service requests? */
  2138. int NamingAuthoritativeDir; /**< Boolean: is this an authoritative directory
  2139. * that's willing to bind names? */
  2140. int VersioningAuthoritativeDir; /**< Boolean: is this an authoritative
  2141. * directory that's willing to recommend
  2142. * versions? */
  2143. int BridgeAuthoritativeDir; /**< Boolean: is this an authoritative directory
  2144. * that aggregates bridge descriptors? */
  2145. /** If set on a bridge authority, it will answer requests on its dirport
  2146. * for bridge statuses -- but only if the requests use this password.
  2147. * If set on a bridge user, request bridge statuses, and use this password
  2148. * when doing so. */
  2149. char *BridgePassword;
  2150. int UseBridges; /**< Boolean: should we start all circuits with a bridge? */
  2151. config_line_t *Bridges; /**< List of bootstrap bridge addresses. */
  2152. int BridgeRelay; /**< Boolean: are we acting as a bridge relay? We make
  2153. * this explicit so we can change how we behave in the
  2154. * future. */
  2155. /** Boolean: if we know the bridge's digest, should we get new
  2156. * descriptors from the bridge authorities or from the bridge itself? */
  2157. int UpdateBridgesFromAuthority;
  2158. int AvoidDiskWrites; /**< Boolean: should we never cache things to disk?
  2159. * Not used yet. */
  2160. int ClientOnly; /**< Boolean: should we never evolve into a server role? */
  2161. /** To what authority types do we publish our descriptor? Choices are
  2162. * "v1", "v2", "v3", "bridge", or "". */
  2163. smartlist_t *PublishServerDescriptor;
  2164. /** An authority type, derived from PublishServerDescriptor. */
  2165. authority_type_t _PublishServerDescriptor;
  2166. /** Boolean: do we publish hidden service descriptors to the HS auths? */
  2167. int PublishHidServDescriptors;
  2168. int FetchServerDescriptors; /**< Do we fetch server descriptors as normal? */
  2169. int FetchHidServDescriptors; /** and hidden service descriptors? */
  2170. int HidServDirectoryV2; /**< Do we participate in the HS DHT? */
  2171. int MinUptimeHidServDirectoryV2; /**< As directory authority, accept hidden
  2172. * service directories after what time? */
  2173. int FetchUselessDescriptors; /**< Do we fetch non-running descriptors too? */
  2174. int AllDirActionsPrivate; /**< Should every directory action be sent
  2175. * through a Tor circuit? */
  2176. int ConnLimit; /**< Demanded minimum number of simultaneous connections. */
  2177. int _ConnLimit; /**< Maximum allowed number of simultaneous connections. */
  2178. int RunAsDaemon; /**< If true, run in the background. (Unix only) */
  2179. int FascistFirewall; /**< Whether to prefer ORs reachable on open ports. */
  2180. smartlist_t *FirewallPorts; /**< Which ports our firewall allows
  2181. * (strings). */
  2182. config_line_t *ReachableAddresses; /**< IP:ports our firewall allows. */
  2183. config_line_t *ReachableORAddresses; /**< IP:ports for OR conns. */
  2184. config_line_t *ReachableDirAddresses; /**< IP:ports for Dir conns. */
  2185. int ConstrainedSockets; /**< Shrink xmit and recv socket buffers. */
  2186. uint64_t ConstrainedSockSize; /**< Size of constrained buffers. */
  2187. /** Whether we should drop exit streams from Tors that we don't know are
  2188. * relays. One of "0" (never refuse), "1" (always refuse), or "auto" (do
  2189. * what the consensus says, defaulting to 'refuse' if the consensus says
  2190. * nothing). */
  2191. char *RefuseUnknownExits;
  2192. /** Parsed version of RefuseUnknownExits. -1 for auto. */
  2193. int RefuseUnknownExits_;
  2194. /** Application ports that require all nodes in circ to have sufficient
  2195. * uptime. */
  2196. smartlist_t *LongLivedPorts;
  2197. /** Application ports that are likely to be unencrypted and
  2198. * unauthenticated; we reject requests for them to prevent the
  2199. * user from screwing up and leaking plaintext secrets to an
  2200. * observer somewhere on the Internet. */
  2201. smartlist_t *RejectPlaintextPorts;
  2202. /** Related to RejectPlaintextPorts above, except this config option
  2203. * controls whether we warn (in the log and via a controller status
  2204. * event) every time a risky connection is attempted. */
  2205. smartlist_t *WarnPlaintextPorts;
  2206. /** Should we try to reuse the same exit node for a given host */
  2207. smartlist_t *TrackHostExits;
  2208. int TrackHostExitsExpire; /**< Number of seconds until we expire an
  2209. * addressmap */
  2210. config_line_t *AddressMap; /**< List of address map directives. */
  2211. int AutomapHostsOnResolve; /**< If true, when we get a resolve request for a
  2212. * hostname ending with one of the suffixes in
  2213. * <b>AutomapHostsSuffixes</b>, map it to a
  2214. * virtual address. */
  2215. smartlist_t *AutomapHostsSuffixes; /**< List of suffixes for
  2216. * <b>AutomapHostsOnResolve</b>. */
  2217. int RendPostPeriod; /**< How often do we post each rendezvous service
  2218. * descriptor? Remember to publish them independently. */
  2219. int KeepalivePeriod; /**< How often do we send padding cells to keep
  2220. * connections alive? */
  2221. int SocksTimeout; /**< How long do we let a socks connection wait
  2222. * unattached before we fail it? */
  2223. int LearnCircuitBuildTimeout; /**< If non-zero, we attempt to learn a value
  2224. * for CircuitBuildTimeout based on timeout
  2225. * history */
  2226. int CircuitBuildTimeout; /**< Cull non-open circuits that were born at
  2227. * least this many seconds ago. Used until
  2228. * adaptive algorithm learns a new value. */
  2229. int CircuitIdleTimeout; /**< Cull open clean circuits that were born
  2230. * at least this many seconds ago. */
  2231. int CircuitStreamTimeout; /**< If non-zero, detach streams from circuits
  2232. * and try a new circuit if the stream has been
  2233. * waiting for this many seconds. If zero, use
  2234. * our default internal timeout schedule. */
  2235. int MaxOnionsPending; /**< How many circuit CREATE requests do we allow
  2236. * to wait simultaneously before we start dropping
  2237. * them? */
  2238. int NewCircuitPeriod; /**< How long do we use a circuit before building
  2239. * a new one? */
  2240. int MaxCircuitDirtiness; /**< Never use circs that were first used more than
  2241. this interval ago. */
  2242. uint64_t BandwidthRate; /**< How much bandwidth, on average, are we willing
  2243. * to use in a second? */
  2244. uint64_t BandwidthBurst; /**< How much bandwidth, at maximum, are we willing
  2245. * to use in a second? */
  2246. uint64_t MaxAdvertisedBandwidth; /**< How much bandwidth are we willing to
  2247. * tell people we have? */
  2248. uint64_t RelayBandwidthRate; /**< How much bandwidth, on average, are we
  2249. * willing to use for all relayed conns? */
  2250. uint64_t RelayBandwidthBurst; /**< How much bandwidth, at maximum, will we
  2251. * use in a second for all relayed conns? */
  2252. uint64_t PerConnBWRate; /**< Long-term bw on a single TLS conn, if set. */
  2253. uint64_t PerConnBWBurst; /**< Allowed burst on a single TLS conn, if set. */
  2254. int NumCPUs; /**< How many CPUs should we try to use? */
  2255. //int RunTesting; /**< If true, create testing circuits to measure how well the
  2256. // * other ORs are running. */
  2257. config_line_t *RendConfigLines; /**< List of configuration lines
  2258. * for rendezvous services. */
  2259. config_line_t *HidServAuth; /**< List of configuration lines for client-side
  2260. * authorizations for hidden services */
  2261. char *ContactInfo; /**< Contact info to be published in the directory. */
  2262. char *HTTPProxy; /**< hostname[:port] to use as http proxy, if any. */
  2263. tor_addr_t HTTPProxyAddr; /**< Parsed IPv4 addr for http proxy, if any. */
  2264. uint16_t HTTPProxyPort; /**< Parsed port for http proxy, if any. */
  2265. char *HTTPProxyAuthenticator; /**< username:password string, if any. */
  2266. char *HTTPSProxy; /**< hostname[:port] to use as https proxy, if any. */
  2267. tor_addr_t HTTPSProxyAddr; /**< Parsed addr for https proxy, if any. */
  2268. uint16_t HTTPSProxyPort; /**< Parsed port for https proxy, if any. */
  2269. char *HTTPSProxyAuthenticator; /**< username:password string, if any. */
  2270. char *Socks4Proxy; /**< hostname:port to use as a SOCKS4 proxy, if any. */
  2271. tor_addr_t Socks4ProxyAddr; /**< Derived from Socks4Proxy. */
  2272. uint16_t Socks4ProxyPort; /**< Derived from Socks4Proxy. */
  2273. char *Socks5Proxy; /**< hostname:port to use as a SOCKS5 proxy, if any. */
  2274. tor_addr_t Socks5ProxyAddr; /**< Derived from Sock5Proxy. */
  2275. uint16_t Socks5ProxyPort; /**< Derived from Socks5Proxy. */
  2276. char *Socks5ProxyUsername; /**< Username for SOCKS5 authentication, if any */
  2277. char *Socks5ProxyPassword; /**< Password for SOCKS5 authentication, if any */
  2278. /** List of configuration lines for replacement directory authorities.
  2279. * If you just want to replace one class of authority at a time,
  2280. * use the "Alternate*Authority" options below instead. */
  2281. config_line_t *DirServers;
  2282. /** If set, use these main (currently v3) directory authorities and
  2283. * not the default ones. */
  2284. config_line_t *AlternateDirAuthority;
  2285. /** If set, use these bridge authorities and not the default one. */
  2286. config_line_t *AlternateBridgeAuthority;
  2287. /** If set, use these HS authorities and not the default ones. */
  2288. config_line_t *AlternateHSAuthority;
  2289. char *MyFamily; /**< Declared family for this OR. */
  2290. config_line_t *NodeFamilies; /**< List of config lines for
  2291. * node families */
  2292. config_line_t *AuthDirBadDir; /**< Address policy for descriptors to
  2293. * mark as bad dir mirrors. */
  2294. config_line_t *AuthDirBadExit; /**< Address policy for descriptors to
  2295. * mark as bad exits. */
  2296. config_line_t *AuthDirReject; /**< Address policy for descriptors to
  2297. * reject. */
  2298. config_line_t *AuthDirInvalid; /**< Address policy for descriptors to
  2299. * never mark as valid. */
  2300. int AuthDirListBadDirs; /**< True iff we should list bad dirs,
  2301. * and vote for all other dir mirrors as good. */
  2302. int AuthDirListBadExits; /**< True iff we should list bad exits,
  2303. * and vote for all other exits as good. */
  2304. int AuthDirRejectUnlisted; /**< Boolean: do we reject all routers that
  2305. * aren't named in our fingerprint file? */
  2306. int AuthDirMaxServersPerAddr; /**< Do not permit more than this
  2307. * number of servers per IP address. */
  2308. int AuthDirMaxServersPerAuthAddr; /**< Do not permit more than this
  2309. * number of servers per IP address shared
  2310. * with an authority. */
  2311. char *AccountingStart; /**< How long is the accounting interval, and when
  2312. * does it start? */
  2313. uint64_t AccountingMax; /**< How many bytes do we allow per accounting
  2314. * interval before hibernation? 0 for "never
  2315. * hibernate." */
  2316. /** Base64-encoded hash of accepted passwords for the control system. */
  2317. config_line_t *HashedControlPassword;
  2318. /** As HashedControlPassword, but not saved. */
  2319. config_line_t *HashedControlSessionPassword;
  2320. int CookieAuthentication; /**< Boolean: do we enable cookie-based auth for
  2321. * the control system? */
  2322. char *CookieAuthFile; /**< Location of a cookie authentication file. */
  2323. int CookieAuthFileGroupReadable; /**< Boolean: Is the CookieAuthFile g+r? */
  2324. int LeaveStreamsUnattached; /**< Boolean: Does Tor attach new streams to
  2325. * circuits itself (0), or does it expect a controller
  2326. * to cope? (1) */
  2327. int DisablePredictedCircuits; /**< Boolean: does Tor preemptively
  2328. * make circuits in the background (0),
  2329. * or not (1)? */
  2330. int ShutdownWaitLength; /**< When we get a SIGINT and we're a server, how
  2331. * long do we wait before exiting? */
  2332. char *SafeLogging; /**< Contains "relay", "1", "0" (meaning no scrubbing). */
  2333. /* Derived from SafeLogging */
  2334. enum {
  2335. SAFELOG_SCRUB_ALL, SAFELOG_SCRUB_RELAY, SAFELOG_SCRUB_NONE
  2336. } _SafeLogging;
  2337. int SafeSocks; /**< Boolean: should we outright refuse application
  2338. * connections that use socks4 or socks5-with-local-dns? */
  2339. #define LOG_PROTOCOL_WARN (get_options()->ProtocolWarnings ? \
  2340. LOG_WARN : LOG_INFO)
  2341. int ProtocolWarnings; /**< Boolean: when other parties screw up the Tor
  2342. * protocol, is it a warn or an info in our logs? */
  2343. int TestSocks; /**< Boolean: when we get a socks connection, do we loudly
  2344. * log whether it was DNS-leaking or not? */
  2345. int HardwareAccel; /**< Boolean: Should we enable OpenSSL hardware
  2346. * acceleration where available? */
  2347. char *AccelName; /**< Optional hardware acceleration engine name. */
  2348. char *AccelDir; /**< Optional hardware acceleration engine search dir. */
  2349. int UseEntryGuards; /**< Boolean: Do we try to enter from a smallish number
  2350. * of fixed nodes? */
  2351. int NumEntryGuards; /**< How many entry guards do we try to establish? */
  2352. int RephistTrackTime; /**< How many seconds do we keep rephist info? */
  2353. int FastFirstHopPK; /**< If Tor believes it is safe, should we save a third
  2354. * of our PK time by sending CREATE_FAST cells? */
  2355. /** Should we always fetch our dir info on the mirror schedule (which
  2356. * means directly from the authorities) no matter our other config? */
  2357. int FetchDirInfoEarly;
  2358. /** Should we fetch our dir info at the start of the consensus period? */
  2359. int FetchDirInfoExtraEarly;
  2360. char *VirtualAddrNetwork; /**< Address and mask to hand out for virtual
  2361. * MAPADDRESS requests. */
  2362. int ServerDNSSearchDomains; /**< Boolean: If set, we don't force exit
  2363. * addresses to be FQDNs, but rather search for them in
  2364. * the local domains. */
  2365. int ServerDNSDetectHijacking; /**< Boolean: If true, check for DNS failure
  2366. * hijacking. */
  2367. int ServerDNSRandomizeCase; /**< Boolean: Use the 0x20-hack to prevent
  2368. * DNS poisoning attacks. */
  2369. char *ServerDNSResolvConfFile; /**< If provided, we configure our internal
  2370. * resolver from the file here rather than from
  2371. * /etc/resolv.conf (Unix) or the registry (Windows). */
  2372. char *DirPortFrontPage; /**< This is a full path to a file with an html
  2373. disclaimer. This allows a server administrator to show
  2374. that they're running Tor and anyone visiting their server
  2375. will know this without any specialized knowledge. */
  2376. /** Boolean: if set, we start even if our resolv.conf file is missing
  2377. * or broken. */
  2378. int ServerDNSAllowBrokenConfig;
  2379. smartlist_t *ServerDNSTestAddresses; /**< A list of addresses that definitely
  2380. * should be resolvable. Used for
  2381. * testing our DNS server. */
  2382. int EnforceDistinctSubnets; /**< If true, don't allow multiple routers in the
  2383. * same network zone in the same circuit. */
  2384. int TunnelDirConns; /**< If true, use BEGIN_DIR rather than BEGIN when
  2385. * possible. */
  2386. int PreferTunneledDirConns; /**< If true, avoid dirservers that don't
  2387. * support BEGIN_DIR, when possible. */
  2388. int AllowNonRFC953Hostnames; /**< If true, we allow connections to hostnames
  2389. * with weird characters. */
  2390. /** If true, we try resolving hostnames with weird characters. */
  2391. int ServerDNSAllowNonRFC953Hostnames;
  2392. /** If true, we try to download extra-info documents (and we serve them,
  2393. * if we are a cache). For authorities, this is always true. */
  2394. int DownloadExtraInfo;
  2395. /** If true, and we are acting as a relay, allow exit circuits even when
  2396. * we are the first hop of a circuit. */
  2397. int AllowSingleHopExits;
  2398. /** If true, don't allow relays with AllowSingleHopExits=1 to be used in
  2399. * circuits that we build. */
  2400. int ExcludeSingleHopRelays;
  2401. /** If true, and the controller tells us to use a one-hop circuit, and the
  2402. * exit allows it, we use it. */
  2403. int AllowSingleHopCircuits;
  2404. /** If true, we convert "www.google.com.foo.exit" addresses on the
  2405. * socks/trans/natd ports into "www.google.com" addresses that
  2406. * exit from the node "foo". Disabled by default since attacking
  2407. * websites and exit relays can use it to manipulate your path
  2408. * selection. */
  2409. int AllowDotExit;
  2410. /** If true, we will warn if a user gives us only an IP address
  2411. * instead of a hostname. */
  2412. int WarnUnsafeSocks;
  2413. /** If true, the user wants us to collect statistics on clients
  2414. * requesting network statuses from us as directory. */
  2415. int DirReqStatistics;
  2416. /** If true, the user wants us to collect statistics on port usage. */
  2417. int ExitPortStatistics;
  2418. /** If true, the user wants us to collect cell statistics. */
  2419. int CellStatistics;
  2420. /** If true, the user wants us to collect statistics as entry node. */
  2421. int EntryStatistics;
  2422. /** If true, include statistics file contents in extra-info documents. */
  2423. int ExtraInfoStatistics;
  2424. /** If true, do not believe anybody who tells us that a domain resolves
  2425. * to an internal address, or that an internal address has a PTR mapping.
  2426. * Helps avoid some cross-site attacks. */
  2427. int ClientDNSRejectInternalAddresses;
  2428. /** If true, do not accept any requests to connect to internal addresses
  2429. * over randomly chosen exits. */
  2430. int ClientRejectInternalAddresses;
  2431. /** The length of time that we think a consensus should be fresh. */
  2432. int V3AuthVotingInterval;
  2433. /** The length of time we think it will take to distribute votes. */
  2434. int V3AuthVoteDelay;
  2435. /** The length of time we think it will take to distribute signatures. */
  2436. int V3AuthDistDelay;
  2437. /** The number of intervals we think a consensus should be valid. */
  2438. int V3AuthNIntervalsValid;
  2439. /** Should advertise and sign consensuses with a legacy key, for key
  2440. * migration purposes? */
  2441. int V3AuthUseLegacyKey;
  2442. /** Location of bandwidth measurement file */
  2443. char *V3BandwidthsFile;
  2444. /** Authority only: key=value pairs that we add to our networkstatus
  2445. * consensus vote on the 'params' line. */
  2446. char *ConsensusParams;
  2447. /** The length of time that we think an initial consensus should be fresh.
  2448. * Only altered on testing networks. */
  2449. int TestingV3AuthInitialVotingInterval;
  2450. /** The length of time we think it will take to distribute initial votes.
  2451. * Only altered on testing networks. */
  2452. int TestingV3AuthInitialVoteDelay;
  2453. /** The length of time we think it will take to distribute initial
  2454. * signatures. Only altered on testing networks.*/
  2455. int TestingV3AuthInitialDistDelay;
  2456. /** If an authority has been around for less than this amount of time, it
  2457. * does not believe its reachability information is accurate. Only
  2458. * altered on testing networks. */
  2459. int TestingAuthDirTimeToLearnReachability;
  2460. /** Clients don't download any descriptor this recent, since it will
  2461. * probably not have propagated to enough caches. Only altered on testing
  2462. * networks. */
  2463. int TestingEstimatedDescriptorPropagationTime;
  2464. /** If true, we take part in a testing network. Change the defaults of a
  2465. * couple of other configuration options and allow to change the values
  2466. * of certain configuration options. */
  2467. int TestingTorNetwork;
  2468. /** File to check for a consensus networkstatus, if we don't have one
  2469. * cached. */
  2470. char *FallbackNetworkstatusFile;
  2471. /** If true, and we have GeoIP data, and we're a bridge, keep a per-country
  2472. * count of how many client addresses have contacted us so that we can help
  2473. * the bridge authority guess which countries have blocked access to us. */
  2474. int BridgeRecordUsageByCountry;
  2475. /** Optionally, a file with GeoIP data. */
  2476. char *GeoIPFile;
  2477. /** If true, SIGHUP should reload the torrc. Sometimes controllers want
  2478. * to make this false. */
  2479. int ReloadTorrcOnSIGHUP;
  2480. /* The main parameter for picking circuits within a connection.
  2481. *
  2482. * If this value is positive, when picking a cell to relay on a connection,
  2483. * we always relay from the circuit whose weighted cell count is lowest.
  2484. * Cells are weighted exponentially such that if one cell is sent
  2485. * 'CircuitPriorityHalflife' seconds before another, it counts for half as
  2486. * much.
  2487. *
  2488. * If this value is zero, we're disabling the cell-EWMA algorithm.
  2489. *
  2490. * If this value is negative, we're using the default approach
  2491. * according to either Tor or a parameter set in the consensus.
  2492. */
  2493. double CircuitPriorityHalflife;
  2494. /** Set to true if the TestingTorNetwork configuration option is set.
  2495. * This is used so that options_validate() has a chance to realize that
  2496. * the defaults have changed. */
  2497. int _UsingTestNetworkDefaults;
  2498. } or_options_t;
  2499. /** Persistent state for an onion router, as saved to disk. */
  2500. typedef struct {
  2501. uint32_t _magic;
  2502. /** The time at which we next plan to write the state to the disk. Equal to
  2503. * TIME_MAX if there are no savable changes, 0 if there are changes that
  2504. * should be saved right away. */
  2505. time_t next_write;
  2506. /** When was the state last written to disk? */
  2507. time_t LastWritten;
  2508. /** Fields for accounting bandwidth use. */
  2509. time_t AccountingIntervalStart;
  2510. uint64_t AccountingBytesReadInInterval;
  2511. uint64_t AccountingBytesWrittenInInterval;
  2512. int AccountingSecondsActive;
  2513. int AccountingSecondsToReachSoftLimit;
  2514. time_t AccountingSoftLimitHitAt;
  2515. uint64_t AccountingBytesAtSoftLimit;
  2516. uint64_t AccountingExpectedUsage;
  2517. /** A list of Entry Guard-related configuration lines. */
  2518. config_line_t *EntryGuards;
  2519. /** These fields hold information on the history of bandwidth usage for
  2520. * servers. The "Ends" fields hold the time when we last updated the
  2521. * bandwidth usage. The "Interval" fields hold the granularity, in seconds,
  2522. * of the entries of Values. The "Values" lists hold decimal string
  2523. * representations of the number of bytes read or written in each
  2524. * interval. The "Maxima" list holds decimal strings describing the highest
  2525. * rate achieved during the interval.
  2526. */
  2527. time_t BWHistoryReadEnds;
  2528. int BWHistoryReadInterval;
  2529. smartlist_t *BWHistoryReadValues;
  2530. smartlist_t *BWHistoryReadMaxima;
  2531. time_t BWHistoryWriteEnds;
  2532. int BWHistoryWriteInterval;
  2533. smartlist_t *BWHistoryWriteValues;
  2534. smartlist_t *BWHistoryWriteMaxima;
  2535. time_t BWHistoryDirReadEnds;
  2536. int BWHistoryDirReadInterval;
  2537. smartlist_t *BWHistoryDirReadValues;
  2538. smartlist_t *BWHistoryDirReadMaxima;
  2539. time_t BWHistoryDirWriteEnds;
  2540. int BWHistoryDirWriteInterval;
  2541. smartlist_t *BWHistoryDirWriteValues;
  2542. smartlist_t *BWHistoryDirWriteMaxima;
  2543. /** Build time histogram */
  2544. config_line_t * BuildtimeHistogram;
  2545. unsigned int TotalBuildTimes;
  2546. unsigned int CircuitBuildAbandonedCount;
  2547. /** What version of Tor wrote this state file? */
  2548. char *TorVersion;
  2549. /** Holds any unrecognized values we found in the state file, in the order
  2550. * in which we found them. */
  2551. config_line_t *ExtraLines;
  2552. /** When did we last rotate our onion key? "0" for 'no idea'. */
  2553. time_t LastRotatedOnionKey;
  2554. } or_state_t;
  2555. /** Change the next_write time of <b>state</b> to <b>when</b>, unless the
  2556. * state is already scheduled to be written to disk earlier than <b>when</b>.
  2557. */
  2558. static INLINE void or_state_mark_dirty(or_state_t *state, time_t when)
  2559. {
  2560. if (state->next_write > when)
  2561. state->next_write = when;
  2562. }
  2563. #define MAX_SOCKS_REPLY_LEN 1024
  2564. #define MAX_SOCKS_ADDR_LEN 256
  2565. /** Please open a TCP connection to this addr:port. */
  2566. #define SOCKS_COMMAND_CONNECT 0x01
  2567. /** Please turn this FQDN into an IP address, privately. */
  2568. #define SOCKS_COMMAND_RESOLVE 0xF0
  2569. /** Please turn this IP address into an FQDN, privately. */
  2570. #define SOCKS_COMMAND_RESOLVE_PTR 0xF1
  2571. #define SOCKS_COMMAND_IS_CONNECT(c) ((c)==SOCKS_COMMAND_CONNECT)
  2572. #define SOCKS_COMMAND_IS_RESOLVE(c) ((c)==SOCKS_COMMAND_RESOLVE || \
  2573. (c)==SOCKS_COMMAND_RESOLVE_PTR)
  2574. /** State of a SOCKS request from a user to an OP. Also used to encode other
  2575. * information for non-socks user request (such as those on TransPort and
  2576. * DNSPort) */
  2577. struct socks_request_t {
  2578. /** Which version of SOCKS did the client use? One of "0, 4, 5" -- where
  2579. * 0 means that no socks handshake ever took place, and this is just a
  2580. * stub connection (e.g. see connection_ap_make_link()). */
  2581. char socks_version;
  2582. int command; /**< What is this stream's goal? One from the above list. */
  2583. size_t replylen; /**< Length of <b>reply</b>. */
  2584. char reply[MAX_SOCKS_REPLY_LEN]; /**< Write an entry into this string if
  2585. * we want to specify our own socks reply,
  2586. * rather than using the default socks4 or
  2587. * socks5 socks reply. We use this for the
  2588. * two-stage socks5 handshake.
  2589. */
  2590. char address[MAX_SOCKS_ADDR_LEN]; /**< What address did the client ask to
  2591. connect to/resolve? */
  2592. uint16_t port; /**< What port did the client ask to connect to? */
  2593. unsigned int has_finished : 1; /**< Has the SOCKS handshake finished? Used to
  2594. * make sure we send back a socks reply for
  2595. * every connection. */
  2596. };
  2597. /* all the function prototypes go here */
  2598. /********************************* circuitbuild.c **********************/
  2599. /** How many hops does a general-purpose circuit have by default? */
  2600. #define DEFAULT_ROUTE_LEN 3
  2601. /* Circuit Build Timeout "public" structures. */
  2602. /** Precision multiplier for the Bw weights */
  2603. #define BW_WEIGHT_SCALE 10000
  2604. #define BW_MIN_WEIGHT_SCALE 1
  2605. #define BW_MAX_WEIGHT_SCALE INT32_MAX
  2606. /** Total size of the circuit timeout history to accumulate.
  2607. * 1000 is approx 2.5 days worth of continual-use circuits. */
  2608. #define CBT_NCIRCUITS_TO_OBSERVE 1000
  2609. /** Width of the histogram bins in milliseconds */
  2610. #define CBT_BIN_WIDTH ((build_time_t)50)
  2611. /** Number of modes to use in the weighted-avg computation of Xm */
  2612. #define CBT_DEFAULT_NUM_XM_MODES 3
  2613. #define CBT_MIN_NUM_XM_MODES 1
  2614. #define CBT_MAX_NUM_XM_MODES 20
  2615. /** A build_time_t is milliseconds */
  2616. typedef uint32_t build_time_t;
  2617. /**
  2618. * CBT_BUILD_ABANDONED is our flag value to represent a force-closed
  2619. * circuit (Aka a 'right-censored' pareto value).
  2620. */
  2621. #define CBT_BUILD_ABANDONED ((build_time_t)(INT32_MAX-1))
  2622. #define CBT_BUILD_TIME_MAX ((build_time_t)(INT32_MAX))
  2623. /** Save state every 10 circuits */
  2624. #define CBT_SAVE_STATE_EVERY 10
  2625. /* Circuit build times consensus parameters */
  2626. /**
  2627. * How long to wait before actually closing circuits that take too long to
  2628. * build in terms of CDF quantile.
  2629. */
  2630. #define CBT_DEFAULT_CLOSE_QUANTILE 95
  2631. #define CBT_MIN_CLOSE_QUANTILE CBT_MIN_QUANTILE_CUTOFF
  2632. #define CBT_MAX_CLOSE_QUANTILE CBT_MAX_QUANTILE_CUTOFF
  2633. /**
  2634. * How many circuits count as recent when considering if the
  2635. * connection has gone gimpy or changed.
  2636. */
  2637. #define CBT_DEFAULT_RECENT_CIRCUITS 20
  2638. #define CBT_MIN_RECENT_CIRCUITS 3
  2639. #define CBT_MAX_RECENT_CIRCUITS 1000
  2640. /**
  2641. * Maximum count of timeouts that finish the first hop in the past
  2642. * RECENT_CIRCUITS before calculating a new timeout.
  2643. *
  2644. * This tells us whether to abandon timeout history and set
  2645. * the timeout back to whatever circuit_build_times_get_initial_timeout()
  2646. * gives us.
  2647. */
  2648. #define CBT_DEFAULT_MAX_RECENT_TIMEOUT_COUNT (CBT_DEFAULT_RECENT_CIRCUITS*9/10)
  2649. #define CBT_MIN_MAX_RECENT_TIMEOUT_COUNT 3
  2650. #define CBT_MAX_MAX_RECENT_TIMEOUT_COUNT 10000
  2651. /** Minimum circuits before estimating a timeout */
  2652. #define CBT_DEFAULT_MIN_CIRCUITS_TO_OBSERVE 100
  2653. #define CBT_MIN_MIN_CIRCUITS_TO_OBSERVE 1
  2654. #define CBT_MAX_MIN_CIRCUITS_TO_OBSERVE 10000
  2655. /** Cutoff percentile on the CDF for our timeout estimation. */
  2656. #define CBT_DEFAULT_QUANTILE_CUTOFF 80
  2657. #define CBT_MIN_QUANTILE_CUTOFF 10
  2658. #define CBT_MAX_QUANTILE_CUTOFF 99
  2659. double circuit_build_times_quantile_cutoff(void);
  2660. /** How often in seconds should we build a test circuit */
  2661. #define CBT_DEFAULT_TEST_FREQUENCY 60
  2662. #define CBT_MIN_TEST_FREQUENCY 1
  2663. #define CBT_MAX_TEST_FREQUENCY INT32_MAX
  2664. /** Lowest allowable value for CircuitBuildTimeout in milliseconds */
  2665. #define CBT_DEFAULT_TIMEOUT_MIN_VALUE (1500)
  2666. #define CBT_MIN_TIMEOUT_MIN_VALUE 500
  2667. #define CBT_MAX_TIMEOUT_MIN_VALUE INT32_MAX
  2668. /** Initial circuit build timeout in milliseconds */
  2669. #define CBT_DEFAULT_TIMEOUT_INITIAL_VALUE (60*1000)
  2670. #define CBT_MIN_TIMEOUT_INITIAL_VALUE CBT_MIN_TIMEOUT_MIN_VALUE
  2671. #define CBT_MAX_TIMEOUT_INITIAL_VALUE INT32_MAX
  2672. int32_t circuit_build_times_initial_timeout(void);
  2673. #if CBT_DEFAULT_MAX_RECENT_TIMEOUT_COUNT < CBT_MIN_MAX_RECENT_TIMEOUT_COUNT
  2674. #error "RECENT_CIRCUITS is set too low."
  2675. #endif
  2676. /** Information about the state of our local network connection */
  2677. typedef struct {
  2678. /** The timestamp we last completed a TLS handshake or received a cell */
  2679. time_t network_last_live;
  2680. /** If the network is not live, how many timeouts has this caused? */
  2681. int nonlive_timeouts;
  2682. /** Circular array of circuits that have made it to the first hop. Slot is
  2683. * 1 if circuit timed out, 0 if circuit succeeded */
  2684. int8_t *timeouts_after_firsthop;
  2685. /** Number of elements allocated for the above array */
  2686. int num_recent_circs;
  2687. /** Index into circular array. */
  2688. int after_firsthop_idx;
  2689. } network_liveness_t;
  2690. /** Structure for circuit build times history */
  2691. typedef struct {
  2692. /** The circular array of recorded build times in milliseconds */
  2693. build_time_t circuit_build_times[CBT_NCIRCUITS_TO_OBSERVE];
  2694. /** Current index in the circuit_build_times circular array */
  2695. int build_times_idx;
  2696. /** Total number of build times accumulated. Max CBT_NCIRCUITS_TO_OBSERVE */
  2697. int total_build_times;
  2698. /** Information about the state of our local network connection */
  2699. network_liveness_t liveness;
  2700. /** Last time we built a circuit. Used to decide to build new test circs */
  2701. time_t last_circ_at;
  2702. /** "Minimum" value of our pareto distribution (actually mode) */
  2703. build_time_t Xm;
  2704. /** alpha exponent for pareto dist. */
  2705. double alpha;
  2706. /** Have we computed a timeout? */
  2707. int have_computed_timeout;
  2708. /** The exact value for that timeout in milliseconds. Stored as a double
  2709. * to maintain precision from calculations to and from quantile value. */
  2710. double timeout_ms;
  2711. /** How long we wait before actually closing the circuit. */
  2712. double close_ms;
  2713. } circuit_build_times_t;
  2714. /********************************* config.c ***************************/
  2715. /** An error from options_trial_assign() or options_init_from_string(). */
  2716. typedef enum setopt_err_t {
  2717. SETOPT_OK = 0,
  2718. SETOPT_ERR_MISC = -1,
  2719. SETOPT_ERR_PARSE = -2,
  2720. SETOPT_ERR_TRANSITION = -3,
  2721. SETOPT_ERR_SETTING = -4,
  2722. } setopt_err_t;
  2723. /********************************* connection_edge.c *************************/
  2724. /** Enumerates possible origins of a client-side address mapping. */
  2725. typedef enum {
  2726. /** We're remapping this address because the controller told us to. */
  2727. ADDRMAPSRC_CONTROLLER,
  2728. /** We're remapping this address because our configuration (via torrc, the
  2729. * command line, or a SETCONF command) told us to. */
  2730. ADDRMAPSRC_TORRC,
  2731. /** We're remapping this address because we have TrackHostExit configured,
  2732. * and we want to remember to use the same exit next time. */
  2733. ADDRMAPSRC_TRACKEXIT,
  2734. /** We're remapping this address because we got a DNS resolution from a
  2735. * Tor server that told us what its value was. */
  2736. ADDRMAPSRC_DNS,
  2737. } addressmap_entry_source_t;
  2738. /********************************* control.c ***************************/
  2739. /** Used to indicate the type of a circuit event passed to the controller.
  2740. * The various types are defined in control-spec.txt */
  2741. typedef enum circuit_status_event_t {
  2742. CIRC_EVENT_LAUNCHED = 0,
  2743. CIRC_EVENT_BUILT = 1,
  2744. CIRC_EVENT_EXTENDED = 2,
  2745. CIRC_EVENT_FAILED = 3,
  2746. CIRC_EVENT_CLOSED = 4,
  2747. } circuit_status_event_t;
  2748. /** Used to indicate the type of a stream event passed to the controller.
  2749. * The various types are defined in control-spec.txt */
  2750. typedef enum stream_status_event_t {
  2751. STREAM_EVENT_SENT_CONNECT = 0,
  2752. STREAM_EVENT_SENT_RESOLVE = 1,
  2753. STREAM_EVENT_SUCCEEDED = 2,
  2754. STREAM_EVENT_FAILED = 3,
  2755. STREAM_EVENT_CLOSED = 4,
  2756. STREAM_EVENT_NEW = 5,
  2757. STREAM_EVENT_NEW_RESOLVE = 6,
  2758. STREAM_EVENT_FAILED_RETRIABLE = 7,
  2759. STREAM_EVENT_REMAP = 8
  2760. } stream_status_event_t;
  2761. /** Used to indicate the type of an OR connection event passed to the
  2762. * controller. The various types are defined in control-spec.txt */
  2763. typedef enum or_conn_status_event_t {
  2764. OR_CONN_EVENT_LAUNCHED = 0,
  2765. OR_CONN_EVENT_CONNECTED = 1,
  2766. OR_CONN_EVENT_FAILED = 2,
  2767. OR_CONN_EVENT_CLOSED = 3,
  2768. OR_CONN_EVENT_NEW = 4,
  2769. } or_conn_status_event_t;
  2770. /** Used to indicate the type of a buildtime event */
  2771. typedef enum buildtimeout_set_event_t {
  2772. BUILDTIMEOUT_SET_EVENT_COMPUTED = 0,
  2773. BUILDTIMEOUT_SET_EVENT_RESET = 1,
  2774. BUILDTIMEOUT_SET_EVENT_SUSPENDED = 2,
  2775. BUILDTIMEOUT_SET_EVENT_DISCARD = 3,
  2776. BUILDTIMEOUT_SET_EVENT_RESUME = 4
  2777. } buildtimeout_set_event_t;
  2778. /** Execute the statement <b>stmt</b>, which may log events concerning the
  2779. * connection <b>conn</b>. To prevent infinite loops, disable log messages
  2780. * being sent to controllers if <b>conn</b> is a control connection.
  2781. *
  2782. * Stmt must not contain any return or goto statements.
  2783. */
  2784. #define CONN_LOG_PROTECT(conn, stmt) \
  2785. STMT_BEGIN \
  2786. int _log_conn_is_control = (conn && conn->type == CONN_TYPE_CONTROL); \
  2787. if (_log_conn_is_control) \
  2788. disable_control_logging(); \
  2789. STMT_BEGIN stmt; STMT_END; \
  2790. if (_log_conn_is_control) \
  2791. enable_control_logging(); \
  2792. STMT_END
  2793. /** Enum describing various stages of bootstrapping, for use with controller
  2794. * bootstrap status events. The values range from 0 to 100. */
  2795. typedef enum {
  2796. BOOTSTRAP_STATUS_UNDEF=-1,
  2797. BOOTSTRAP_STATUS_STARTING=0,
  2798. BOOTSTRAP_STATUS_CONN_DIR=5,
  2799. BOOTSTRAP_STATUS_HANDSHAKE=-2,
  2800. BOOTSTRAP_STATUS_HANDSHAKE_DIR=10,
  2801. BOOTSTRAP_STATUS_ONEHOP_CREATE=15,
  2802. BOOTSTRAP_STATUS_REQUESTING_STATUS=20,
  2803. BOOTSTRAP_STATUS_LOADING_STATUS=25,
  2804. BOOTSTRAP_STATUS_LOADING_KEYS=40,
  2805. BOOTSTRAP_STATUS_REQUESTING_DESCRIPTORS=45,
  2806. BOOTSTRAP_STATUS_LOADING_DESCRIPTORS=50,
  2807. BOOTSTRAP_STATUS_CONN_OR=80,
  2808. BOOTSTRAP_STATUS_HANDSHAKE_OR=85,
  2809. BOOTSTRAP_STATUS_CIRCUIT_CREATE=90,
  2810. BOOTSTRAP_STATUS_DONE=100
  2811. } bootstrap_status_t;
  2812. /********************************* directory.c ***************************/
  2813. /** A pair of digests created by dir_split_resource_info_fingerprint_pairs() */
  2814. typedef struct {
  2815. char first[DIGEST_LEN];
  2816. char second[DIGEST_LEN];
  2817. } fp_pair_t;
  2818. /********************************* dirserv.c ***************************/
  2819. typedef enum {
  2820. NS_V2, NS_V3_CONSENSUS, NS_V3_VOTE, NS_CONTROL_PORT,
  2821. NS_V3_CONSENSUS_MICRODESC
  2822. } routerstatus_format_type_t;
  2823. #ifdef DIRSERV_PRIVATE
  2824. typedef struct measured_bw_line_t {
  2825. char node_id[DIGEST_LEN];
  2826. char node_hex[MAX_HEX_NICKNAME_LEN+1];
  2827. long int bw;
  2828. } measured_bw_line_t;
  2829. #endif
  2830. /********************************* dirvote.c ************************/
  2831. /** Describes the schedule by which votes should be generated. */
  2832. typedef struct vote_timing_t {
  2833. int vote_interval;
  2834. int n_intervals_valid;
  2835. int vote_delay;
  2836. int dist_delay;
  2837. } vote_timing_t;
  2838. /********************************* geoip.c **************************/
  2839. /** Round all GeoIP results to the next multiple of this value, to avoid
  2840. * leaking information. */
  2841. #define DIR_RECORD_USAGE_GRANULARITY 8
  2842. /** Time interval: Flush geoip data to disk this often. */
  2843. #define DIR_ENTRY_RECORD_USAGE_RETAIN_IPS (24*60*60)
  2844. /** How long do we have to have observed per-country request history before
  2845. * we are willing to talk about it? */
  2846. #define DIR_RECORD_USAGE_MIN_OBSERVATION_TIME (12*60*60)
  2847. /** Indicates an action that we might be noting geoip statistics on.
  2848. * Note that if we're noticing CONNECT, we're a bridge, and if we're noticing
  2849. * the others, we're not.
  2850. */
  2851. typedef enum {
  2852. /** We've noticed a connection as a bridge relay or entry guard. */
  2853. GEOIP_CLIENT_CONNECT = 0,
  2854. /** We've served a networkstatus consensus as a directory server. */
  2855. GEOIP_CLIENT_NETWORKSTATUS = 1,
  2856. /** We've served a v2 networkstatus consensus as a directory server. */
  2857. GEOIP_CLIENT_NETWORKSTATUS_V2 = 2,
  2858. } geoip_client_action_t;
  2859. /** Indicates either a positive reply or a reason for rejectng a network
  2860. * status request that will be included in geoip statistics. */
  2861. typedef enum {
  2862. /** Request is answered successfully. */
  2863. GEOIP_SUCCESS = 0,
  2864. /** V3 network status is not signed by a sufficient number of requested
  2865. * authorities. */
  2866. GEOIP_REJECT_NOT_ENOUGH_SIGS = 1,
  2867. /** Requested network status object is unavailable. */
  2868. GEOIP_REJECT_UNAVAILABLE = 2,
  2869. /** Requested network status not found. */
  2870. GEOIP_REJECT_NOT_FOUND = 3,
  2871. /** Network status has not been modified since If-Modified-Since time. */
  2872. GEOIP_REJECT_NOT_MODIFIED = 4,
  2873. /** Directory is busy. */
  2874. GEOIP_REJECT_BUSY = 5,
  2875. } geoip_ns_response_t;
  2876. #define GEOIP_NS_RESPONSE_NUM 6
  2877. /** Directory requests that we are measuring can be either direct or
  2878. * tunneled. */
  2879. typedef enum {
  2880. DIRREQ_DIRECT = 0,
  2881. DIRREQ_TUNNELED = 1,
  2882. } dirreq_type_t;
  2883. /** Possible states for either direct or tunneled directory requests that
  2884. * are relevant for determining network status download times. */
  2885. typedef enum {
  2886. /** Found that the client requests a network status; applies to both
  2887. * direct and tunneled requests; initial state of a request that we are
  2888. * measuring. */
  2889. DIRREQ_IS_FOR_NETWORK_STATUS = 0,
  2890. /** Finished writing a network status to the directory connection;
  2891. * applies to both direct and tunneled requests; completes a direct
  2892. * request. */
  2893. DIRREQ_FLUSHING_DIR_CONN_FINISHED = 1,
  2894. /** END cell sent to circuit that initiated a tunneled request. */
  2895. DIRREQ_END_CELL_SENT = 2,
  2896. /** Flushed last cell from queue of the circuit that initiated a
  2897. * tunneled request to the outbuf of the OR connection. */
  2898. DIRREQ_CIRC_QUEUE_FLUSHED = 3,
  2899. /** Flushed last byte from buffer of the OR connection belonging to the
  2900. * circuit that initiated a tunneled request; completes a tunneled
  2901. * request. */
  2902. DIRREQ_OR_CONN_BUFFER_FLUSHED = 4
  2903. } dirreq_state_t;
  2904. #define WRITE_STATS_INTERVAL (24*60*60)
  2905. /********************************* microdesc.c *************************/
  2906. typedef struct microdesc_cache_t microdesc_cache_t;
  2907. /********************************* networkstatus.c *********************/
  2908. /** Location where we found a v2 networkstatus. */
  2909. typedef enum {
  2910. NS_FROM_CACHE, NS_FROM_DIR_BY_FP, NS_FROM_DIR_ALL, NS_GENERATED
  2911. } v2_networkstatus_source_t;
  2912. /** Possible statuses of a version of Tor, given opinions from the directory
  2913. * servers. */
  2914. typedef enum version_status_t {
  2915. VS_RECOMMENDED=0, /**< This version is listed as recommended. */
  2916. VS_OLD=1, /**< This version is older than any recommended version. */
  2917. VS_NEW=2, /**< This version is newer than any recommended version. */
  2918. VS_NEW_IN_SERIES=3, /**< This version is newer than any recommended version
  2919. * in its series, but later recommended versions exist.
  2920. */
  2921. VS_UNRECOMMENDED=4, /**< This version is not recommended (general case). */
  2922. VS_EMPTY=5, /**< The version list was empty; no agreed-on versions. */
  2923. VS_UNKNOWN, /**< We have no idea. */
  2924. } version_status_t;
  2925. /********************************* policies.c ************************/
  2926. /** Outcome of applying an address policy to an address. */
  2927. typedef enum {
  2928. /** The address was accepted */
  2929. ADDR_POLICY_ACCEPTED=0,
  2930. /** The address was rejected */
  2931. ADDR_POLICY_REJECTED=-1,
  2932. /** Part of the address was unknown, but as far as we can tell, it was
  2933. * accepted. */
  2934. ADDR_POLICY_PROBABLY_ACCEPTED=1,
  2935. /** Part of the address was unknown, but as far as we can tell, it was
  2936. * rejected. */
  2937. ADDR_POLICY_PROBABLY_REJECTED=2
  2938. } addr_policy_result_t;
  2939. /********************************* rephist.c ***************************/
  2940. /** Possible public/private key operations in Tor: used to keep track of where
  2941. * we're spending our time. */
  2942. typedef enum {
  2943. SIGN_DIR, SIGN_RTR,
  2944. VERIFY_DIR, VERIFY_RTR,
  2945. ENC_ONIONSKIN, DEC_ONIONSKIN,
  2946. TLS_HANDSHAKE_C, TLS_HANDSHAKE_S,
  2947. REND_CLIENT, REND_MID, REND_SERVER,
  2948. } pk_op_t;
  2949. /********************************* rendcommon.c ***************************/
  2950. /** Hidden-service side configuration of client authorization. */
  2951. typedef struct rend_authorized_client_t {
  2952. char *client_name;
  2953. char descriptor_cookie[REND_DESC_COOKIE_LEN];
  2954. crypto_pk_env_t *client_key;
  2955. } rend_authorized_client_t;
  2956. /** ASCII-encoded v2 hidden service descriptor. */
  2957. typedef struct rend_encoded_v2_service_descriptor_t {
  2958. char desc_id[DIGEST_LEN]; /**< Descriptor ID. */
  2959. char *desc_str; /**< Descriptor string. */
  2960. } rend_encoded_v2_service_descriptor_t;
  2961. /** Introduction point information. */
  2962. typedef struct rend_intro_point_t {
  2963. extend_info_t *extend_info; /**< Extend info of this introduction point. */
  2964. crypto_pk_env_t *intro_key; /**< Introduction key that replaces the service
  2965. * key, if this descriptor is V2. */
  2966. } rend_intro_point_t;
  2967. /** Information used to connect to a hidden service. */
  2968. typedef struct rend_service_descriptor_t {
  2969. crypto_pk_env_t *pk; /**< This service's public key. */
  2970. int version; /**< Version of the descriptor format: 0 or 2. */
  2971. time_t timestamp; /**< Time when the descriptor was generated. */
  2972. uint16_t protocols; /**< Bitmask: which rendezvous protocols are supported?
  2973. * (We allow bits '0', '1', and '2' to be set.) */
  2974. /** List of the service's introduction points. Elements are removed if
  2975. * introduction attempts fail. */
  2976. smartlist_t *intro_nodes;
  2977. /** Has descriptor been uploaded to all hidden service directories? */
  2978. int all_uploads_performed;
  2979. /** List of hidden service directories to which an upload request for
  2980. * this descriptor could be sent. Smartlist exists only when at least one
  2981. * of the previous upload requests failed (otherwise it's not important
  2982. * to know which uploads succeeded and which not). */
  2983. smartlist_t *successful_uploads;
  2984. } rend_service_descriptor_t;
  2985. /** A cached rendezvous descriptor. */
  2986. typedef struct rend_cache_entry_t {
  2987. size_t len; /**< Length of <b>desc</b> */
  2988. time_t received; /**< When was the descriptor received? */
  2989. char *desc; /**< Service descriptor */
  2990. rend_service_descriptor_t *parsed; /**< Parsed value of 'desc' */
  2991. } rend_cache_entry_t;
  2992. /********************************* routerlist.c ***************************/
  2993. /** Represents information about a single trusted directory server. */
  2994. typedef struct trusted_dir_server_t {
  2995. char *description;
  2996. char *nickname;
  2997. char *address; /**< Hostname. */
  2998. uint32_t addr; /**< IPv4 address. */
  2999. uint16_t dir_port; /**< Directory port. */
  3000. uint16_t or_port; /**< OR port: Used for tunneling connections. */
  3001. char digest[DIGEST_LEN]; /**< Digest of identity key. */
  3002. char v3_identity_digest[DIGEST_LEN]; /**< Digest of v3 (authority only,
  3003. * high-security) identity key. */
  3004. unsigned int is_running:1; /**< True iff we think this server is running. */
  3005. /** True iff this server has accepted the most recent server descriptor
  3006. * we tried to upload to it. */
  3007. unsigned int has_accepted_serverdesc:1;
  3008. /** What kind of authority is this? (Bitfield.) */
  3009. authority_type_t type;
  3010. download_status_t v2_ns_dl_status; /**< Status of downloading this server's
  3011. * v2 network status. */
  3012. time_t addr_current_at; /**< When was the document that we derived the
  3013. * address information from published? */
  3014. routerstatus_t fake_status; /**< Used when we need to pass this trusted
  3015. * dir_server_t to directory_initiate_command_*
  3016. * as a routerstatus_t. Not updated by the
  3017. * router-status management code!
  3018. **/
  3019. } trusted_dir_server_t;
  3020. #define ROUTER_REQUIRED_MIN_BANDWIDTH (20*1024)
  3021. #define ROUTER_MAX_DECLARED_BANDWIDTH INT32_MAX
  3022. /* Flags for pick_directory_server and pick_trusteddirserver. */
  3023. /** Flag to indicate that we should not automatically be willing to use
  3024. * ourself to answer a directory request.
  3025. * Passed to router_pick_directory_server (et al).*/
  3026. #define PDS_ALLOW_SELF (1<<0)
  3027. /** Flag to indicate that if no servers seem to be up, we should mark all
  3028. * directory servers as up and try again.
  3029. * Passed to router_pick_directory_server (et al).*/
  3030. #define PDS_RETRY_IF_NO_SERVERS (1<<1)
  3031. /** Flag to indicate that we should not exclude directory servers that
  3032. * our ReachableAddress settings would exclude. This usually means that
  3033. * we're going to connect to the server over Tor, and so we don't need to
  3034. * worry about our firewall telling us we can't.
  3035. * Passed to router_pick_directory_server (et al).*/
  3036. #define PDS_IGNORE_FASCISTFIREWALL (1<<2)
  3037. /** Flag to indicate that we should not use any directory authority to which
  3038. * we have an existing directory connection for downloading server descriptors
  3039. * or extrainfo documents.
  3040. *
  3041. * Passed to router_pick_directory_server (et al)
  3042. *
  3043. * [XXXX NOTE: This option is only implemented for pick_trusteddirserver,
  3044. * not pick_directory_server. If we make it work on pick_directory_server
  3045. * too, we could conservatively make it only prevent multiple fetches to
  3046. * the same authority, or we could aggressively make it prevent multiple
  3047. * fetches to _any_ single directory server.]
  3048. */
  3049. #define PDS_NO_EXISTING_SERVERDESC_FETCH (1<<3)
  3050. #define _PDS_PREFER_TUNNELED_DIR_CONNS (1<<16)
  3051. /** Possible ways to weight routers when choosing one randomly. See
  3052. * routerlist_sl_choose_by_bandwidth() for more information.*/
  3053. typedef enum bandwidth_weight_rule_t {
  3054. NO_WEIGHTING, WEIGHT_FOR_EXIT, WEIGHT_FOR_MID, WEIGHT_FOR_GUARD,
  3055. WEIGHT_FOR_DIR
  3056. } bandwidth_weight_rule_t;
  3057. /** Flags to be passed to control router_choose_random_node() to indicate what
  3058. * kind of nodes to pick according to what algorithm. */
  3059. typedef enum {
  3060. CRN_NEED_UPTIME = 1<<0,
  3061. CRN_NEED_CAPACITY = 1<<1,
  3062. CRN_NEED_GUARD = 1<<2,
  3063. CRN_ALLOW_INVALID = 1<<3,
  3064. /* XXXX not used, apparently. */
  3065. CRN_WEIGHT_AS_EXIT = 1<<5
  3066. } router_crn_flags_t;
  3067. /** Return value for router_add_to_routerlist() and dirserv_add_descriptor() */
  3068. typedef enum was_router_added_t {
  3069. ROUTER_ADDED_SUCCESSFULLY = 1,
  3070. ROUTER_ADDED_NOTIFY_GENERATOR = 0,
  3071. ROUTER_BAD_EI = -1,
  3072. ROUTER_WAS_NOT_NEW = -2,
  3073. ROUTER_NOT_IN_CONSENSUS = -3,
  3074. ROUTER_NOT_IN_CONSENSUS_OR_NETWORKSTATUS = -4,
  3075. ROUTER_AUTHDIR_REJECTS = -5,
  3076. ROUTER_WAS_NOT_WANTED = -6
  3077. } was_router_added_t;
  3078. /********************************* routerparse.c ************************/
  3079. #define MAX_STATUS_TAG_LEN 32
  3080. /** Structure to hold parsed Tor versions. This is a little messier
  3081. * than we would like it to be, because we changed version schemes with 0.1.0.
  3082. *
  3083. * See version-spec.txt for the whole business.
  3084. */
  3085. typedef struct tor_version_t {
  3086. int major;
  3087. int minor;
  3088. int micro;
  3089. /** Release status. For version in the post-0.1 format, this is always
  3090. * VER_RELEASE. */
  3091. enum { VER_PRE=0, VER_RC=1, VER_RELEASE=2, } status;
  3092. int patchlevel;
  3093. char status_tag[MAX_STATUS_TAG_LEN];
  3094. int svn_revision;
  3095. int git_tag_len;
  3096. char git_tag[DIGEST_LEN];
  3097. } tor_version_t;
  3098. #endif