or.h 176 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324
  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-2017, 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 HAVE_UNISTD_H
  14. #include <unistd.h>
  15. #endif
  16. #ifdef HAVE_SIGNAL_H
  17. #include <signal.h>
  18. #endif
  19. #ifdef HAVE_NETDB_H
  20. #include <netdb.h>
  21. #endif
  22. #ifdef HAVE_SYS_PARAM_H
  23. #include <sys/param.h> /* FreeBSD needs this to know what version it is */
  24. #endif
  25. #include "torint.h"
  26. #ifdef HAVE_SYS_FCNTL_H
  27. #include <sys/fcntl.h>
  28. #endif
  29. #ifdef HAVE_FCNTL_H
  30. #include <fcntl.h>
  31. #endif
  32. #ifdef HAVE_SYS_IOCTL_H
  33. #include <sys/ioctl.h>
  34. #endif
  35. #ifdef HAVE_SYS_UN_H
  36. #include <sys/un.h>
  37. #endif
  38. #ifdef HAVE_SYS_STAT_H
  39. #include <sys/stat.h>
  40. #endif
  41. #ifdef HAVE_NETINET_IN_H
  42. #include <netinet/in.h>
  43. #endif
  44. #ifdef HAVE_ARPA_INET_H
  45. #include <arpa/inet.h>
  46. #endif
  47. #ifdef HAVE_ERRNO_H
  48. #include <errno.h>
  49. #endif
  50. #ifdef HAVE_ASSERT_H
  51. #include <assert.h>
  52. #endif
  53. #ifdef HAVE_TIME_H
  54. #include <time.h>
  55. #endif
  56. #ifdef _WIN32
  57. #include <winsock2.h>
  58. #include <io.h>
  59. #include <process.h>
  60. #include <direct.h>
  61. #include <windows.h>
  62. #endif /* defined(_WIN32) */
  63. #include "crypto.h"
  64. #include "crypto_format.h"
  65. #include "tortls.h"
  66. #include "torlog.h"
  67. #include "container.h"
  68. #include "compress.h"
  69. #include "address.h"
  70. #include "compat_libevent.h"
  71. #include "ht.h"
  72. #include "confline.h"
  73. #include "replaycache.h"
  74. #include "crypto_curve25519.h"
  75. #include "crypto_ed25519.h"
  76. #include "tor_queue.h"
  77. #include "token_bucket.h"
  78. #include "util_format.h"
  79. #include "hs_circuitmap.h"
  80. // These, more than other includes, are for keeping the other struct
  81. // definitions working. We should remove them when we minimize our includes.
  82. #include "entry_port_cfg_st.h"
  83. /* These signals are defined to help handle_control_signal work.
  84. */
  85. #ifndef SIGHUP
  86. #define SIGHUP 1
  87. #endif
  88. #ifndef SIGINT
  89. #define SIGINT 2
  90. #endif
  91. #ifndef SIGUSR1
  92. #define SIGUSR1 10
  93. #endif
  94. #ifndef SIGUSR2
  95. #define SIGUSR2 12
  96. #endif
  97. #ifndef SIGTERM
  98. #define SIGTERM 15
  99. #endif
  100. /* Controller signals start at a high number so we don't
  101. * conflict with system-defined signals. */
  102. #define SIGNEWNYM 129
  103. #define SIGCLEARDNSCACHE 130
  104. #define SIGHEARTBEAT 131
  105. #if (SIZEOF_CELL_T != 0)
  106. /* On Irix, stdlib.h defines a cell_t type, so we need to make sure
  107. * that our stuff always calls cell_t something different. */
  108. #define cell_t tor_cell_t
  109. #endif
  110. #ifdef ENABLE_TOR2WEB_MODE
  111. #define NON_ANONYMOUS_MODE_ENABLED 1
  112. #endif
  113. /** Helper macro: Given a pointer to to.base_, of type from*, return &to. */
  114. #define DOWNCAST(to, ptr) ((to*)SUBTYPE_P(ptr, to, base_))
  115. /** Length of longest allowable configured nickname. */
  116. #define MAX_NICKNAME_LEN 19
  117. /** Length of a router identity encoded as a hexadecimal digest, plus
  118. * possible dollar sign. */
  119. #define MAX_HEX_NICKNAME_LEN (HEX_DIGEST_LEN+1)
  120. /** Maximum length of verbose router identifier: dollar sign, hex ID digest,
  121. * equal sign or tilde, nickname. */
  122. #define MAX_VERBOSE_NICKNAME_LEN (1+HEX_DIGEST_LEN+1+MAX_NICKNAME_LEN)
  123. /** Maximum size, in bytes, for resized buffers. */
  124. #define MAX_BUF_SIZE ((1<<24)-1) /* 16MB-1 */
  125. /** Maximum size, in bytes, for any directory object that we've downloaded. */
  126. #define MAX_DIR_DL_SIZE MAX_BUF_SIZE
  127. /** For HTTP parsing: Maximum number of bytes we'll accept in the headers
  128. * of an HTTP request or response. */
  129. #define MAX_HEADERS_SIZE 50000
  130. /** Maximum size, in bytes, for any directory object that we're accepting
  131. * as an upload. */
  132. #define MAX_DIR_UL_SIZE MAX_BUF_SIZE
  133. /** Maximum size, in bytes, of a single router descriptor uploaded to us
  134. * as a directory authority. Caches and clients fetch whatever descriptors
  135. * the authorities tell them to fetch, and don't care about size. */
  136. #define MAX_DESCRIPTOR_UPLOAD_SIZE 20000
  137. /** Maximum size of a single extrainfo document, as above. */
  138. #define MAX_EXTRAINFO_UPLOAD_SIZE 50000
  139. /** Minimum lifetime for an onion key in days. */
  140. #define MIN_ONION_KEY_LIFETIME_DAYS (1)
  141. /** Maximum lifetime for an onion key in days. */
  142. #define MAX_ONION_KEY_LIFETIME_DAYS (90)
  143. /** Default lifetime for an onion key in days. */
  144. #define DEFAULT_ONION_KEY_LIFETIME_DAYS (28)
  145. /** Minimum grace period for acceptance of an onion key in days.
  146. * The maximum value is defined in proposal #274 as being the current network
  147. * consensus parameter for "onion-key-rotation-days". */
  148. #define MIN_ONION_KEY_GRACE_PERIOD_DAYS (1)
  149. /** Default grace period for acceptance of an onion key in days. */
  150. #define DEFAULT_ONION_KEY_GRACE_PERIOD_DAYS (7)
  151. /** How often we should check the network consensus if it is time to rotate or
  152. * expire onion keys. */
  153. #define ONION_KEY_CONSENSUS_CHECK_INTERVAL (60*60)
  154. /** How often do we rotate TLS contexts? */
  155. #define MAX_SSL_KEY_LIFETIME_INTERNAL (2*60*60)
  156. /** How old do we allow a router to get before removing it
  157. * from the router list? In seconds. */
  158. #define ROUTER_MAX_AGE (60*60*48)
  159. /** How old can a router get before we (as a server) will no longer
  160. * consider it live? In seconds. */
  161. #define ROUTER_MAX_AGE_TO_PUBLISH (60*60*24)
  162. /** How old do we let a saved descriptor get before force-removing it? */
  163. #define OLD_ROUTER_DESC_MAX_AGE (60*60*24*5)
  164. /** Possible rules for generating circuit IDs on an OR connection. */
  165. typedef enum {
  166. CIRC_ID_TYPE_LOWER=0, /**< Pick from 0..1<<15-1. */
  167. CIRC_ID_TYPE_HIGHER=1, /**< Pick from 1<<15..1<<16-1. */
  168. /** The other side of a connection is an OP: never create circuits to it,
  169. * and let it use any circuit ID it wants. */
  170. CIRC_ID_TYPE_NEITHER=2
  171. } circ_id_type_t;
  172. #define circ_id_type_bitfield_t ENUM_BF(circ_id_type_t)
  173. #define CONN_TYPE_MIN_ 3
  174. /** Type for sockets listening for OR connections. */
  175. #define CONN_TYPE_OR_LISTENER 3
  176. /** A bidirectional TLS connection transmitting a sequence of cells.
  177. * May be from an OR to an OR, or from an OP to an OR. */
  178. #define CONN_TYPE_OR 4
  179. /** A TCP connection from an onion router to a stream's destination. */
  180. #define CONN_TYPE_EXIT 5
  181. /** Type for sockets listening for SOCKS connections. */
  182. #define CONN_TYPE_AP_LISTENER 6
  183. /** A SOCKS proxy connection from the user application to the onion
  184. * proxy. */
  185. #define CONN_TYPE_AP 7
  186. /** Type for sockets listening for HTTP connections to the directory server. */
  187. #define CONN_TYPE_DIR_LISTENER 8
  188. /** Type for HTTP connections to the directory server. */
  189. #define CONN_TYPE_DIR 9
  190. /* Type 10 is unused. */
  191. /** Type for listening for connections from user interface process. */
  192. #define CONN_TYPE_CONTROL_LISTENER 11
  193. /** Type for connections from user interface process. */
  194. #define CONN_TYPE_CONTROL 12
  195. /** Type for sockets listening for transparent connections redirected by pf or
  196. * netfilter. */
  197. #define CONN_TYPE_AP_TRANS_LISTENER 13
  198. /** Type for sockets listening for transparent connections redirected by
  199. * natd. */
  200. #define CONN_TYPE_AP_NATD_LISTENER 14
  201. /** Type for sockets listening for DNS requests. */
  202. #define CONN_TYPE_AP_DNS_LISTENER 15
  203. /** Type for connections from the Extended ORPort. */
  204. #define CONN_TYPE_EXT_OR 16
  205. /** Type for sockets listening for Extended ORPort connections. */
  206. #define CONN_TYPE_EXT_OR_LISTENER 17
  207. /** Type for sockets listening for HTTP CONNECT tunnel connections. */
  208. #define CONN_TYPE_AP_HTTP_CONNECT_LISTENER 18
  209. #define CONN_TYPE_MAX_ 19
  210. /* !!!! If _CONN_TYPE_MAX is ever over 31, we must grow the type field in
  211. * connection_t. */
  212. /* Proxy client types */
  213. #define PROXY_NONE 0
  214. #define PROXY_CONNECT 1
  215. #define PROXY_SOCKS4 2
  216. #define PROXY_SOCKS5 3
  217. /* !!!! If there is ever a PROXY_* type over 3, we must grow the proxy_type
  218. * field in or_connection_t */
  219. /* Pluggable transport proxy type. Don't use this in or_connection_t,
  220. * instead use the actual underlying proxy type (see above). */
  221. #define PROXY_PLUGGABLE 4
  222. /* Proxy client handshake states */
  223. /* We use a proxy but we haven't even connected to it yet. */
  224. #define PROXY_INFANT 1
  225. /* We use an HTTP proxy and we've sent the CONNECT command. */
  226. #define PROXY_HTTPS_WANT_CONNECT_OK 2
  227. /* We use a SOCKS4 proxy and we've sent the CONNECT command. */
  228. #define PROXY_SOCKS4_WANT_CONNECT_OK 3
  229. /* We use a SOCKS5 proxy and we try to negotiate without
  230. any authentication . */
  231. #define PROXY_SOCKS5_WANT_AUTH_METHOD_NONE 4
  232. /* We use a SOCKS5 proxy and we try to negotiate with
  233. Username/Password authentication . */
  234. #define PROXY_SOCKS5_WANT_AUTH_METHOD_RFC1929 5
  235. /* We use a SOCKS5 proxy and we just sent our credentials. */
  236. #define PROXY_SOCKS5_WANT_AUTH_RFC1929_OK 6
  237. /* We use a SOCKS5 proxy and we just sent our CONNECT command. */
  238. #define PROXY_SOCKS5_WANT_CONNECT_OK 7
  239. /* We use a proxy and we CONNECTed successfully!. */
  240. #define PROXY_CONNECTED 8
  241. /** True iff <b>x</b> is an edge connection. */
  242. #define CONN_IS_EDGE(x) \
  243. ((x)->type == CONN_TYPE_EXIT || (x)->type == CONN_TYPE_AP)
  244. /** State for any listener connection. */
  245. #define LISTENER_STATE_READY 0
  246. #define OR_CONN_STATE_MIN_ 1
  247. /** State for a connection to an OR: waiting for connect() to finish. */
  248. #define OR_CONN_STATE_CONNECTING 1
  249. /** State for a connection to an OR: waiting for proxy handshake to complete */
  250. #define OR_CONN_STATE_PROXY_HANDSHAKING 2
  251. /** State for an OR connection client: SSL is handshaking, not done
  252. * yet. */
  253. #define OR_CONN_STATE_TLS_HANDSHAKING 3
  254. /** State for a connection to an OR: We're doing a second SSL handshake for
  255. * renegotiation purposes. (V2 handshake only.) */
  256. #define OR_CONN_STATE_TLS_CLIENT_RENEGOTIATING 4
  257. /** State for a connection at an OR: We're waiting for the client to
  258. * renegotiate (to indicate a v2 handshake) or send a versions cell (to
  259. * indicate a v3 handshake) */
  260. #define OR_CONN_STATE_TLS_SERVER_RENEGOTIATING 5
  261. /** State for an OR connection: We're done with our SSL handshake, we've done
  262. * renegotiation, but we haven't yet negotiated link protocol versions and
  263. * sent a netinfo cell. */
  264. #define OR_CONN_STATE_OR_HANDSHAKING_V2 6
  265. /** State for an OR connection: We're done with our SSL handshake, but we
  266. * haven't yet negotiated link protocol versions, done a V3 handshake, and
  267. * sent a netinfo cell. */
  268. #define OR_CONN_STATE_OR_HANDSHAKING_V3 7
  269. /** State for an OR connection: Ready to send/receive cells. */
  270. #define OR_CONN_STATE_OPEN 8
  271. #define OR_CONN_STATE_MAX_ 8
  272. /** States of the Extended ORPort protocol. Be careful before changing
  273. * the numbers: they matter. */
  274. #define EXT_OR_CONN_STATE_MIN_ 1
  275. /** Extended ORPort authentication is waiting for the authentication
  276. * type selected by the client. */
  277. #define EXT_OR_CONN_STATE_AUTH_WAIT_AUTH_TYPE 1
  278. /** Extended ORPort authentication is waiting for the client nonce. */
  279. #define EXT_OR_CONN_STATE_AUTH_WAIT_CLIENT_NONCE 2
  280. /** Extended ORPort authentication is waiting for the client hash. */
  281. #define EXT_OR_CONN_STATE_AUTH_WAIT_CLIENT_HASH 3
  282. #define EXT_OR_CONN_STATE_AUTH_MAX 3
  283. /** Authentication finished and the Extended ORPort is now accepting
  284. * traffic. */
  285. #define EXT_OR_CONN_STATE_OPEN 4
  286. /** Extended ORPort is flushing its last messages and preparing to
  287. * start accepting OR connections. */
  288. #define EXT_OR_CONN_STATE_FLUSHING 5
  289. #define EXT_OR_CONN_STATE_MAX_ 5
  290. #define EXIT_CONN_STATE_MIN_ 1
  291. /** State for an exit connection: waiting for response from DNS farm. */
  292. #define EXIT_CONN_STATE_RESOLVING 1
  293. /** State for an exit connection: waiting for connect() to finish. */
  294. #define EXIT_CONN_STATE_CONNECTING 2
  295. /** State for an exit connection: open and ready to transmit data. */
  296. #define EXIT_CONN_STATE_OPEN 3
  297. /** State for an exit connection: waiting to be removed. */
  298. #define EXIT_CONN_STATE_RESOLVEFAILED 4
  299. #define EXIT_CONN_STATE_MAX_ 4
  300. /* The AP state values must be disjoint from the EXIT state values. */
  301. #define AP_CONN_STATE_MIN_ 5
  302. /** State for a SOCKS connection: waiting for SOCKS request. */
  303. #define AP_CONN_STATE_SOCKS_WAIT 5
  304. /** State for a SOCKS connection: got a y.onion URL; waiting to receive
  305. * rendezvous descriptor. */
  306. #define AP_CONN_STATE_RENDDESC_WAIT 6
  307. /** The controller will attach this connection to a circuit; it isn't our
  308. * job to do so. */
  309. #define AP_CONN_STATE_CONTROLLER_WAIT 7
  310. /** State for a SOCKS connection: waiting for a completed circuit. */
  311. #define AP_CONN_STATE_CIRCUIT_WAIT 8
  312. /** State for a SOCKS connection: sent BEGIN, waiting for CONNECTED. */
  313. #define AP_CONN_STATE_CONNECT_WAIT 9
  314. /** State for a SOCKS connection: sent RESOLVE, waiting for RESOLVED. */
  315. #define AP_CONN_STATE_RESOLVE_WAIT 10
  316. /** State for a SOCKS connection: ready to send and receive. */
  317. #define AP_CONN_STATE_OPEN 11
  318. /** State for a transparent natd connection: waiting for original
  319. * destination. */
  320. #define AP_CONN_STATE_NATD_WAIT 12
  321. /** State for an HTTP tunnel: waiting for an HTTP CONNECT command. */
  322. #define AP_CONN_STATE_HTTP_CONNECT_WAIT 13
  323. #define AP_CONN_STATE_MAX_ 13
  324. /** True iff the AP_CONN_STATE_* value <b>s</b> means that the corresponding
  325. * edge connection is not attached to any circuit. */
  326. #define AP_CONN_STATE_IS_UNATTACHED(s) \
  327. ((s) <= AP_CONN_STATE_CIRCUIT_WAIT || (s) == AP_CONN_STATE_NATD_WAIT)
  328. #define DIR_CONN_STATE_MIN_ 1
  329. /** State for connection to directory server: waiting for connect(). */
  330. #define DIR_CONN_STATE_CONNECTING 1
  331. /** State for connection to directory server: sending HTTP request. */
  332. #define DIR_CONN_STATE_CLIENT_SENDING 2
  333. /** State for connection to directory server: reading HTTP response. */
  334. #define DIR_CONN_STATE_CLIENT_READING 3
  335. /** State for connection to directory server: happy and finished. */
  336. #define DIR_CONN_STATE_CLIENT_FINISHED 4
  337. /** State for connection at directory server: waiting for HTTP request. */
  338. #define DIR_CONN_STATE_SERVER_COMMAND_WAIT 5
  339. /** State for connection at directory server: sending HTTP response. */
  340. #define DIR_CONN_STATE_SERVER_WRITING 6
  341. #define DIR_CONN_STATE_MAX_ 6
  342. /** True iff the purpose of <b>conn</b> means that it's a server-side
  343. * directory connection. */
  344. #define DIR_CONN_IS_SERVER(conn) ((conn)->purpose == DIR_PURPOSE_SERVER)
  345. #define CONTROL_CONN_STATE_MIN_ 1
  346. /** State for a control connection: Authenticated and accepting v1 commands. */
  347. #define CONTROL_CONN_STATE_OPEN 1
  348. /** State for a control connection: Waiting for authentication; speaking
  349. * protocol v1. */
  350. #define CONTROL_CONN_STATE_NEEDAUTH 2
  351. #define CONTROL_CONN_STATE_MAX_ 2
  352. #define DIR_PURPOSE_MIN_ 4
  353. /** A connection to a directory server: set after a v2 rendezvous
  354. * descriptor is downloaded. */
  355. #define DIR_PURPOSE_HAS_FETCHED_RENDDESC_V2 4
  356. /** A connection to a directory server: download one or more server
  357. * descriptors. */
  358. #define DIR_PURPOSE_FETCH_SERVERDESC 6
  359. /** A connection to a directory server: download one or more extra-info
  360. * documents. */
  361. #define DIR_PURPOSE_FETCH_EXTRAINFO 7
  362. /** A connection to a directory server: upload a server descriptor. */
  363. #define DIR_PURPOSE_UPLOAD_DIR 8
  364. /** A connection to a directory server: upload a v3 networkstatus vote. */
  365. #define DIR_PURPOSE_UPLOAD_VOTE 10
  366. /** A connection to a directory server: upload a v3 consensus signature */
  367. #define DIR_PURPOSE_UPLOAD_SIGNATURES 11
  368. /** A connection to a directory server: download one or more v3 networkstatus
  369. * votes. */
  370. #define DIR_PURPOSE_FETCH_STATUS_VOTE 12
  371. /** A connection to a directory server: download a v3 detached signatures
  372. * object for a consensus. */
  373. #define DIR_PURPOSE_FETCH_DETACHED_SIGNATURES 13
  374. /** A connection to a directory server: download a v3 networkstatus
  375. * consensus. */
  376. #define DIR_PURPOSE_FETCH_CONSENSUS 14
  377. /** A connection to a directory server: download one or more directory
  378. * authority certificates. */
  379. #define DIR_PURPOSE_FETCH_CERTIFICATE 15
  380. /** Purpose for connection at a directory server. */
  381. #define DIR_PURPOSE_SERVER 16
  382. /** A connection to a hidden service directory server: upload a v2 rendezvous
  383. * descriptor. */
  384. #define DIR_PURPOSE_UPLOAD_RENDDESC_V2 17
  385. /** A connection to a hidden service directory server: download a v2 rendezvous
  386. * descriptor. */
  387. #define DIR_PURPOSE_FETCH_RENDDESC_V2 18
  388. /** A connection to a directory server: download a microdescriptor. */
  389. #define DIR_PURPOSE_FETCH_MICRODESC 19
  390. /** A connection to a hidden service directory: upload a v3 descriptor. */
  391. #define DIR_PURPOSE_UPLOAD_HSDESC 20
  392. /** A connection to a hidden service directory: fetch a v3 descriptor. */
  393. #define DIR_PURPOSE_FETCH_HSDESC 21
  394. /** A connection to a directory server: set after a hidden service descriptor
  395. * is downloaded. */
  396. #define DIR_PURPOSE_HAS_FETCHED_HSDESC 22
  397. #define DIR_PURPOSE_MAX_ 22
  398. /** True iff <b>p</b> is a purpose corresponding to uploading
  399. * data to a directory server. */
  400. #define DIR_PURPOSE_IS_UPLOAD(p) \
  401. ((p)==DIR_PURPOSE_UPLOAD_DIR || \
  402. (p)==DIR_PURPOSE_UPLOAD_VOTE || \
  403. (p)==DIR_PURPOSE_UPLOAD_SIGNATURES || \
  404. (p)==DIR_PURPOSE_UPLOAD_RENDDESC_V2 || \
  405. (p)==DIR_PURPOSE_UPLOAD_HSDESC)
  406. #define EXIT_PURPOSE_MIN_ 1
  407. /** This exit stream wants to do an ordinary connect. */
  408. #define EXIT_PURPOSE_CONNECT 1
  409. /** This exit stream wants to do a resolve (either normal or reverse). */
  410. #define EXIT_PURPOSE_RESOLVE 2
  411. #define EXIT_PURPOSE_MAX_ 2
  412. /* !!!! If any connection purpose is ever over 31, we must grow the type
  413. * field in connection_t. */
  414. /** Circuit state: I'm the origin, still haven't done all my handshakes. */
  415. #define CIRCUIT_STATE_BUILDING 0
  416. /** Circuit state: Waiting to process the onionskin. */
  417. #define CIRCUIT_STATE_ONIONSKIN_PENDING 1
  418. /** Circuit state: I'd like to deliver a create, but my n_chan is still
  419. * connecting. */
  420. #define CIRCUIT_STATE_CHAN_WAIT 2
  421. /** Circuit state: the circuit is open but we don't want to actually use it
  422. * until we find out if a better guard will be available.
  423. */
  424. #define CIRCUIT_STATE_GUARD_WAIT 3
  425. /** Circuit state: onionskin(s) processed, ready to send/receive cells. */
  426. #define CIRCUIT_STATE_OPEN 4
  427. #define CIRCUIT_PURPOSE_MIN_ 1
  428. /* these circuits were initiated elsewhere */
  429. #define CIRCUIT_PURPOSE_OR_MIN_ 1
  430. /** OR-side circuit purpose: normal circuit, at OR. */
  431. #define CIRCUIT_PURPOSE_OR 1
  432. /** OR-side circuit purpose: At OR, from the service, waiting for intro from
  433. * clients. */
  434. #define CIRCUIT_PURPOSE_INTRO_POINT 2
  435. /** OR-side circuit purpose: At OR, from the client, waiting for the service.
  436. */
  437. #define CIRCUIT_PURPOSE_REND_POINT_WAITING 3
  438. /** OR-side circuit purpose: At OR, both circuits have this purpose. */
  439. #define CIRCUIT_PURPOSE_REND_ESTABLISHED 4
  440. #define CIRCUIT_PURPOSE_OR_MAX_ 4
  441. /* these circuits originate at this node */
  442. /* here's how circ client-side purposes work:
  443. * normal circuits are C_GENERAL.
  444. * circuits that are c_introducing are either on their way to
  445. * becoming open, or they are open and waiting for a
  446. * suitable rendcirc before they send the intro.
  447. * circuits that are c_introduce_ack_wait have sent the intro,
  448. * but haven't gotten a response yet.
  449. * circuits that are c_establish_rend are either on their way
  450. * to becoming open, or they are open and have sent the
  451. * establish_rendezvous cell but haven't received an ack.
  452. * circuits that are c_rend_ready are open and have received a
  453. * rend ack, but haven't heard from the service yet. if they have a
  454. * buildstate->pending_final_cpath then they're expecting a
  455. * cell from the service, else they're not.
  456. * circuits that are c_rend_ready_intro_acked are open, and
  457. * some intro circ has sent its intro and received an ack.
  458. * circuits that are c_rend_joined are open, have heard from
  459. * the service, and are talking to it.
  460. */
  461. /** Client-side circuit purpose: Normal circuit, with cpath. */
  462. #define CIRCUIT_PURPOSE_C_GENERAL 5
  463. #define CIRCUIT_PURPOSE_C_HS_MIN_ 6
  464. /** Client-side circuit purpose: at the client, connecting to intro point. */
  465. #define CIRCUIT_PURPOSE_C_INTRODUCING 6
  466. /** Client-side circuit purpose: at the client, sent INTRODUCE1 to intro point,
  467. * waiting for ACK/NAK. */
  468. #define CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT 7
  469. /** Client-side circuit purpose: at the client, introduced and acked, closing.
  470. */
  471. #define CIRCUIT_PURPOSE_C_INTRODUCE_ACKED 8
  472. /** Client-side circuit purpose: at the client, waiting for ack. */
  473. #define CIRCUIT_PURPOSE_C_ESTABLISH_REND 9
  474. /** Client-side circuit purpose: at the client, waiting for the service. */
  475. #define CIRCUIT_PURPOSE_C_REND_READY 10
  476. /** Client-side circuit purpose: at the client, waiting for the service,
  477. * INTRODUCE has been acknowledged. */
  478. #define CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED 11
  479. /** Client-side circuit purpose: at the client, rendezvous established. */
  480. #define CIRCUIT_PURPOSE_C_REND_JOINED 12
  481. /** This circuit is used for getting hsdirs */
  482. #define CIRCUIT_PURPOSE_C_HSDIR_GET 13
  483. #define CIRCUIT_PURPOSE_C_HS_MAX_ 13
  484. /** This circuit is used for build time measurement only */
  485. #define CIRCUIT_PURPOSE_C_MEASURE_TIMEOUT 14
  486. #define CIRCUIT_PURPOSE_C_MAX_ 14
  487. #define CIRCUIT_PURPOSE_S_HS_MIN_ 15
  488. /** Hidden-service-side circuit purpose: at the service, waiting for
  489. * introductions. */
  490. #define CIRCUIT_PURPOSE_S_ESTABLISH_INTRO 15
  491. /** Hidden-service-side circuit purpose: at the service, successfully
  492. * established intro. */
  493. #define CIRCUIT_PURPOSE_S_INTRO 16
  494. /** Hidden-service-side circuit purpose: at the service, connecting to rend
  495. * point. */
  496. #define CIRCUIT_PURPOSE_S_CONNECT_REND 17
  497. /** Hidden-service-side circuit purpose: at the service, rendezvous
  498. * established. */
  499. #define CIRCUIT_PURPOSE_S_REND_JOINED 18
  500. /** This circuit is used for uploading hsdirs */
  501. #define CIRCUIT_PURPOSE_S_HSDIR_POST 19
  502. #define CIRCUIT_PURPOSE_S_HS_MAX_ 19
  503. /** A testing circuit; not meant to be used for actual traffic. */
  504. #define CIRCUIT_PURPOSE_TESTING 20
  505. /** A controller made this circuit and Tor should not use it. */
  506. #define CIRCUIT_PURPOSE_CONTROLLER 21
  507. /** This circuit is used for path bias probing only */
  508. #define CIRCUIT_PURPOSE_PATH_BIAS_TESTING 22
  509. /** This circuit is used for vanguards/restricted paths.
  510. *
  511. * This type of circuit is *only* created preemptively and never
  512. * on-demand. When an HS operation needs to take place (e.g. connect to an
  513. * intro point), these circuits are then cannibalized and repurposed to the
  514. * actual needed HS purpose. */
  515. #define CIRCUIT_PURPOSE_HS_VANGUARDS 23
  516. #define CIRCUIT_PURPOSE_MAX_ 23
  517. /** A catch-all for unrecognized purposes. Currently we don't expect
  518. * to make or see any circuits with this purpose. */
  519. #define CIRCUIT_PURPOSE_UNKNOWN 255
  520. /** True iff the circuit purpose <b>p</b> is for a circuit that
  521. * originated at this node. */
  522. #define CIRCUIT_PURPOSE_IS_ORIGIN(p) ((p)>CIRCUIT_PURPOSE_OR_MAX_)
  523. /** True iff the circuit purpose <b>p</b> is for a circuit that originated
  524. * here to serve as a client. (Hidden services don't count here.) */
  525. #define CIRCUIT_PURPOSE_IS_CLIENT(p) \
  526. ((p)> CIRCUIT_PURPOSE_OR_MAX_ && \
  527. (p)<=CIRCUIT_PURPOSE_C_MAX_)
  528. /** True iff the circuit_t <b>c</b> is actually an origin_circuit_t. */
  529. #define CIRCUIT_IS_ORIGIN(c) (CIRCUIT_PURPOSE_IS_ORIGIN((c)->purpose))
  530. /** True iff the circuit purpose <b>p</b> is for an established rendezvous
  531. * circuit. */
  532. #define CIRCUIT_PURPOSE_IS_ESTABLISHED_REND(p) \
  533. ((p) == CIRCUIT_PURPOSE_C_REND_JOINED || \
  534. (p) == CIRCUIT_PURPOSE_S_REND_JOINED)
  535. /** True iff the circuit_t c is actually an or_circuit_t */
  536. #define CIRCUIT_IS_ORCIRC(c) (((circuit_t *)(c))->magic == OR_CIRCUIT_MAGIC)
  537. /** True iff this circuit purpose should count towards the global
  538. * pending rate limit (set by MaxClientCircuitsPending). We count all
  539. * general purpose circuits, as well as the first step of client onion
  540. * service connections (HSDir gets). */
  541. #define CIRCUIT_PURPOSE_COUNTS_TOWARDS_MAXPENDING(p) \
  542. ((p) == CIRCUIT_PURPOSE_C_GENERAL || \
  543. (p) == CIRCUIT_PURPOSE_C_HSDIR_GET)
  544. /** How many circuits do we want simultaneously in-progress to handle
  545. * a given stream? */
  546. #define MIN_CIRCUITS_HANDLING_STREAM 2
  547. /* These RELAY_COMMAND constants define values for relay cell commands, and
  548. * must match those defined in tor-spec.txt. */
  549. #define RELAY_COMMAND_BEGIN 1
  550. #define RELAY_COMMAND_DATA 2
  551. #define RELAY_COMMAND_END 3
  552. #define RELAY_COMMAND_CONNECTED 4
  553. #define RELAY_COMMAND_SENDME 5
  554. #define RELAY_COMMAND_EXTEND 6
  555. #define RELAY_COMMAND_EXTENDED 7
  556. #define RELAY_COMMAND_TRUNCATE 8
  557. #define RELAY_COMMAND_TRUNCATED 9
  558. #define RELAY_COMMAND_DROP 10
  559. #define RELAY_COMMAND_RESOLVE 11
  560. #define RELAY_COMMAND_RESOLVED 12
  561. #define RELAY_COMMAND_BEGIN_DIR 13
  562. #define RELAY_COMMAND_EXTEND2 14
  563. #define RELAY_COMMAND_EXTENDED2 15
  564. #define RELAY_COMMAND_ESTABLISH_INTRO 32
  565. #define RELAY_COMMAND_ESTABLISH_RENDEZVOUS 33
  566. #define RELAY_COMMAND_INTRODUCE1 34
  567. #define RELAY_COMMAND_INTRODUCE2 35
  568. #define RELAY_COMMAND_RENDEZVOUS1 36
  569. #define RELAY_COMMAND_RENDEZVOUS2 37
  570. #define RELAY_COMMAND_INTRO_ESTABLISHED 38
  571. #define RELAY_COMMAND_RENDEZVOUS_ESTABLISHED 39
  572. #define RELAY_COMMAND_INTRODUCE_ACK 40
  573. /* Reasons why an OR connection is closed. */
  574. #define END_OR_CONN_REASON_DONE 1
  575. #define END_OR_CONN_REASON_REFUSED 2 /* connection refused */
  576. #define END_OR_CONN_REASON_OR_IDENTITY 3
  577. #define END_OR_CONN_REASON_CONNRESET 4 /* connection reset by peer */
  578. #define END_OR_CONN_REASON_TIMEOUT 5
  579. #define END_OR_CONN_REASON_NO_ROUTE 6 /* no route to host/net */
  580. #define END_OR_CONN_REASON_IO_ERROR 7 /* read/write error */
  581. #define END_OR_CONN_REASON_RESOURCE_LIMIT 8 /* sockets, buffers, etc */
  582. #define END_OR_CONN_REASON_PT_MISSING 9 /* PT failed or not available */
  583. #define END_OR_CONN_REASON_MISC 10
  584. /* Reasons why we (or a remote OR) might close a stream. See tor-spec.txt for
  585. * documentation of these. The values must match. */
  586. #define END_STREAM_REASON_MISC 1
  587. #define END_STREAM_REASON_RESOLVEFAILED 2
  588. #define END_STREAM_REASON_CONNECTREFUSED 3
  589. #define END_STREAM_REASON_EXITPOLICY 4
  590. #define END_STREAM_REASON_DESTROY 5
  591. #define END_STREAM_REASON_DONE 6
  592. #define END_STREAM_REASON_TIMEOUT 7
  593. #define END_STREAM_REASON_NOROUTE 8
  594. #define END_STREAM_REASON_HIBERNATING 9
  595. #define END_STREAM_REASON_INTERNAL 10
  596. #define END_STREAM_REASON_RESOURCELIMIT 11
  597. #define END_STREAM_REASON_CONNRESET 12
  598. #define END_STREAM_REASON_TORPROTOCOL 13
  599. #define END_STREAM_REASON_NOTDIRECTORY 14
  600. #define END_STREAM_REASON_ENTRYPOLICY 15
  601. /* These high-numbered end reasons are not part of the official spec,
  602. * and are not intended to be put in relay end cells. They are here
  603. * to be more informative when sending back socks replies to the
  604. * application. */
  605. /* XXXX 256 is no longer used; feel free to reuse it. */
  606. /** We were unable to attach the connection to any circuit at all. */
  607. /* XXXX the ways we use this one don't make a lot of sense. */
  608. #define END_STREAM_REASON_CANT_ATTACH 257
  609. /** We can't connect to any directories at all, so we killed our streams
  610. * before they can time out. */
  611. #define END_STREAM_REASON_NET_UNREACHABLE 258
  612. /** This is a SOCKS connection, and the client used (or misused) the SOCKS
  613. * protocol in a way we couldn't handle. */
  614. #define END_STREAM_REASON_SOCKSPROTOCOL 259
  615. /** This is a transparent proxy connection, but we can't extract the original
  616. * target address:port. */
  617. #define END_STREAM_REASON_CANT_FETCH_ORIG_DEST 260
  618. /** This is a connection on the NATD port, and the destination IP:Port was
  619. * either ill-formed or out-of-range. */
  620. #define END_STREAM_REASON_INVALID_NATD_DEST 261
  621. /** The target address is in a private network (like 127.0.0.1 or 10.0.0.1);
  622. * you don't want to do that over a randomly chosen exit */
  623. #define END_STREAM_REASON_PRIVATE_ADDR 262
  624. /** This is an HTTP tunnel connection and the client used or misused HTTP in a
  625. * way we can't handle.
  626. */
  627. #define END_STREAM_REASON_HTTPPROTOCOL 263
  628. /** Bitwise-and this value with endreason to mask out all flags. */
  629. #define END_STREAM_REASON_MASK 511
  630. /** Bitwise-or this with the argument to control_event_stream_status
  631. * to indicate that the reason came from an END cell. */
  632. #define END_STREAM_REASON_FLAG_REMOTE 512
  633. /** Bitwise-or this with the argument to control_event_stream_status
  634. * to indicate that we already sent a CLOSED stream event. */
  635. #define END_STREAM_REASON_FLAG_ALREADY_SENT_CLOSED 1024
  636. /** Bitwise-or this with endreason to indicate that we already sent
  637. * a socks reply, and no further reply needs to be sent from
  638. * connection_mark_unattached_ap(). */
  639. #define END_STREAM_REASON_FLAG_ALREADY_SOCKS_REPLIED 2048
  640. /** Reason for remapping an AP connection's address: we have a cached
  641. * answer. */
  642. #define REMAP_STREAM_SOURCE_CACHE 1
  643. /** Reason for remapping an AP connection's address: the exit node told us an
  644. * answer. */
  645. #define REMAP_STREAM_SOURCE_EXIT 2
  646. /* 'type' values to use in RESOLVED cells. Specified in tor-spec.txt. */
  647. #define RESOLVED_TYPE_HOSTNAME 0
  648. #define RESOLVED_TYPE_IPV4 4
  649. #define RESOLVED_TYPE_IPV6 6
  650. #define RESOLVED_TYPE_ERROR_TRANSIENT 0xF0
  651. #define RESOLVED_TYPE_ERROR 0xF1
  652. /* Negative reasons are internal: we never send them in a DESTROY or TRUNCATE
  653. * call; they only go to the controller for tracking */
  654. /* Closing introduction point that were opened in parallel. */
  655. #define END_CIRC_REASON_IP_NOW_REDUNDANT -4
  656. /** Our post-timeout circuit time measurement period expired.
  657. * We must give up now */
  658. #define END_CIRC_REASON_MEASUREMENT_EXPIRED -3
  659. /** We couldn't build a path for this circuit. */
  660. #define END_CIRC_REASON_NOPATH -2
  661. /** Catch-all "other" reason for closing origin circuits. */
  662. #define END_CIRC_AT_ORIGIN -1
  663. /* Reasons why we (or a remote OR) might close a circuit. See tor-spec.txt
  664. * section 5.4 for documentation of these. */
  665. #define END_CIRC_REASON_MIN_ 0
  666. #define END_CIRC_REASON_NONE 0
  667. #define END_CIRC_REASON_TORPROTOCOL 1
  668. #define END_CIRC_REASON_INTERNAL 2
  669. #define END_CIRC_REASON_REQUESTED 3
  670. #define END_CIRC_REASON_HIBERNATING 4
  671. #define END_CIRC_REASON_RESOURCELIMIT 5
  672. #define END_CIRC_REASON_CONNECTFAILED 6
  673. #define END_CIRC_REASON_OR_IDENTITY 7
  674. #define END_CIRC_REASON_CHANNEL_CLOSED 8
  675. #define END_CIRC_REASON_FINISHED 9
  676. #define END_CIRC_REASON_TIMEOUT 10
  677. #define END_CIRC_REASON_DESTROYED 11
  678. #define END_CIRC_REASON_NOSUCHSERVICE 12
  679. #define END_CIRC_REASON_MAX_ 12
  680. /** Bitwise-OR this with the argument to circuit_mark_for_close() or
  681. * control_event_circuit_status() to indicate that the reason was
  682. * passed through from a destroy or truncate cell. */
  683. #define END_CIRC_REASON_FLAG_REMOTE 512
  684. /** Length of 'y' portion of 'y.onion' URL. */
  685. #define REND_SERVICE_ID_LEN_BASE32 16
  686. /** Length of 'y.onion' including '.onion' URL. */
  687. #define REND_SERVICE_ADDRESS_LEN (16+1+5)
  688. /** Length of a binary-encoded rendezvous service ID. */
  689. #define REND_SERVICE_ID_LEN 10
  690. /** Time period for which a v2 descriptor will be valid. */
  691. #define REND_TIME_PERIOD_V2_DESC_VALIDITY (24*60*60)
  692. /** Time period within which two sets of v2 descriptors will be uploaded in
  693. * parallel. */
  694. #define REND_TIME_PERIOD_OVERLAPPING_V2_DESCS (60*60)
  695. /** Number of non-consecutive replicas (i.e. distributed somewhere
  696. * in the ring) for a descriptor. */
  697. #define REND_NUMBER_OF_NON_CONSECUTIVE_REPLICAS 2
  698. /** Number of consecutive replicas for a descriptor. */
  699. #define REND_NUMBER_OF_CONSECUTIVE_REPLICAS 3
  700. /** Length of v2 descriptor ID (32 base32 chars = 160 bits). */
  701. #define REND_DESC_ID_V2_LEN_BASE32 BASE32_DIGEST_LEN
  702. /** Length of the base32-encoded secret ID part of versioned hidden service
  703. * descriptors. */
  704. #define REND_SECRET_ID_PART_LEN_BASE32 BASE32_DIGEST_LEN
  705. /** Length of the base32-encoded hash of an introduction point's
  706. * identity key. */
  707. #define REND_INTRO_POINT_ID_LEN_BASE32 BASE32_DIGEST_LEN
  708. /** Length of the descriptor cookie that is used for client authorization
  709. * to hidden services. */
  710. #define REND_DESC_COOKIE_LEN 16
  711. /** Length of the base64-encoded descriptor cookie that is used for
  712. * exchanging client authorization between hidden service and client. */
  713. #define REND_DESC_COOKIE_LEN_BASE64 22
  714. /** Length of client identifier in encrypted introduction points for hidden
  715. * service authorization type 'basic'. */
  716. #define REND_BASIC_AUTH_CLIENT_ID_LEN 4
  717. /** Multiple of the number of clients to which the real number of clients
  718. * is padded with fake clients for hidden service authorization type
  719. * 'basic'. */
  720. #define REND_BASIC_AUTH_CLIENT_MULTIPLE 16
  721. /** Length of client entry consisting of client identifier and encrypted
  722. * session key for hidden service authorization type 'basic'. */
  723. #define REND_BASIC_AUTH_CLIENT_ENTRY_LEN (REND_BASIC_AUTH_CLIENT_ID_LEN \
  724. + CIPHER_KEY_LEN)
  725. /** Maximum size of v2 hidden service descriptors. */
  726. #define REND_DESC_MAX_SIZE (20 * 1024)
  727. /** Legal characters for use in authorized client names for a hidden
  728. * service. */
  729. #define REND_LEGAL_CLIENTNAME_CHARACTERS \
  730. "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789+-_"
  731. /** Maximum length of authorized client names for a hidden service. */
  732. #define REND_CLIENTNAME_MAX_LEN 16
  733. /** Length of the rendezvous cookie that is used to connect circuits at the
  734. * rendezvous point. */
  735. #define REND_COOKIE_LEN DIGEST_LEN
  736. /** Client authorization type that a hidden service performs. */
  737. typedef enum rend_auth_type_t {
  738. REND_NO_AUTH = 0,
  739. REND_BASIC_AUTH = 1,
  740. REND_STEALTH_AUTH = 2,
  741. } rend_auth_type_t;
  742. /** Client-side configuration of authorization for a hidden service. */
  743. typedef struct rend_service_authorization_t {
  744. uint8_t descriptor_cookie[REND_DESC_COOKIE_LEN];
  745. char onion_address[REND_SERVICE_ADDRESS_LEN+1];
  746. rend_auth_type_t auth_type;
  747. } rend_service_authorization_t;
  748. /** Client- and server-side data that is used for hidden service connection
  749. * establishment. Not all fields contain data depending on where this struct
  750. * is used. */
  751. typedef struct rend_data_t {
  752. /* Hidden service protocol version of this base object. */
  753. uint32_t version;
  754. /** List of HSDir fingerprints on which this request has been sent to. This
  755. * contains binary identity digest of the directory of size DIGEST_LEN. */
  756. smartlist_t *hsdirs_fp;
  757. /** Rendezvous cookie used by both, client and service. */
  758. char rend_cookie[REND_COOKIE_LEN];
  759. /** Number of streams associated with this rendezvous circuit. */
  760. int nr_streams;
  761. } rend_data_t;
  762. typedef struct rend_data_v2_t {
  763. /* Rendezvous base data. */
  764. rend_data_t base_;
  765. /** Onion address (without the .onion part) that a client requests. */
  766. char onion_address[REND_SERVICE_ID_LEN_BASE32+1];
  767. /** Descriptor ID for each replicas computed from the onion address. If
  768. * the onion address is empty, this array MUST be empty. We keep them so
  769. * we know when to purge our entry in the last hsdir request table. */
  770. char descriptor_id[REND_NUMBER_OF_NON_CONSECUTIVE_REPLICAS][DIGEST_LEN];
  771. /** (Optional) descriptor cookie that is used by a client. */
  772. char descriptor_cookie[REND_DESC_COOKIE_LEN];
  773. /** Authorization type for accessing a service used by a client. */
  774. rend_auth_type_t auth_type;
  775. /** Descriptor ID for a client request. The control port command HSFETCH
  776. * uses this. It's set if the descriptor query should only use this
  777. * descriptor ID. */
  778. char desc_id_fetch[DIGEST_LEN];
  779. /** Hash of the hidden service's PK used by a service. */
  780. char rend_pk_digest[DIGEST_LEN];
  781. } rend_data_v2_t;
  782. /* From a base rend_data_t object <b>d</d>, return the v2 object. */
  783. static inline
  784. rend_data_v2_t *TO_REND_DATA_V2(const rend_data_t *d)
  785. {
  786. tor_assert(d);
  787. tor_assert(d->version == 2);
  788. return DOWNCAST(rend_data_v2_t, d);
  789. }
  790. /* Stub because we can't include hs_ident.h. */
  791. struct hs_ident_edge_conn_t;
  792. struct hs_ident_dir_conn_t;
  793. struct hs_ident_circuit_t;
  794. /* Hidden service directory index used in a node_t which is set once we set
  795. * the consensus. */
  796. typedef struct hsdir_index_t {
  797. /* HSDir index to use when fetching a descriptor. */
  798. uint8_t fetch[DIGEST256_LEN];
  799. /* HSDir index used by services to store their first and second
  800. * descriptor. The first descriptor is chronologically older than the second
  801. * one and uses older TP and SRV values. */
  802. uint8_t store_first[DIGEST256_LEN];
  803. uint8_t store_second[DIGEST256_LEN];
  804. } hsdir_index_t;
  805. /** Time interval for tracking replays of DH public keys received in
  806. * INTRODUCE2 cells. Used only to avoid launching multiple
  807. * simultaneous attempts to connect to the same rendezvous point. */
  808. #define REND_REPLAY_TIME_INTERVAL (5 * 60)
  809. /** Used to indicate which way a cell is going on a circuit. */
  810. typedef enum {
  811. CELL_DIRECTION_IN=1, /**< The cell is moving towards the origin. */
  812. CELL_DIRECTION_OUT=2, /**< The cell is moving away from the origin. */
  813. } cell_direction_t;
  814. /** Initial value for both sides of a circuit transmission window when the
  815. * circuit is initialized. Measured in cells. */
  816. #define CIRCWINDOW_START 1000
  817. #define CIRCWINDOW_START_MIN 100
  818. #define CIRCWINDOW_START_MAX 1000
  819. /** Amount to increment a circuit window when we get a circuit SENDME. */
  820. #define CIRCWINDOW_INCREMENT 100
  821. /** Initial value on both sides of a stream transmission window when the
  822. * stream is initialized. Measured in cells. */
  823. #define STREAMWINDOW_START 500
  824. /** Amount to increment a stream window when we get a stream SENDME. */
  825. #define STREAMWINDOW_INCREMENT 50
  826. /** Maximum number of queued cells on a circuit for which we are the
  827. * midpoint before we give up and kill it. This must be >= circwindow
  828. * to avoid killing innocent circuits, and >= circwindow*2 to give
  829. * leaky-pipe a chance of working someday. The ORCIRC_MAX_MIDDLE_KILL_THRESH
  830. * ratio controls the margin of error between emitting a warning and
  831. * killing the circuit.
  832. */
  833. #define ORCIRC_MAX_MIDDLE_CELLS (CIRCWINDOW_START_MAX*2)
  834. /** Ratio of hard (circuit kill) to soft (warning) thresholds for the
  835. * ORCIRC_MAX_MIDDLE_CELLS tests.
  836. */
  837. #define ORCIRC_MAX_MIDDLE_KILL_THRESH (1.1f)
  838. /* Cell commands. These values are defined in tor-spec.txt. */
  839. #define CELL_PADDING 0
  840. #define CELL_CREATE 1
  841. #define CELL_CREATED 2
  842. #define CELL_RELAY 3
  843. #define CELL_DESTROY 4
  844. #define CELL_CREATE_FAST 5
  845. #define CELL_CREATED_FAST 6
  846. #define CELL_VERSIONS 7
  847. #define CELL_NETINFO 8
  848. #define CELL_RELAY_EARLY 9
  849. #define CELL_CREATE2 10
  850. #define CELL_CREATED2 11
  851. #define CELL_PADDING_NEGOTIATE 12
  852. #define CELL_VPADDING 128
  853. #define CELL_CERTS 129
  854. #define CELL_AUTH_CHALLENGE 130
  855. #define CELL_AUTHENTICATE 131
  856. #define CELL_AUTHORIZE 132
  857. #define CELL_COMMAND_MAX_ 132
  858. /** How long to test reachability before complaining to the user. */
  859. #define TIMEOUT_UNTIL_UNREACHABILITY_COMPLAINT (20*60)
  860. /** Legal characters in a nickname. */
  861. #define LEGAL_NICKNAME_CHARACTERS \
  862. "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789"
  863. /** Name to use in client TLS certificates if no nickname is given. Once
  864. * Tor 0.1.2.x is obsolete, we can remove this. */
  865. #define DEFAULT_CLIENT_NICKNAME "client"
  866. /** Name chosen by routers that don't configure nicknames */
  867. #define UNNAMED_ROUTER_NICKNAME "Unnamed"
  868. /** Number of bytes in a SOCKS4 header. */
  869. #define SOCKS4_NETWORK_LEN 8
  870. /*
  871. * Relay payload:
  872. * Relay command [1 byte]
  873. * Recognized [2 bytes]
  874. * Stream ID [2 bytes]
  875. * Partial SHA-1 [4 bytes]
  876. * Length [2 bytes]
  877. * Relay payload [498 bytes]
  878. */
  879. /** Number of bytes in a cell, minus cell header. */
  880. #define CELL_PAYLOAD_SIZE 509
  881. /** Number of bytes in a cell transmitted over the network, in the longest
  882. * form */
  883. #define CELL_MAX_NETWORK_SIZE 514
  884. /** Maximum length of a header on a variable-length cell. */
  885. #define VAR_CELL_MAX_HEADER_SIZE 7
  886. static int get_cell_network_size(int wide_circ_ids);
  887. static inline int get_cell_network_size(int wide_circ_ids)
  888. {
  889. return wide_circ_ids ? CELL_MAX_NETWORK_SIZE : CELL_MAX_NETWORK_SIZE - 2;
  890. }
  891. static int get_var_cell_header_size(int wide_circ_ids);
  892. static inline int get_var_cell_header_size(int wide_circ_ids)
  893. {
  894. return wide_circ_ids ? VAR_CELL_MAX_HEADER_SIZE :
  895. VAR_CELL_MAX_HEADER_SIZE - 2;
  896. }
  897. static int get_circ_id_size(int wide_circ_ids);
  898. static inline int get_circ_id_size(int wide_circ_ids)
  899. {
  900. return wide_circ_ids ? 4 : 2;
  901. }
  902. /** Number of bytes in a relay cell's header (not including general cell
  903. * header). */
  904. #define RELAY_HEADER_SIZE (1+2+2+4+2)
  905. /** Largest number of bytes that can fit in a relay cell payload. */
  906. #define RELAY_PAYLOAD_SIZE (CELL_PAYLOAD_SIZE-RELAY_HEADER_SIZE)
  907. /** Identifies a circuit on an or_connection */
  908. typedef uint32_t circid_t;
  909. /** Identifies a stream on a circuit */
  910. typedef uint16_t streamid_t;
  911. /* channel_t typedef; struct channel_s is in channel.h */
  912. typedef struct channel_s channel_t;
  913. /* channel_listener_t typedef; struct channel_listener_s is in channel.h */
  914. typedef struct channel_listener_s channel_listener_t;
  915. /* channel states for channel_t */
  916. typedef enum {
  917. /*
  918. * Closed state - channel is inactive
  919. *
  920. * Permitted transitions from:
  921. * - CHANNEL_STATE_CLOSING
  922. * Permitted transitions to:
  923. * - CHANNEL_STATE_OPENING
  924. */
  925. CHANNEL_STATE_CLOSED = 0,
  926. /*
  927. * Opening state - channel is trying to connect
  928. *
  929. * Permitted transitions from:
  930. * - CHANNEL_STATE_CLOSED
  931. * Permitted transitions to:
  932. * - CHANNEL_STATE_CLOSING
  933. * - CHANNEL_STATE_ERROR
  934. * - CHANNEL_STATE_OPEN
  935. */
  936. CHANNEL_STATE_OPENING,
  937. /*
  938. * Open state - channel is active and ready for use
  939. *
  940. * Permitted transitions from:
  941. * - CHANNEL_STATE_MAINT
  942. * - CHANNEL_STATE_OPENING
  943. * Permitted transitions to:
  944. * - CHANNEL_STATE_CLOSING
  945. * - CHANNEL_STATE_ERROR
  946. * - CHANNEL_STATE_MAINT
  947. */
  948. CHANNEL_STATE_OPEN,
  949. /*
  950. * Maintenance state - channel is temporarily offline for subclass specific
  951. * maintenance activities such as TLS renegotiation.
  952. *
  953. * Permitted transitions from:
  954. * - CHANNEL_STATE_OPEN
  955. * Permitted transitions to:
  956. * - CHANNEL_STATE_CLOSING
  957. * - CHANNEL_STATE_ERROR
  958. * - CHANNEL_STATE_OPEN
  959. */
  960. CHANNEL_STATE_MAINT,
  961. /*
  962. * Closing state - channel is shutting down
  963. *
  964. * Permitted transitions from:
  965. * - CHANNEL_STATE_MAINT
  966. * - CHANNEL_STATE_OPEN
  967. * Permitted transitions to:
  968. * - CHANNEL_STATE_CLOSED,
  969. * - CHANNEL_STATE_ERROR
  970. */
  971. CHANNEL_STATE_CLOSING,
  972. /*
  973. * Error state - channel has experienced a permanent error
  974. *
  975. * Permitted transitions from:
  976. * - CHANNEL_STATE_CLOSING
  977. * - CHANNEL_STATE_MAINT
  978. * - CHANNEL_STATE_OPENING
  979. * - CHANNEL_STATE_OPEN
  980. * Permitted transitions to:
  981. * - None
  982. */
  983. CHANNEL_STATE_ERROR,
  984. /*
  985. * Placeholder for maximum state value
  986. */
  987. CHANNEL_STATE_LAST
  988. } channel_state_t;
  989. /* channel listener states for channel_listener_t */
  990. typedef enum {
  991. /*
  992. * Closed state - channel listener is inactive
  993. *
  994. * Permitted transitions from:
  995. * - CHANNEL_LISTENER_STATE_CLOSING
  996. * Permitted transitions to:
  997. * - CHANNEL_LISTENER_STATE_LISTENING
  998. */
  999. CHANNEL_LISTENER_STATE_CLOSED = 0,
  1000. /*
  1001. * Listening state - channel listener is listening for incoming
  1002. * connections
  1003. *
  1004. * Permitted transitions from:
  1005. * - CHANNEL_LISTENER_STATE_CLOSED
  1006. * Permitted transitions to:
  1007. * - CHANNEL_LISTENER_STATE_CLOSING
  1008. * - CHANNEL_LISTENER_STATE_ERROR
  1009. */
  1010. CHANNEL_LISTENER_STATE_LISTENING,
  1011. /*
  1012. * Closing state - channel listener is shutting down
  1013. *
  1014. * Permitted transitions from:
  1015. * - CHANNEL_LISTENER_STATE_LISTENING
  1016. * Permitted transitions to:
  1017. * - CHANNEL_LISTENER_STATE_CLOSED,
  1018. * - CHANNEL_LISTENER_STATE_ERROR
  1019. */
  1020. CHANNEL_LISTENER_STATE_CLOSING,
  1021. /*
  1022. * Error state - channel listener has experienced a permanent error
  1023. *
  1024. * Permitted transitions from:
  1025. * - CHANNEL_STATE_CLOSING
  1026. * - CHANNEL_STATE_LISTENING
  1027. * Permitted transitions to:
  1028. * - None
  1029. */
  1030. CHANNEL_LISTENER_STATE_ERROR,
  1031. /*
  1032. * Placeholder for maximum state value
  1033. */
  1034. CHANNEL_LISTENER_STATE_LAST
  1035. } channel_listener_state_t;
  1036. /* TLS channel stuff */
  1037. typedef struct channel_tls_s channel_tls_t;
  1038. /* circuitmux_t typedef; struct circuitmux_s is in circuitmux.h */
  1039. typedef struct circuitmux_s circuitmux_t;
  1040. /** Parsed onion routing cell. All communication between nodes
  1041. * is via cells. */
  1042. typedef struct cell_t {
  1043. circid_t circ_id; /**< Circuit which received the cell. */
  1044. uint8_t command; /**< Type of the cell: one of CELL_PADDING, CELL_CREATE,
  1045. * CELL_DESTROY, etc */
  1046. uint8_t payload[CELL_PAYLOAD_SIZE]; /**< Cell body. */
  1047. } cell_t;
  1048. /** Parsed variable-length onion routing cell. */
  1049. typedef struct var_cell_t {
  1050. /** Type of the cell: CELL_VERSIONS, etc. */
  1051. uint8_t command;
  1052. /** Circuit thich received the cell */
  1053. circid_t circ_id;
  1054. /** Number of bytes actually stored in <b>payload</b> */
  1055. uint16_t payload_len;
  1056. /** Payload of this cell */
  1057. uint8_t payload[FLEXIBLE_ARRAY_MEMBER];
  1058. } var_cell_t;
  1059. /** A parsed Extended ORPort message. */
  1060. typedef struct ext_or_cmd_t {
  1061. uint16_t cmd; /** Command type */
  1062. uint16_t len; /** Body length */
  1063. char body[FLEXIBLE_ARRAY_MEMBER]; /** Message body */
  1064. } ext_or_cmd_t;
  1065. /** A cell as packed for writing to the network. */
  1066. typedef struct packed_cell_t {
  1067. /** Next cell queued on this circuit. */
  1068. TOR_SIMPLEQ_ENTRY(packed_cell_t) next;
  1069. char body[CELL_MAX_NETWORK_SIZE]; /**< Cell as packed for network. */
  1070. uint32_t inserted_timestamp; /**< Time (in timestamp units) when this cell
  1071. * was inserted */
  1072. } packed_cell_t;
  1073. /** A queue of cells on a circuit, waiting to be added to the
  1074. * or_connection_t's outbuf. */
  1075. typedef struct cell_queue_t {
  1076. /** Linked list of packed_cell_t*/
  1077. TOR_SIMPLEQ_HEAD(cell_simpleq, packed_cell_t) head;
  1078. int n; /**< The number of cells in the queue. */
  1079. } cell_queue_t;
  1080. /** A single queued destroy cell. */
  1081. typedef struct destroy_cell_t {
  1082. TOR_SIMPLEQ_ENTRY(destroy_cell_t) next;
  1083. circid_t circid;
  1084. uint32_t inserted_timestamp; /**< Time (in timestamp units) when this cell
  1085. * was inserted */
  1086. uint8_t reason;
  1087. } destroy_cell_t;
  1088. /** A queue of destroy cells on a channel. */
  1089. typedef struct destroy_cell_queue_t {
  1090. /** Linked list of packed_cell_t */
  1091. TOR_SIMPLEQ_HEAD(dcell_simpleq, destroy_cell_t) head;
  1092. int n; /**< The number of cells in the queue. */
  1093. } destroy_cell_queue_t;
  1094. /** Beginning of a RELAY cell payload. */
  1095. typedef struct {
  1096. uint8_t command; /**< The end-to-end relay command. */
  1097. uint16_t recognized; /**< Used to tell whether cell is for us. */
  1098. streamid_t stream_id; /**< Which stream is this cell associated with? */
  1099. char integrity[4]; /**< Used to tell whether cell is corrupted. */
  1100. uint16_t length; /**< How long is the payload body? */
  1101. } relay_header_t;
  1102. typedef struct socks_request_t socks_request_t;
  1103. typedef struct entry_port_cfg_t entry_port_cfg_t;
  1104. typedef struct server_port_cfg_t server_port_cfg_t;
  1105. /* Values for connection_t.magic: used to make sure that downcasts (casts from
  1106. * connection_t to foo_connection_t) are safe. */
  1107. #define BASE_CONNECTION_MAGIC 0x7C3C304Eu
  1108. #define OR_CONNECTION_MAGIC 0x7D31FF03u
  1109. #define EDGE_CONNECTION_MAGIC 0xF0374013u
  1110. #define ENTRY_CONNECTION_MAGIC 0xbb4a5703
  1111. #define DIR_CONNECTION_MAGIC 0x9988ffeeu
  1112. #define CONTROL_CONNECTION_MAGIC 0x8abc765du
  1113. #define LISTENER_CONNECTION_MAGIC 0x1a1ac741u
  1114. /** Minimum length of the random part of an AUTH_CHALLENGE cell. */
  1115. #define OR_AUTH_CHALLENGE_LEN 32
  1116. /**
  1117. * @name Certificate types for CERTS cells.
  1118. *
  1119. * These values are defined by the protocol, and affect how an X509
  1120. * certificate in a CERTS cell is interpreted and used.
  1121. *
  1122. * @{ */
  1123. /** A certificate that authenticates a TLS link key. The subject key
  1124. * must match the key used in the TLS handshake; it must be signed by
  1125. * the identity key. */
  1126. #define OR_CERT_TYPE_TLS_LINK 1
  1127. /** A self-signed identity certificate. The subject key must be a
  1128. * 1024-bit RSA key. */
  1129. #define OR_CERT_TYPE_ID_1024 2
  1130. /** A certificate that authenticates a key used in an AUTHENTICATE cell
  1131. * in the v3 handshake. The subject key must be a 1024-bit RSA key; it
  1132. * must be signed by the identity key */
  1133. #define OR_CERT_TYPE_AUTH_1024 3
  1134. /* DOCDOC */
  1135. #define OR_CERT_TYPE_RSA_ED_CROSSCERT 7
  1136. /**@}*/
  1137. /** The first supported type of AUTHENTICATE cell. It contains
  1138. * a bunch of structures signed with an RSA1024 key. The signed
  1139. * structures include a HMAC using negotiated TLS secrets, and a digest
  1140. * of all cells sent or received before the AUTHENTICATE cell (including
  1141. * the random server-generated AUTH_CHALLENGE cell).
  1142. */
  1143. #define AUTHTYPE_RSA_SHA256_TLSSECRET 1
  1144. /** As AUTHTYPE_RSA_SHA256_TLSSECRET, but instead of using the
  1145. * negotiated TLS secrets, uses exported keying material from the TLS
  1146. * session as described in RFC 5705.
  1147. *
  1148. * Not used by today's tors, since everything that supports this
  1149. * also supports ED25519_SHA256_5705, which is better.
  1150. **/
  1151. #define AUTHTYPE_RSA_SHA256_RFC5705 2
  1152. /** As AUTHTYPE_RSA_SHA256_RFC5705, but uses an Ed25519 identity key to
  1153. * authenticate. */
  1154. #define AUTHTYPE_ED25519_SHA256_RFC5705 3
  1155. /*
  1156. * NOTE: authchallenge_type_is_better() relies on these AUTHTYPE codes
  1157. * being sorted in order of preference. If we someday add one with
  1158. * a higher numerical value that we don't like as much, we should revise
  1159. * authchallenge_type_is_better().
  1160. */
  1161. /** The length of the part of the AUTHENTICATE cell body that the client and
  1162. * server can generate independently (when using RSA_SHA256_TLSSECRET). It
  1163. * contains everything except the client's timestamp, the client's randomly
  1164. * generated nonce, and the signature. */
  1165. #define V3_AUTH_FIXED_PART_LEN (8+(32*6))
  1166. /** The length of the part of the AUTHENTICATE cell body that the client
  1167. * signs. */
  1168. #define V3_AUTH_BODY_LEN (V3_AUTH_FIXED_PART_LEN + 8 + 16)
  1169. typedef struct or_handshake_certs_t or_handshake_certs_t;
  1170. typedef struct or_handshake_state_t or_handshake_state_t;
  1171. /** Length of Extended ORPort connection identifier. */
  1172. #define EXT_OR_CONN_ID_LEN DIGEST_LEN /* 20 */
  1173. /*
  1174. * OR_CONN_HIGHWATER and OR_CONN_LOWWATER moved from connection_or.c so
  1175. * channeltls.c can see them too.
  1176. */
  1177. /** When adding cells to an OR connection's outbuf, keep adding until the
  1178. * outbuf is at least this long, or we run out of cells. */
  1179. #define OR_CONN_HIGHWATER (32*1024)
  1180. /** Add cells to an OR connection's outbuf whenever the outbuf's data length
  1181. * drops below this size. */
  1182. #define OR_CONN_LOWWATER (16*1024)
  1183. typedef struct connection_t connection_t;
  1184. typedef struct control_connection_t control_connection_t;
  1185. typedef struct dir_connection_t dir_connection_t;
  1186. typedef struct edge_connection_t edge_connection_t;
  1187. typedef struct entry_connection_t entry_connection_t;
  1188. typedef struct listener_connection_t listener_connection_t;
  1189. typedef struct or_connection_t or_connection_t;
  1190. /** Cast a connection_t subtype pointer to a connection_t **/
  1191. #define TO_CONN(c) (&(((c)->base_)))
  1192. /** Cast a entry_connection_t subtype pointer to a connection_t **/
  1193. #define ENTRY_TO_CONN(c) (TO_CONN(ENTRY_TO_EDGE_CONN(c)))
  1194. /** What action type does an address policy indicate: accept or reject? */
  1195. typedef enum {
  1196. ADDR_POLICY_ACCEPT=1,
  1197. ADDR_POLICY_REJECT=2,
  1198. } addr_policy_action_t;
  1199. #define addr_policy_action_bitfield_t ENUM_BF(addr_policy_action_t)
  1200. /** A reference-counted address policy rule. */
  1201. typedef struct addr_policy_t {
  1202. int refcnt; /**< Reference count */
  1203. /** What to do when the policy matches.*/
  1204. addr_policy_action_bitfield_t policy_type:2;
  1205. unsigned int is_private:1; /**< True iff this is the pseudo-address,
  1206. * "private". */
  1207. unsigned int is_canonical:1; /**< True iff this policy is the canonical
  1208. * copy (stored in a hash table to avoid
  1209. * duplication of common policies) */
  1210. maskbits_t maskbits; /**< Accept/reject all addresses <b>a</b> such that the
  1211. * first <b>maskbits</b> bits of <b>a</b> match
  1212. * <b>addr</b>. */
  1213. /** Base address to accept or reject.
  1214. *
  1215. * Note that wildcards are treated
  1216. * differntly depending on address family. An AF_UNSPEC address means
  1217. * "All addresses, IPv4 or IPv6." An AF_INET address with maskbits==0 means
  1218. * "All IPv4 addresses" and an AF_INET6 address with maskbits == 0 means
  1219. * "All IPv6 addresses".
  1220. **/
  1221. tor_addr_t addr;
  1222. uint16_t prt_min; /**< Lowest port number to accept/reject. */
  1223. uint16_t prt_max; /**< Highest port number to accept/reject. */
  1224. } addr_policy_t;
  1225. /** A cached_dir_t represents a cacheable directory object, along with its
  1226. * compressed form. */
  1227. typedef struct cached_dir_t {
  1228. char *dir; /**< Contents of this object, NUL-terminated. */
  1229. char *dir_compressed; /**< Compressed contents of this object. */
  1230. size_t dir_len; /**< Length of <b>dir</b> (not counting its NUL). */
  1231. size_t dir_compressed_len; /**< Length of <b>dir_compressed</b>. */
  1232. time_t published; /**< When was this object published. */
  1233. common_digests_t digests; /**< Digests of this object (networkstatus only) */
  1234. /** Sha3 digest (also ns only) */
  1235. uint8_t digest_sha3_as_signed[DIGEST256_LEN];
  1236. int refcnt; /**< Reference count for this cached_dir_t. */
  1237. } cached_dir_t;
  1238. /** Enum used to remember where a signed_descriptor_t is stored and how to
  1239. * manage the memory for signed_descriptor_body. */
  1240. typedef enum {
  1241. /** The descriptor isn't stored on disk at all: the copy in memory is
  1242. * canonical; the saved_offset field is meaningless. */
  1243. SAVED_NOWHERE=0,
  1244. /** The descriptor is stored in the cached_routers file: the
  1245. * signed_descriptor_body is meaningless; the signed_descriptor_len and
  1246. * saved_offset are used to index into the mmaped cache file. */
  1247. SAVED_IN_CACHE,
  1248. /** The descriptor is stored in the cached_routers.new file: the
  1249. * signed_descriptor_body and saved_offset fields are both set. */
  1250. /* FFFF (We could also mmap the file and grow the mmap as needed, or
  1251. * lazy-load the descriptor text by using seek and read. We don't, for
  1252. * now.)
  1253. */
  1254. SAVED_IN_JOURNAL
  1255. } saved_location_t;
  1256. #define saved_location_bitfield_t ENUM_BF(saved_location_t)
  1257. /** Enumeration: what directory object is being downloaded?
  1258. * This determines which schedule is selected to perform the download. */
  1259. typedef enum {
  1260. DL_SCHED_GENERIC = 0,
  1261. DL_SCHED_CONSENSUS = 1,
  1262. DL_SCHED_BRIDGE = 2,
  1263. } download_schedule_t;
  1264. #define download_schedule_bitfield_t ENUM_BF(download_schedule_t)
  1265. /** Enumeration: is the download schedule for downloading from an authority,
  1266. * or from any available directory mirror?
  1267. * During bootstrap, "any" means a fallback (or an authority, if there
  1268. * are no fallbacks).
  1269. * When we have a valid consensus, "any" means any directory server. */
  1270. typedef enum {
  1271. DL_WANT_ANY_DIRSERVER = 0,
  1272. DL_WANT_AUTHORITY = 1,
  1273. } download_want_authority_t;
  1274. #define download_want_authority_bitfield_t \
  1275. ENUM_BF(download_want_authority_t)
  1276. /** Enumeration: do we want to increment the schedule position each time a
  1277. * connection is attempted (these attempts can be concurrent), or do we want
  1278. * to increment the schedule position after a connection fails? */
  1279. typedef enum {
  1280. DL_SCHED_INCREMENT_FAILURE = 0,
  1281. DL_SCHED_INCREMENT_ATTEMPT = 1,
  1282. } download_schedule_increment_t;
  1283. #define download_schedule_increment_bitfield_t \
  1284. ENUM_BF(download_schedule_increment_t)
  1285. /** Information about our plans for retrying downloads for a downloadable
  1286. * directory object.
  1287. * Each type of downloadable directory object has a corresponding retry
  1288. * <b>schedule</b>, which can be different depending on whether the object is
  1289. * being downloaded from an authority or a mirror (<b>want_authority</b>).
  1290. * <b>next_attempt_at</b> contains the next time we will attempt to download
  1291. * the object.
  1292. * For schedules that <b>increment_on</b> failure, <b>n_download_failures</b>
  1293. * is used to determine the position in the schedule. (Each schedule is a
  1294. * smartlist of integer delays, parsed from a CSV option.) Every time a
  1295. * connection attempt fails, <b>n_download_failures</b> is incremented,
  1296. * the new delay value is looked up from the schedule, and
  1297. * <b>next_attempt_at</b> is set delay seconds from the time the previous
  1298. * connection failed. Therefore, at most one failure-based connection can be
  1299. * in progress for each download_status_t.
  1300. * For schedules that <b>increment_on</b> attempt, <b>n_download_attempts</b>
  1301. * is used to determine the position in the schedule. Every time a
  1302. * connection attempt is made, <b>n_download_attempts</b> is incremented,
  1303. * the new delay value is looked up from the schedule, and
  1304. * <b>next_attempt_at</b> is set delay seconds from the time the previous
  1305. * connection was attempted. Therefore, multiple concurrent attempted-based
  1306. * connections can be in progress for each download_status_t.
  1307. * After an object is successfully downloaded, any other concurrent connections
  1308. * are terminated. A new schedule which starts at position 0 is used for
  1309. * subsequent downloads of the same object.
  1310. */
  1311. typedef struct download_status_t {
  1312. time_t next_attempt_at; /**< When should we try downloading this object
  1313. * again? */
  1314. uint8_t n_download_failures; /**< Number of failed downloads of the most
  1315. * recent object, since the last success. */
  1316. uint8_t n_download_attempts; /**< Number of (potentially concurrent) attempts
  1317. * to download the most recent object, since
  1318. * the last success. */
  1319. download_schedule_bitfield_t schedule : 8; /**< What kind of object is being
  1320. * downloaded? This determines the
  1321. * schedule used for the download.
  1322. */
  1323. download_want_authority_bitfield_t want_authority : 1; /**< Is the download
  1324. * happening from an authority
  1325. * or a mirror? This determines
  1326. * the schedule used for the
  1327. * download. */
  1328. download_schedule_increment_bitfield_t increment_on : 1; /**< does this
  1329. * schedule increment on each attempt,
  1330. * or after each failure? */
  1331. uint8_t last_backoff_position; /**< number of attempts/failures, depending
  1332. * on increment_on, when we last recalculated
  1333. * the delay. Only updated if backoff
  1334. * == 1. */
  1335. int last_delay_used; /**< last delay used for random exponential backoff;
  1336. * only updated if backoff == 1 */
  1337. } download_status_t;
  1338. /** If n_download_failures is this high, the download can never happen. */
  1339. #define IMPOSSIBLE_TO_DOWNLOAD 255
  1340. /** The max size we expect router descriptor annotations we create to
  1341. * be. We'll accept larger ones if we see them on disk, but we won't
  1342. * create any that are larger than this. */
  1343. #define ROUTER_ANNOTATION_BUF_LEN 256
  1344. /** Information need to cache an onion router's descriptor. */
  1345. typedef struct signed_descriptor_t {
  1346. /** Pointer to the raw server descriptor, preceded by annotations. Not
  1347. * necessarily NUL-terminated. If saved_location is SAVED_IN_CACHE, this
  1348. * pointer is null. */
  1349. char *signed_descriptor_body;
  1350. /** Length of the annotations preceding the server descriptor. */
  1351. size_t annotations_len;
  1352. /** Length of the server descriptor. */
  1353. size_t signed_descriptor_len;
  1354. /** Digest of the server descriptor, computed as specified in
  1355. * dir-spec.txt. */
  1356. char signed_descriptor_digest[DIGEST_LEN];
  1357. /** Identity digest of the router. */
  1358. char identity_digest[DIGEST_LEN];
  1359. /** Declared publication time of the descriptor. */
  1360. time_t published_on;
  1361. /** For routerdescs only: digest of the corresponding extrainfo. */
  1362. char extra_info_digest[DIGEST_LEN];
  1363. /** For routerdescs only: A SHA256-digest of the extrainfo (if any) */
  1364. char extra_info_digest256[DIGEST256_LEN];
  1365. /** Certificate for ed25519 signing key. */
  1366. struct tor_cert_st *signing_key_cert;
  1367. /** For routerdescs only: Status of downloading the corresponding
  1368. * extrainfo. */
  1369. download_status_t ei_dl_status;
  1370. /** Where is the descriptor saved? */
  1371. saved_location_t saved_location;
  1372. /** If saved_location is SAVED_IN_CACHE or SAVED_IN_JOURNAL, the offset of
  1373. * this descriptor in the corresponding file. */
  1374. off_t saved_offset;
  1375. /** What position is this descriptor within routerlist->routers or
  1376. * routerlist->old_routers? -1 for none. */
  1377. int routerlist_index;
  1378. /** The valid-until time of the most recent consensus that listed this
  1379. * descriptor. 0 for "never listed in a consensus, so far as we know." */
  1380. time_t last_listed_as_valid_until;
  1381. /* If true, we do not ever try to save this object in the cache. */
  1382. unsigned int do_not_cache : 1;
  1383. /* If true, this item is meant to represent an extrainfo. */
  1384. unsigned int is_extrainfo : 1;
  1385. /* If true, we got an extrainfo for this item, and the digest was right,
  1386. * but it was incompatible. */
  1387. unsigned int extrainfo_is_bogus : 1;
  1388. /* If true, we are willing to transmit this item unencrypted. */
  1389. unsigned int send_unencrypted : 1;
  1390. } signed_descriptor_t;
  1391. /** A signed integer representing a country code. */
  1392. typedef int16_t country_t;
  1393. /** Flags used to summarize the declared protocol versions of a relay,
  1394. * so we don't need to parse them again and again. */
  1395. typedef struct protover_summary_flags_t {
  1396. /** True iff we have a proto line for this router, or a versions line
  1397. * from which we could infer the protocols. */
  1398. unsigned int protocols_known:1;
  1399. /** True iff this router has a version or protocol list that allows it to
  1400. * accept EXTEND2 cells. This requires Relay=2. */
  1401. unsigned int supports_extend2_cells:1;
  1402. /** True iff this router has a protocol list that allows it to negotiate
  1403. * ed25519 identity keys on a link handshake with us. This
  1404. * requires LinkAuth=3. */
  1405. unsigned int supports_ed25519_link_handshake_compat:1;
  1406. /** True iff this router has a protocol list that allows it to negotiate
  1407. * ed25519 identity keys on a link handshake, at all. This requires some
  1408. * LinkAuth=X for X >= 3. */
  1409. unsigned int supports_ed25519_link_handshake_any:1;
  1410. /** True iff this router has a protocol list that allows it to be an
  1411. * introduction point supporting ed25519 authentication key which is part of
  1412. * the v3 protocol detailed in proposal 224. This requires HSIntro=4. */
  1413. unsigned int supports_ed25519_hs_intro : 1;
  1414. /** True iff this router has a protocol list that allows it to be an hidden
  1415. * service directory supporting version 3 as seen in proposal 224. This
  1416. * requires HSDir=2. */
  1417. unsigned int supports_v3_hsdir : 1;
  1418. /** True iff this router has a protocol list that allows it to be an hidden
  1419. * service rendezvous point supporting version 3 as seen in proposal 224.
  1420. * This requires HSRend=2. */
  1421. unsigned int supports_v3_rendezvous_point: 1;
  1422. } protover_summary_flags_t;
  1423. /** Information about another onion router in the network. */
  1424. typedef struct {
  1425. signed_descriptor_t cache_info;
  1426. char *nickname; /**< Human-readable OR name. */
  1427. uint32_t addr; /**< IPv4 address of OR, in host order. */
  1428. uint16_t or_port; /**< Port for TLS connections. */
  1429. uint16_t dir_port; /**< Port for HTTP directory connections. */
  1430. /** A router's IPv6 address, if it has one. */
  1431. /* XXXXX187 Actually these should probably be part of a list of addresses,
  1432. * not just a special case. Use abstractions to access these; don't do it
  1433. * directly. */
  1434. tor_addr_t ipv6_addr;
  1435. uint16_t ipv6_orport;
  1436. crypto_pk_t *onion_pkey; /**< Public RSA key for onions. */
  1437. crypto_pk_t *identity_pkey; /**< Public RSA key for signing. */
  1438. /** Public curve25519 key for onions */
  1439. curve25519_public_key_t *onion_curve25519_pkey;
  1440. /** What's the earliest expiration time on all the certs in this
  1441. * routerinfo? */
  1442. time_t cert_expiration_time;
  1443. char *platform; /**< What software/operating system is this OR using? */
  1444. char *protocol_list; /**< Encoded list of subprotocol versions supported
  1445. * by this OR */
  1446. /* link info */
  1447. uint32_t bandwidthrate; /**< How many bytes does this OR add to its token
  1448. * bucket per second? */
  1449. uint32_t bandwidthburst; /**< How large is this OR's token bucket? */
  1450. /** How many bytes/s is this router known to handle? */
  1451. uint32_t bandwidthcapacity;
  1452. smartlist_t *exit_policy; /**< What streams will this OR permit
  1453. * to exit on IPv4? NULL for 'reject *:*'. */
  1454. /** What streams will this OR permit to exit on IPv6?
  1455. * NULL for 'reject *:*' */
  1456. struct short_policy_t *ipv6_exit_policy;
  1457. long uptime; /**< How many seconds the router claims to have been up */
  1458. smartlist_t *declared_family; /**< Nicknames of router which this router
  1459. * claims are its family. */
  1460. char *contact_info; /**< Declared contact info for this router. */
  1461. unsigned int is_hibernating:1; /**< Whether the router claims to be
  1462. * hibernating */
  1463. unsigned int caches_extra_info:1; /**< Whether the router says it caches and
  1464. * serves extrainfo documents. */
  1465. unsigned int allow_single_hop_exits:1; /**< Whether the router says
  1466. * it allows single hop exits. */
  1467. unsigned int wants_to_be_hs_dir:1; /**< True iff this router claims to be
  1468. * a hidden service directory. */
  1469. unsigned int policy_is_reject_star:1; /**< True iff the exit policy for this
  1470. * router rejects everything. */
  1471. /** True if, after we have added this router, we should re-launch
  1472. * tests for it. */
  1473. unsigned int needs_retest_if_added:1;
  1474. /** True iff this router included "tunnelled-dir-server" in its descriptor,
  1475. * implying it accepts tunnelled directory requests, or it advertised
  1476. * dir_port > 0. */
  1477. unsigned int supports_tunnelled_dir_requests:1;
  1478. /** Used during voting to indicate that we should not include an entry for
  1479. * this routerinfo. Used only during voting. */
  1480. unsigned int omit_from_vote:1;
  1481. /** Flags to summarize the protocol versions for this routerinfo_t. */
  1482. protover_summary_flags_t pv;
  1483. /** Tor can use this router for general positions in circuits; we got it
  1484. * from a directory server as usual, or we're an authority and a server
  1485. * uploaded it. */
  1486. #define ROUTER_PURPOSE_GENERAL 0
  1487. /** Tor should avoid using this router for circuit-building: we got it
  1488. * from a controller. If the controller wants to use it, it'll have to
  1489. * ask for it by identity. */
  1490. #define ROUTER_PURPOSE_CONTROLLER 1
  1491. /** Tor should use this router only for bridge positions in circuits: we got
  1492. * it via a directory request from the bridge itself, or a bridge
  1493. * authority. */
  1494. #define ROUTER_PURPOSE_BRIDGE 2
  1495. /** Tor should not use this router; it was marked in cached-descriptors with
  1496. * a purpose we didn't recognize. */
  1497. #define ROUTER_PURPOSE_UNKNOWN 255
  1498. /** In what way did we find out about this router? One of ROUTER_PURPOSE_*.
  1499. * Routers of different purposes are kept segregated and used for different
  1500. * things; see notes on ROUTER_PURPOSE_* macros above.
  1501. */
  1502. uint8_t purpose;
  1503. } routerinfo_t;
  1504. /** Information needed to keep and cache a signed extra-info document. */
  1505. typedef struct extrainfo_t {
  1506. signed_descriptor_t cache_info;
  1507. /** SHA256 digest of this document */
  1508. uint8_t digest256[DIGEST256_LEN];
  1509. /** The router's nickname. */
  1510. char nickname[MAX_NICKNAME_LEN+1];
  1511. /** True iff we found the right key for this extra-info, verified the
  1512. * signature, and found it to be bad. */
  1513. unsigned int bad_sig : 1;
  1514. /** If present, we didn't have the right key to verify this extra-info,
  1515. * so this is a copy of the signature in the document. */
  1516. char *pending_sig;
  1517. /** Length of pending_sig. */
  1518. size_t pending_sig_len;
  1519. } extrainfo_t;
  1520. /** Contents of a single router entry in a network status object.
  1521. */
  1522. typedef struct routerstatus_t {
  1523. time_t published_on; /**< When was this router published? */
  1524. char nickname[MAX_NICKNAME_LEN+1]; /**< The nickname this router says it
  1525. * has. */
  1526. char identity_digest[DIGEST_LEN]; /**< Digest of the router's identity
  1527. * key. */
  1528. /** Digest of the router's most recent descriptor or microdescriptor.
  1529. * If it's a descriptor, we only use the first DIGEST_LEN bytes. */
  1530. char descriptor_digest[DIGEST256_LEN];
  1531. uint32_t addr; /**< IPv4 address for this router, in host order. */
  1532. uint16_t or_port; /**< IPv4 OR port for this router. */
  1533. uint16_t dir_port; /**< Directory port for this router. */
  1534. tor_addr_t ipv6_addr; /**< IPv6 address for this router. */
  1535. uint16_t ipv6_orport; /**< IPv6 OR port for this router. */
  1536. unsigned int is_authority:1; /**< True iff this router is an authority. */
  1537. unsigned int is_exit:1; /**< True iff this router is a good exit. */
  1538. unsigned int is_stable:1; /**< True iff this router stays up a long time. */
  1539. unsigned int is_fast:1; /**< True iff this router has good bandwidth. */
  1540. /** True iff this router is called 'running' in the consensus. We give it
  1541. * this funny name so that we don't accidentally use this bit as a view of
  1542. * whether we think the router is *currently* running. If that's what you
  1543. * want to know, look at is_running in node_t. */
  1544. unsigned int is_flagged_running:1;
  1545. unsigned int is_named:1; /**< True iff "nickname" belongs to this router. */
  1546. unsigned int is_unnamed:1; /**< True iff "nickname" belongs to another
  1547. * router. */
  1548. unsigned int is_valid:1; /**< True iff this router isn't invalid. */
  1549. unsigned int is_possible_guard:1; /**< True iff this router would be a good
  1550. * choice as an entry guard. */
  1551. unsigned int is_bad_exit:1; /**< True iff this node is a bad choice for
  1552. * an exit node. */
  1553. unsigned int is_hs_dir:1; /**< True iff this router is a v2-or-later hidden
  1554. * service directory. */
  1555. unsigned int is_v2_dir:1; /** True iff this router publishes an open DirPort
  1556. * or it claims to accept tunnelled dir requests.
  1557. */
  1558. unsigned int has_bandwidth:1; /**< The vote/consensus had bw info */
  1559. unsigned int has_exitsummary:1; /**< The vote/consensus had exit summaries */
  1560. unsigned int bw_is_unmeasured:1; /**< This is a consensus entry, with
  1561. * the Unmeasured flag set. */
  1562. /** Flags to summarize the protocol versions for this routerstatus_t. */
  1563. protover_summary_flags_t pv;
  1564. uint32_t bandwidth_kb; /**< Bandwidth (capacity) of the router as reported in
  1565. * the vote/consensus, in kilobytes/sec. */
  1566. /** The consensus has guardfraction information for this router. */
  1567. unsigned int has_guardfraction:1;
  1568. /** The guardfraction value of this router. */
  1569. uint32_t guardfraction_percentage;
  1570. char *exitsummary; /**< exit policy summary -
  1571. * XXX weasel: this probably should not stay a string. */
  1572. /* ---- The fields below aren't derived from the networkstatus; they
  1573. * hold local information only. */
  1574. time_t last_dir_503_at; /**< When did this router last tell us that it
  1575. * was too busy to serve directory info? */
  1576. download_status_t dl_status;
  1577. } routerstatus_t;
  1578. /** A single entry in a parsed policy summary, describing a range of ports. */
  1579. typedef struct short_policy_entry_t {
  1580. uint16_t min_port, max_port;
  1581. } short_policy_entry_t;
  1582. /** A short_poliy_t is the parsed version of a policy summary. */
  1583. typedef struct short_policy_t {
  1584. /** True if the members of 'entries' are port ranges to accept; false if
  1585. * they are port ranges to reject */
  1586. unsigned int is_accept : 1;
  1587. /** The actual number of values in 'entries'. */
  1588. unsigned int n_entries : 31;
  1589. /** An array of 0 or more short_policy_entry_t values, each describing a
  1590. * range of ports that this policy accepts or rejects (depending on the
  1591. * value of is_accept).
  1592. */
  1593. short_policy_entry_t entries[FLEXIBLE_ARRAY_MEMBER];
  1594. } short_policy_t;
  1595. /** A microdescriptor is the smallest amount of information needed to build a
  1596. * circuit through a router. They are generated by the directory authorities,
  1597. * using information from the uploaded routerinfo documents. They are not
  1598. * self-signed, but are rather authenticated by having their hash in a signed
  1599. * networkstatus document. */
  1600. typedef struct microdesc_t {
  1601. /** Hashtable node, used to look up the microdesc by its digest. */
  1602. HT_ENTRY(microdesc_t) node;
  1603. /* Cache information */
  1604. /** When was this microdescriptor last listed in a consensus document?
  1605. * Once a microdesc has been unlisted long enough, we can drop it.
  1606. */
  1607. time_t last_listed;
  1608. /** Where is this microdescriptor currently stored? */
  1609. saved_location_bitfield_t saved_location : 3;
  1610. /** If true, do not attempt to cache this microdescriptor on disk. */
  1611. unsigned int no_save : 1;
  1612. /** If true, this microdesc has an entry in the microdesc_map */
  1613. unsigned int held_in_map : 1;
  1614. /** Reference count: how many node_ts have a reference to this microdesc? */
  1615. unsigned int held_by_nodes;
  1616. /** If saved_location == SAVED_IN_CACHE, this field holds the offset of the
  1617. * microdescriptor in the cache. */
  1618. off_t off;
  1619. /* The string containing the microdesc. */
  1620. /** A pointer to the encoded body of the microdescriptor. If the
  1621. * saved_location is SAVED_IN_CACHE, then the body is a pointer into an
  1622. * mmap'd region. Otherwise, it is a malloc'd string. The string might not
  1623. * be NUL-terminated; take the length from <b>bodylen</b>. */
  1624. char *body;
  1625. /** The length of the microdescriptor in <b>body</b>. */
  1626. size_t bodylen;
  1627. /** A SHA256-digest of the microdescriptor. */
  1628. char digest[DIGEST256_LEN];
  1629. /* Fields in the microdescriptor. */
  1630. /** As routerinfo_t.onion_pkey */
  1631. crypto_pk_t *onion_pkey;
  1632. /** As routerinfo_t.onion_curve25519_pkey */
  1633. curve25519_public_key_t *onion_curve25519_pkey;
  1634. /** Ed25519 identity key, if included. */
  1635. ed25519_public_key_t *ed25519_identity_pkey;
  1636. /** As routerinfo_t.ipv6_addr */
  1637. tor_addr_t ipv6_addr;
  1638. /** As routerinfo_t.ipv6_orport */
  1639. uint16_t ipv6_orport;
  1640. /** As routerinfo_t.family */
  1641. smartlist_t *family;
  1642. /** IPv4 exit policy summary */
  1643. short_policy_t *exit_policy;
  1644. /** IPv6 exit policy summary */
  1645. short_policy_t *ipv6_exit_policy;
  1646. } microdesc_t;
  1647. /** A node_t represents a Tor router.
  1648. *
  1649. * Specifically, a node_t is a Tor router as we are using it: a router that
  1650. * we are considering for circuits, connections, and so on. A node_t is a
  1651. * thin wrapper around the routerstatus, routerinfo, and microdesc for a
  1652. * single router, and provides a consistent interface for all of them.
  1653. *
  1654. * Also, a node_t has mutable state. While a routerinfo, a routerstatus,
  1655. * and a microdesc have[*] only the information read from a router
  1656. * descriptor, a consensus entry, and a microdescriptor (respectively)...
  1657. * a node_t has flags based on *our own current opinion* of the node.
  1658. *
  1659. * [*] Actually, there is some leftover information in each that is mutable.
  1660. * We should try to excise that.
  1661. */
  1662. typedef struct node_t {
  1663. /* Indexing information */
  1664. /** Used to look up the node_t by its identity digest. */
  1665. HT_ENTRY(node_t) ht_ent;
  1666. /** Used to look up the node_t by its ed25519 identity digest. */
  1667. HT_ENTRY(node_t) ed_ht_ent;
  1668. /** Position of the node within the list of nodes */
  1669. int nodelist_idx;
  1670. /** The identity digest of this node_t. No more than one node_t per
  1671. * identity may exist at a time. */
  1672. char identity[DIGEST_LEN];
  1673. /** The ed25519 identity of this node_t. This field is nonzero iff we
  1674. * currently have an ed25519 identity for this node in either md or ri,
  1675. * _and_ this node has been inserted to the ed25519-to-node map in the
  1676. * nodelist.
  1677. */
  1678. ed25519_public_key_t ed25519_id;
  1679. microdesc_t *md;
  1680. routerinfo_t *ri;
  1681. routerstatus_t *rs;
  1682. /* local info: copied from routerstatus, then possibly frobbed based
  1683. * on experience. Authorities set this stuff directly. Note that
  1684. * these reflect knowledge of the primary (IPv4) OR port only. */
  1685. unsigned int is_running:1; /**< As far as we know, is this OR currently
  1686. * running? */
  1687. unsigned int is_valid:1; /**< Has a trusted dirserver validated this OR?
  1688. * (For Authdir: Have we validated this OR?) */
  1689. unsigned int is_fast:1; /** Do we think this is a fast OR? */
  1690. unsigned int is_stable:1; /** Do we think this is a stable OR? */
  1691. unsigned int is_possible_guard:1; /**< Do we think this is an OK guard? */
  1692. unsigned int is_exit:1; /**< Do we think this is an OK exit? */
  1693. unsigned int is_bad_exit:1; /**< Do we think this exit is censored, borked,
  1694. * or otherwise nasty? */
  1695. unsigned int is_hs_dir:1; /**< True iff this router is a hidden service
  1696. * directory according to the authorities. */
  1697. /* Local info: warning state. */
  1698. unsigned int name_lookup_warned:1; /**< Have we warned the user for referring
  1699. * to this (unnamed) router by nickname?
  1700. */
  1701. /** Local info: we treat this node as if it rejects everything */
  1702. unsigned int rejects_all:1;
  1703. /* Local info: derived. */
  1704. /** True if the IPv6 OR port is preferred over the IPv4 OR port.
  1705. * XX/teor - can this become out of date if the torrc changes? */
  1706. unsigned int ipv6_preferred:1;
  1707. /** According to the geoip db what country is this router in? */
  1708. /* XXXprop186 what is this suppose to mean with multiple OR ports? */
  1709. country_t country;
  1710. /* The below items are used only by authdirservers for
  1711. * reachability testing. */
  1712. /** When was the last time we could reach this OR? */
  1713. time_t last_reachable; /* IPv4. */
  1714. time_t last_reachable6; /* IPv6. */
  1715. /* Hidden service directory index data. This is used by a service or client
  1716. * in order to know what's the hs directory index for this node at the time
  1717. * the consensus is set. */
  1718. struct hsdir_index_t hsdir_index;
  1719. } node_t;
  1720. /** Linked list of microdesc hash lines for a single router in a directory
  1721. * vote.
  1722. */
  1723. typedef struct vote_microdesc_hash_t {
  1724. /** Next element in the list, or NULL. */
  1725. struct vote_microdesc_hash_t *next;
  1726. /** The raw contents of the microdesc hash line, from the "m" through the
  1727. * newline. */
  1728. char *microdesc_hash_line;
  1729. } vote_microdesc_hash_t;
  1730. /** The claim about a single router, made in a vote. */
  1731. typedef struct vote_routerstatus_t {
  1732. routerstatus_t status; /**< Underlying 'status' object for this router.
  1733. * Flags are redundant. */
  1734. /** How many known-flags are allowed in a vote? This is the width of
  1735. * the flags field of vote_routerstatus_t */
  1736. #define MAX_KNOWN_FLAGS_IN_VOTE 64
  1737. uint64_t flags; /**< Bit-field for all recognized flags; index into
  1738. * networkstatus_t.known_flags. */
  1739. char *version; /**< The version that the authority says this router is
  1740. * running. */
  1741. char *protocols; /**< The protocols that this authority says this router
  1742. * provides. */
  1743. unsigned int has_measured_bw:1; /**< The vote had a measured bw */
  1744. /** True iff the vote included an entry for ed25519 ID, or included
  1745. * "id ed25519 none" to indicate that there was no ed25519 ID. */
  1746. unsigned int has_ed25519_listing:1;
  1747. /** True if the Ed25519 listing here is the consensus-opinion for the
  1748. * Ed25519 listing; false if there was no consensus on Ed25519 key status,
  1749. * or if this VRS doesn't reflect it. */
  1750. unsigned int ed25519_reflects_consensus:1;
  1751. uint32_t measured_bw_kb; /**< Measured bandwidth (capacity) of the router */
  1752. /** The hash or hashes that the authority claims this microdesc has. */
  1753. vote_microdesc_hash_t *microdesc;
  1754. /** Ed25519 identity for this router, or zero if it has none. */
  1755. uint8_t ed25519_id[ED25519_PUBKEY_LEN];
  1756. } vote_routerstatus_t;
  1757. /** A signature of some document by an authority. */
  1758. typedef struct document_signature_t {
  1759. /** Declared SHA-1 digest of this voter's identity key */
  1760. char identity_digest[DIGEST_LEN];
  1761. /** Declared SHA-1 digest of signing key used by this voter. */
  1762. char signing_key_digest[DIGEST_LEN];
  1763. /** Algorithm used to compute the digest of the document. */
  1764. digest_algorithm_t alg;
  1765. /** Signature of the signed thing. */
  1766. char *signature;
  1767. /** Length of <b>signature</b> */
  1768. int signature_len;
  1769. unsigned int bad_signature : 1; /**< Set to true if we've tried to verify
  1770. * the sig, and we know it's bad. */
  1771. unsigned int good_signature : 1; /**< Set to true if we've verified the sig
  1772. * as good. */
  1773. } document_signature_t;
  1774. /** Information about a single voter in a vote or a consensus. */
  1775. typedef struct networkstatus_voter_info_t {
  1776. /** Declared SHA-1 digest of this voter's identity key */
  1777. char identity_digest[DIGEST_LEN];
  1778. char *nickname; /**< Nickname of this voter */
  1779. /** Digest of this voter's "legacy" identity key, if any. In vote only; for
  1780. * consensuses, we treat legacy keys as additional signers. */
  1781. char legacy_id_digest[DIGEST_LEN];
  1782. char *address; /**< Address of this voter, in string format. */
  1783. uint32_t addr; /**< Address of this voter, in IPv4, in host order. */
  1784. uint16_t dir_port; /**< Directory port of this voter */
  1785. uint16_t or_port; /**< OR port of this voter */
  1786. char *contact; /**< Contact information for this voter. */
  1787. char vote_digest[DIGEST_LEN]; /**< Digest of this voter's vote, as signed. */
  1788. /* Nothing from here on is signed. */
  1789. /** The signature of the document and the signature's status. */
  1790. smartlist_t *sigs;
  1791. } networkstatus_voter_info_t;
  1792. typedef struct networkstatus_sr_info_t {
  1793. /* Indicate if the dirauth partitipates in the SR protocol with its vote.
  1794. * This is tied to the SR flag in the vote. */
  1795. unsigned int participate:1;
  1796. /* Both vote and consensus: Current and previous SRV. If list is empty,
  1797. * this means none were found in either the consensus or vote. */
  1798. struct sr_srv_t *previous_srv;
  1799. struct sr_srv_t *current_srv;
  1800. /* Vote only: List of commitments. */
  1801. smartlist_t *commits;
  1802. } networkstatus_sr_info_t;
  1803. /** Enumerates the possible seriousness values of a networkstatus document. */
  1804. typedef enum {
  1805. NS_TYPE_VOTE,
  1806. NS_TYPE_CONSENSUS,
  1807. NS_TYPE_OPINION,
  1808. } networkstatus_type_t;
  1809. /** Enumerates recognized flavors of a consensus networkstatus document. All
  1810. * flavors of a consensus are generated from the same set of votes, but they
  1811. * present different types information to different versions of Tor. */
  1812. typedef enum {
  1813. FLAV_NS = 0,
  1814. FLAV_MICRODESC = 1,
  1815. } consensus_flavor_t;
  1816. /** How many different consensus flavors are there? */
  1817. #define N_CONSENSUS_FLAVORS ((int)(FLAV_MICRODESC)+1)
  1818. /** A common structure to hold a v3 network status vote, or a v3 network
  1819. * status consensus. */
  1820. typedef struct networkstatus_t {
  1821. networkstatus_type_t type; /**< Vote, consensus, or opinion? */
  1822. consensus_flavor_t flavor; /**< If a consensus, what kind? */
  1823. unsigned int has_measured_bws : 1;/**< True iff this networkstatus contains
  1824. * measured= bandwidth values. */
  1825. time_t published; /**< Vote only: Time when vote was written. */
  1826. time_t valid_after; /**< Time after which this vote or consensus applies. */
  1827. time_t fresh_until; /**< Time before which this is the most recent vote or
  1828. * consensus. */
  1829. time_t valid_until; /**< Time after which this vote or consensus should not
  1830. * be used. */
  1831. /** Consensus only: what method was used to produce this consensus? */
  1832. int consensus_method;
  1833. /** Vote only: what methods is this voter willing to use? */
  1834. smartlist_t *supported_methods;
  1835. /** List of 'package' lines describing hashes of downloadable packages */
  1836. smartlist_t *package_lines;
  1837. /** How long does this vote/consensus claim that authorities take to
  1838. * distribute their votes to one another? */
  1839. int vote_seconds;
  1840. /** How long does this vote/consensus claim that authorities take to
  1841. * distribute their consensus signatures to one another? */
  1842. int dist_seconds;
  1843. /** Comma-separated list of recommended client software, or NULL if this
  1844. * voter has no opinion. */
  1845. char *client_versions;
  1846. char *server_versions;
  1847. /** Lists of subprotocol versions which are _recommended_ for relays and
  1848. * clients, or which are _require_ for relays and clients. Tor shouldn't
  1849. * make any more network connections if a required protocol is missing.
  1850. */
  1851. char *recommended_relay_protocols;
  1852. char *recommended_client_protocols;
  1853. char *required_relay_protocols;
  1854. char *required_client_protocols;
  1855. /** List of flags that this vote/consensus applies to routers. If a flag is
  1856. * not listed here, the voter has no opinion on what its value should be. */
  1857. smartlist_t *known_flags;
  1858. /** List of key=value strings for the parameters in this vote or
  1859. * consensus, sorted by key. */
  1860. smartlist_t *net_params;
  1861. /** List of key=value strings for the bw weight parameters in the
  1862. * consensus. */
  1863. smartlist_t *weight_params;
  1864. /** List of networkstatus_voter_info_t. For a vote, only one element
  1865. * is included. For a consensus, one element is included for every voter
  1866. * whose vote contributed to the consensus. */
  1867. smartlist_t *voters;
  1868. struct authority_cert_t *cert; /**< Vote only: the voter's certificate. */
  1869. /** Digests of this document, as signed. */
  1870. common_digests_t digests;
  1871. /** A SHA3-256 digest of the document, not including signatures: used for
  1872. * consensus diffs */
  1873. uint8_t digest_sha3_as_signed[DIGEST256_LEN];
  1874. /** List of router statuses, sorted by identity digest. For a vote,
  1875. * the elements are vote_routerstatus_t; for a consensus, the elements
  1876. * are routerstatus_t. */
  1877. smartlist_t *routerstatus_list;
  1878. /** If present, a map from descriptor digest to elements of
  1879. * routerstatus_list. */
  1880. digestmap_t *desc_digest_map;
  1881. /** Contains the shared random protocol data from a vote or consensus. */
  1882. networkstatus_sr_info_t sr_info;
  1883. } networkstatus_t;
  1884. /** A set of signatures for a networkstatus consensus. Unless otherwise
  1885. * noted, all fields are as for networkstatus_t. */
  1886. typedef struct ns_detached_signatures_t {
  1887. time_t valid_after;
  1888. time_t fresh_until;
  1889. time_t valid_until;
  1890. strmap_t *digests; /**< Map from flavor name to digestset_t */
  1891. strmap_t *signatures; /**< Map from flavor name to list of
  1892. * document_signature_t */
  1893. } ns_detached_signatures_t;
  1894. /** Allowable types of desc_store_t. */
  1895. typedef enum store_type_t {
  1896. ROUTER_STORE = 0,
  1897. EXTRAINFO_STORE = 1
  1898. } store_type_t;
  1899. /** A 'store' is a set of descriptors saved on disk, with accompanying
  1900. * journal, mmaped as needed, rebuilt as needed. */
  1901. typedef struct desc_store_t {
  1902. /** Filename (within DataDir) for the store. We append .tmp to this
  1903. * filename for a temporary file when rebuilding the store, and .new to this
  1904. * filename for the journal. */
  1905. const char *fname_base;
  1906. /** Human-readable description of what this store contains. */
  1907. const char *description;
  1908. tor_mmap_t *mmap; /**< A mmap for the main file in the store. */
  1909. store_type_t type; /**< What's stored in this store? */
  1910. /** The size of the router log, in bytes. */
  1911. size_t journal_len;
  1912. /** The size of the router store, in bytes. */
  1913. size_t store_len;
  1914. /** Total bytes dropped since last rebuild: this is space currently
  1915. * used in the cache and the journal that could be freed by a rebuild. */
  1916. size_t bytes_dropped;
  1917. } desc_store_t;
  1918. /** Contents of a directory of onion routers. */
  1919. typedef struct {
  1920. /** Map from server identity digest to a member of routers. */
  1921. struct digest_ri_map_t *identity_map;
  1922. /** Map from server descriptor digest to a signed_descriptor_t from
  1923. * routers or old_routers. */
  1924. struct digest_sd_map_t *desc_digest_map;
  1925. /** Map from extra-info digest to an extrainfo_t. Only exists for
  1926. * routers in routers or old_routers. */
  1927. struct digest_ei_map_t *extra_info_map;
  1928. /** Map from extra-info digests to a signed_descriptor_t for a router
  1929. * descriptor having that extra-info digest. Only exists for
  1930. * routers in routers or old_routers. */
  1931. struct digest_sd_map_t *desc_by_eid_map;
  1932. /** List of routerinfo_t for all currently live routers we know. */
  1933. smartlist_t *routers;
  1934. /** List of signed_descriptor_t for older router descriptors we're
  1935. * caching. */
  1936. smartlist_t *old_routers;
  1937. /** Store holding server descriptors. If present, any router whose
  1938. * cache_info.saved_location == SAVED_IN_CACHE is stored in this file
  1939. * starting at cache_info.saved_offset */
  1940. desc_store_t desc_store;
  1941. /** Store holding extra-info documents. */
  1942. desc_store_t extrainfo_store;
  1943. } routerlist_t;
  1944. /** Information on router used when extending a circuit. We don't need a
  1945. * full routerinfo_t to extend: we only need addr:port:keyid to build an OR
  1946. * connection, and onion_key to create the onionskin. Note that for onehop
  1947. * general-purpose tunnels, the onion_key is NULL. */
  1948. typedef struct extend_info_t {
  1949. char nickname[MAX_HEX_NICKNAME_LEN+1]; /**< This router's nickname for
  1950. * display. */
  1951. /** Hash of this router's RSA identity key. */
  1952. char identity_digest[DIGEST_LEN];
  1953. /** Ed25519 identity for this router, if any. */
  1954. ed25519_public_key_t ed_identity;
  1955. uint16_t port; /**< OR port. */
  1956. tor_addr_t addr; /**< IP address. */
  1957. crypto_pk_t *onion_key; /**< Current onionskin key. */
  1958. curve25519_public_key_t curve25519_onion_key;
  1959. } extend_info_t;
  1960. /** Certificate for v3 directory protocol: binds long-term authority identity
  1961. * keys to medium-term authority signing keys. */
  1962. typedef struct authority_cert_t {
  1963. /** Information relating to caching this cert on disk and looking it up. */
  1964. signed_descriptor_t cache_info;
  1965. /** This authority's long-term authority identity key. */
  1966. crypto_pk_t *identity_key;
  1967. /** This authority's medium-term signing key. */
  1968. crypto_pk_t *signing_key;
  1969. /** The digest of <b>signing_key</b> */
  1970. char signing_key_digest[DIGEST_LEN];
  1971. /** The listed expiration time of this certificate. */
  1972. time_t expires;
  1973. /** This authority's IPv4 address, in host order. */
  1974. uint32_t addr;
  1975. /** This authority's directory port. */
  1976. uint16_t dir_port;
  1977. } authority_cert_t;
  1978. /** Bitfield enum type listing types of information that directory authorities
  1979. * can be authoritative about, and that directory caches may or may not cache.
  1980. *
  1981. * Note that the granularity here is based on authority granularity and on
  1982. * cache capabilities. Thus, one particular bit may correspond in practice to
  1983. * a few types of directory info, so long as every authority that pronounces
  1984. * officially about one of the types prounounces officially about all of them,
  1985. * and so long as every cache that caches one of them caches all of them.
  1986. */
  1987. typedef enum {
  1988. NO_DIRINFO = 0,
  1989. /** Serves/signs v3 directory information: votes, consensuses, certs */
  1990. V3_DIRINFO = 1 << 2,
  1991. /** Serves bridge descriptors. */
  1992. BRIDGE_DIRINFO = 1 << 4,
  1993. /** Serves extrainfo documents. */
  1994. EXTRAINFO_DIRINFO=1 << 5,
  1995. /** Serves microdescriptors. */
  1996. MICRODESC_DIRINFO=1 << 6,
  1997. } dirinfo_type_t;
  1998. #define ALL_DIRINFO ((dirinfo_type_t)((1<<7)-1))
  1999. #define CRYPT_PATH_MAGIC 0x70127012u
  2000. struct fast_handshake_state_t;
  2001. struct ntor_handshake_state_t;
  2002. #define ONION_HANDSHAKE_TYPE_TAP 0x0000
  2003. #define ONION_HANDSHAKE_TYPE_FAST 0x0001
  2004. #define ONION_HANDSHAKE_TYPE_NTOR 0x0002
  2005. #define MAX_ONION_HANDSHAKE_TYPE 0x0002
  2006. typedef struct {
  2007. uint16_t tag;
  2008. union {
  2009. struct fast_handshake_state_t *fast;
  2010. crypto_dh_t *tap;
  2011. struct ntor_handshake_state_t *ntor;
  2012. } u;
  2013. } onion_handshake_state_t;
  2014. typedef struct relay_crypto_t relay_crypto_t;
  2015. typedef struct crypt_path_t crypt_path_t;
  2016. /** A reference-counted pointer to a crypt_path_t, used only to share
  2017. * the final rendezvous cpath to be used on a service-side rendezvous
  2018. * circuit among multiple circuits built in parallel to the same
  2019. * destination rendezvous point. */
  2020. typedef struct {
  2021. /** The reference count. */
  2022. unsigned int refcount;
  2023. /** The pointer. Set to NULL when the crypt_path_t is put into use
  2024. * on an opened rendezvous circuit. */
  2025. crypt_path_t *cpath;
  2026. } crypt_path_reference_t;
  2027. #define CPATH_KEY_MATERIAL_LEN (20*2+16*2)
  2028. #define DH_KEY_LEN DH_BYTES
  2029. /** Information used to build a circuit. */
  2030. typedef struct {
  2031. /** Intended length of the final circuit. */
  2032. int desired_path_len;
  2033. /** How to extend to the planned exit node. */
  2034. extend_info_t *chosen_exit;
  2035. /** Whether every node in the circ must have adequate uptime. */
  2036. unsigned int need_uptime : 1;
  2037. /** Whether every node in the circ must have adequate capacity. */
  2038. unsigned int need_capacity : 1;
  2039. /** Whether the last hop was picked with exiting in mind. */
  2040. unsigned int is_internal : 1;
  2041. /** Did we pick this as a one-hop tunnel (not safe for other streams)?
  2042. * These are for encrypted dir conns that exit to this router, not
  2043. * for arbitrary exits from the circuit. */
  2044. unsigned int onehop_tunnel : 1;
  2045. /** The crypt_path_t to append after rendezvous: used for rendezvous. */
  2046. crypt_path_t *pending_final_cpath;
  2047. /** A ref-counted reference to the crypt_path_t to append after
  2048. * rendezvous; used on the service side. */
  2049. crypt_path_reference_t *service_pending_final_cpath_ref;
  2050. /** How many times has building a circuit for this task failed? */
  2051. int failure_count;
  2052. /** At what time should we give up on this task? */
  2053. time_t expiry_time;
  2054. } cpath_build_state_t;
  2055. /** "magic" value for an origin_circuit_t */
  2056. #define ORIGIN_CIRCUIT_MAGIC 0x35315243u
  2057. /** "magic" value for an or_circuit_t */
  2058. #define OR_CIRCUIT_MAGIC 0x98ABC04Fu
  2059. /** "magic" value for a circuit that would have been freed by circuit_free,
  2060. * but which we're keeping around until a cpuworker reply arrives. See
  2061. * circuit_free() for more documentation. */
  2062. #define DEAD_CIRCUIT_MAGIC 0xdeadc14c
  2063. struct create_cell_t;
  2064. /** Entry in the cell stats list of a circuit; used only if CELL_STATS
  2065. * events are enabled. */
  2066. typedef struct testing_cell_stats_entry_t {
  2067. uint8_t command; /**< cell command number. */
  2068. /** Waiting time in centiseconds if this event is for a removed cell,
  2069. * or 0 if this event is for adding a cell to the queue. 22 bits can
  2070. * store more than 11 hours, enough to assume that a circuit with this
  2071. * delay would long have been closed. */
  2072. unsigned int waiting_time:22;
  2073. unsigned int removed:1; /**< 0 for added to, 1 for removed from queue. */
  2074. unsigned int exitward:1; /**< 0 for app-ward, 1 for exit-ward. */
  2075. } testing_cell_stats_entry_t;
  2076. typedef struct circuit_t circuit_t;
  2077. typedef struct origin_circuit_t origin_circuit_t;
  2078. typedef struct or_circuit_t or_circuit_t;
  2079. /** Largest number of relay_early cells that we can send on a given
  2080. * circuit. */
  2081. #define MAX_RELAY_EARLY_CELLS_PER_CIRCUIT 8
  2082. /**
  2083. * Describes the circuit building process in simplified terms based
  2084. * on the path bias accounting state for a circuit.
  2085. *
  2086. * NOTE: These state values are enumerated in the order for which we
  2087. * expect circuits to transition through them. If you add states,
  2088. * you need to preserve this overall ordering. The various pathbias
  2089. * state transition and accounting functions (pathbias_mark_* and
  2090. * pathbias_count_*) contain ordinal comparisons to enforce proper
  2091. * state transitions for corrections.
  2092. *
  2093. * This state machine and the associated logic was created to prevent
  2094. * miscounting due to unknown cases of circuit reuse. See also tickets
  2095. * #6475 and #7802.
  2096. */
  2097. typedef enum {
  2098. /** This circuit is "new". It has not yet completed a first hop
  2099. * or been counted by the path bias code. */
  2100. PATH_STATE_NEW_CIRC = 0,
  2101. /** This circuit has completed one/two hops, and has been counted by
  2102. * the path bias logic. */
  2103. PATH_STATE_BUILD_ATTEMPTED = 1,
  2104. /** This circuit has been completely built */
  2105. PATH_STATE_BUILD_SUCCEEDED = 2,
  2106. /** Did we try to attach any SOCKS streams or hidserv introductions to
  2107. * this circuit?
  2108. *
  2109. * Note: If we ever implement end-to-end stream timing through test
  2110. * stream probes (#5707), we must *not* set this for those probes
  2111. * (or any other automatic streams) because the adversary could
  2112. * just tag at a later point.
  2113. */
  2114. PATH_STATE_USE_ATTEMPTED = 3,
  2115. /** Did any SOCKS streams or hidserv introductions actually succeed on
  2116. * this circuit?
  2117. *
  2118. * If any streams detatch/fail from this circuit, the code transitions
  2119. * the circuit back to PATH_STATE_USE_ATTEMPTED to ensure we probe. See
  2120. * pathbias_mark_use_rollback() for that.
  2121. */
  2122. PATH_STATE_USE_SUCCEEDED = 4,
  2123. /**
  2124. * This is a special state to indicate that we got a corrupted
  2125. * relay cell on a circuit and we don't intend to probe it.
  2126. */
  2127. PATH_STATE_USE_FAILED = 5,
  2128. /**
  2129. * This is a special state to indicate that we already counted
  2130. * the circuit. Used to guard against potential state machine
  2131. * violations.
  2132. */
  2133. PATH_STATE_ALREADY_COUNTED = 6,
  2134. } path_state_t;
  2135. #define path_state_bitfield_t ENUM_BF(path_state_t)
  2136. #if REND_COOKIE_LEN != DIGEST_LEN
  2137. #error "The REND_TOKEN_LEN macro assumes REND_COOKIE_LEN == DIGEST_LEN"
  2138. #endif
  2139. #define REND_TOKEN_LEN DIGEST_LEN
  2140. /** Convert a circuit subtype to a circuit_t. */
  2141. #define TO_CIRCUIT(x) (&((x)->base_))
  2142. /** Return 1 iff <b>node</b> has Exit flag and no BadExit flag.
  2143. * Otherwise, return 0.
  2144. */
  2145. static inline int node_is_good_exit(const node_t *node)
  2146. {
  2147. return node->is_exit && ! node->is_bad_exit;
  2148. }
  2149. /* limits for TCP send and recv buffer size used for constrained sockets */
  2150. #define MIN_CONSTRAINED_TCP_BUFFER 2048
  2151. #define MAX_CONSTRAINED_TCP_BUFFER 262144 /* 256k */
  2152. /** @name Isolation flags
  2153. Ways to isolate client streams
  2154. @{
  2155. */
  2156. /** Isolate based on destination port */
  2157. #define ISO_DESTPORT (1u<<0)
  2158. /** Isolate based on destination address */
  2159. #define ISO_DESTADDR (1u<<1)
  2160. /** Isolate based on SOCKS authentication */
  2161. #define ISO_SOCKSAUTH (1u<<2)
  2162. /** Isolate based on client protocol choice */
  2163. #define ISO_CLIENTPROTO (1u<<3)
  2164. /** Isolate based on client address */
  2165. #define ISO_CLIENTADDR (1u<<4)
  2166. /** Isolate based on session group (always on). */
  2167. #define ISO_SESSIONGRP (1u<<5)
  2168. /** Isolate based on newnym epoch (always on). */
  2169. #define ISO_NYM_EPOCH (1u<<6)
  2170. /** Isolate all streams (Internal only). */
  2171. #define ISO_STREAM (1u<<7)
  2172. /**@}*/
  2173. /** Default isolation level for ports. */
  2174. #define ISO_DEFAULT (ISO_CLIENTADDR|ISO_SOCKSAUTH|ISO_SESSIONGRP|ISO_NYM_EPOCH)
  2175. /** Indicates that we haven't yet set a session group on a port_cfg_t. */
  2176. #define SESSION_GROUP_UNSET -1
  2177. /** Session group reserved for directory connections */
  2178. #define SESSION_GROUP_DIRCONN -2
  2179. /** Session group reserved for resolve requests launched by a controller */
  2180. #define SESSION_GROUP_CONTROL_RESOLVE -3
  2181. /** First automatically allocated session group number */
  2182. #define SESSION_GROUP_FIRST_AUTO -4
  2183. typedef struct port_cfg_t port_cfg_t;
  2184. typedef struct routerset_t routerset_t;
  2185. /** A magic value for the (Socks|OR|...)Port options below, telling Tor
  2186. * to pick its own port. */
  2187. #define CFG_AUTO_PORT 0xc4005e
  2188. /** Enumeration of outbound address configuration types:
  2189. * Exit-only, OR-only, or both */
  2190. typedef enum {OUTBOUND_ADDR_EXIT, OUTBOUND_ADDR_OR,
  2191. OUTBOUND_ADDR_EXIT_AND_OR,
  2192. OUTBOUND_ADDR_MAX} outbound_addr_t;
  2193. /** Configuration options for a Tor process. */
  2194. typedef struct {
  2195. uint32_t magic_;
  2196. /** What should the tor process actually do? */
  2197. enum {
  2198. CMD_RUN_TOR=0, CMD_LIST_FINGERPRINT, CMD_HASH_PASSWORD,
  2199. CMD_VERIFY_CONFIG, CMD_RUN_UNITTESTS, CMD_DUMP_CONFIG,
  2200. CMD_KEYGEN,
  2201. CMD_KEY_EXPIRATION,
  2202. } command;
  2203. char *command_arg; /**< Argument for command-line option. */
  2204. config_line_t *Logs; /**< New-style list of configuration lines
  2205. * for logs */
  2206. int LogTimeGranularity; /**< Log resolution in milliseconds. */
  2207. int LogMessageDomains; /**< Boolean: Should we log the domain(s) in which
  2208. * each log message occurs? */
  2209. int TruncateLogFile; /**< Boolean: Should we truncate the log file
  2210. before we start writing? */
  2211. char *SyslogIdentityTag; /**< Identity tag to add for syslog logging. */
  2212. char *AndroidIdentityTag; /**< Identity tag to add for Android logging. */
  2213. char *DebugLogFile; /**< Where to send verbose log messages. */
  2214. char *DataDirectory_option; /**< Where to store long-term data, as
  2215. * configured by the user. */
  2216. char *DataDirectory; /**< Where to store long-term data, as modified. */
  2217. int DataDirectoryGroupReadable; /**< Boolean: Is the DataDirectory g+r? */
  2218. char *KeyDirectory_option; /**< Where to store keys, as
  2219. * configured by the user. */
  2220. char *KeyDirectory; /**< Where to store keys data, as modified. */
  2221. int KeyDirectoryGroupReadable; /**< Boolean: Is the KeyDirectory g+r? */
  2222. char *CacheDirectory_option; /**< Where to store cached data, as
  2223. * configured by the user. */
  2224. char *CacheDirectory; /**< Where to store cached data, as modified. */
  2225. int CacheDirectoryGroupReadable; /**< Boolean: Is the CacheDirectory g+r? */
  2226. char *Nickname; /**< OR only: nickname of this onion router. */
  2227. char *Address; /**< OR only: configured address for this onion router. */
  2228. char *PidFile; /**< Where to store PID of Tor process. */
  2229. routerset_t *ExitNodes; /**< Structure containing nicknames, digests,
  2230. * country codes and IP address patterns of ORs to
  2231. * consider as exits. */
  2232. routerset_t *EntryNodes;/**< Structure containing nicknames, digests,
  2233. * country codes and IP address patterns of ORs to
  2234. * consider as entry points. */
  2235. int StrictNodes; /**< Boolean: When none of our EntryNodes or ExitNodes
  2236. * are up, or we need to access a node in ExcludeNodes,
  2237. * do we just fail instead? */
  2238. routerset_t *ExcludeNodes;/**< Structure containing nicknames, digests,
  2239. * country codes and IP address patterns of ORs
  2240. * not to use in circuits. But see StrictNodes
  2241. * above. */
  2242. routerset_t *ExcludeExitNodes;/**< Structure containing nicknames, digests,
  2243. * country codes and IP address patterns of
  2244. * ORs not to consider as exits. */
  2245. /** Union of ExcludeNodes and ExcludeExitNodes */
  2246. routerset_t *ExcludeExitNodesUnion_;
  2247. int DisableAllSwap; /**< Boolean: Attempt to call mlockall() on our
  2248. * process for all current and future memory. */
  2249. config_line_t *ExitPolicy; /**< Lists of exit policy components. */
  2250. int ExitPolicyRejectPrivate; /**< Should we not exit to reserved private
  2251. * addresses, and our own published addresses?
  2252. */
  2253. int ExitPolicyRejectLocalInterfaces; /**< Should we not exit to local
  2254. * interface addresses?
  2255. * Includes OutboundBindAddresses and
  2256. * configured ports. */
  2257. int ReducedExitPolicy; /**<Should we use the Reduced Exit Policy? */
  2258. config_line_t *SocksPolicy; /**< Lists of socks policy components */
  2259. config_line_t *DirPolicy; /**< Lists of dir policy components */
  2260. /** Local address to bind outbound sockets */
  2261. config_line_t *OutboundBindAddress;
  2262. /** Local address to bind outbound relay sockets */
  2263. config_line_t *OutboundBindAddressOR;
  2264. /** Local address to bind outbound exit sockets */
  2265. config_line_t *OutboundBindAddressExit;
  2266. /** Addresses derived from the various OutboundBindAddress lines.
  2267. * [][0] is IPv4, [][1] is IPv6
  2268. */
  2269. tor_addr_t OutboundBindAddresses[OUTBOUND_ADDR_MAX][2];
  2270. /** Directory server only: which versions of
  2271. * Tor should we tell users to run? */
  2272. config_line_t *RecommendedVersions;
  2273. config_line_t *RecommendedClientVersions;
  2274. config_line_t *RecommendedServerVersions;
  2275. config_line_t *RecommendedPackages;
  2276. /** Whether dirservers allow router descriptors with private IPs. */
  2277. int DirAllowPrivateAddresses;
  2278. /** Whether routers accept EXTEND cells to routers with private IPs. */
  2279. int ExtendAllowPrivateAddresses;
  2280. char *User; /**< Name of user to run Tor as. */
  2281. config_line_t *ORPort_lines; /**< Ports to listen on for OR connections. */
  2282. /** Ports to listen on for extended OR connections. */
  2283. config_line_t *ExtORPort_lines;
  2284. /** Ports to listen on for SOCKS connections. */
  2285. config_line_t *SocksPort_lines;
  2286. /** Ports to listen on for transparent pf/netfilter connections. */
  2287. config_line_t *TransPort_lines;
  2288. char *TransProxyType; /**< What kind of transparent proxy
  2289. * implementation are we using? */
  2290. /** Parsed value of TransProxyType. */
  2291. enum {
  2292. TPT_DEFAULT,
  2293. TPT_PF_DIVERT,
  2294. TPT_IPFW,
  2295. TPT_TPROXY,
  2296. } TransProxyType_parsed;
  2297. config_line_t *NATDPort_lines; /**< Ports to listen on for transparent natd
  2298. * connections. */
  2299. /** Ports to listen on for HTTP Tunnel connections. */
  2300. config_line_t *HTTPTunnelPort_lines;
  2301. config_line_t *ControlPort_lines; /**< Ports to listen on for control
  2302. * connections. */
  2303. config_line_t *ControlSocket; /**< List of Unix Domain Sockets to listen on
  2304. * for control connections. */
  2305. int ControlSocketsGroupWritable; /**< Boolean: Are control sockets g+rw? */
  2306. int UnixSocksGroupWritable; /**< Boolean: Are SOCKS Unix sockets g+rw? */
  2307. /** Ports to listen on for directory connections. */
  2308. config_line_t *DirPort_lines;
  2309. config_line_t *DNSPort_lines; /**< Ports to listen on for DNS requests. */
  2310. /* MaxMemInQueues value as input by the user. We clean this up to be
  2311. * MaxMemInQueues. */
  2312. uint64_t MaxMemInQueues_raw;
  2313. uint64_t MaxMemInQueues;/**< If we have more memory than this allocated
  2314. * for queues and buffers, run the OOM handler */
  2315. /** Above this value, consider ourselves low on RAM. */
  2316. uint64_t MaxMemInQueues_low_threshold;
  2317. /** @name port booleans
  2318. *
  2319. * Derived booleans: For server ports and ControlPort, true iff there is a
  2320. * non-listener port on an AF_INET or AF_INET6 address of the given type
  2321. * configured in one of the _lines options above.
  2322. * For client ports, also true if there is a unix socket configured.
  2323. * If you are checking for client ports, you may want to use:
  2324. * SocksPort_set || TransPort_set || NATDPort_set || DNSPort_set ||
  2325. * HTTPTunnelPort_set
  2326. * rather than SocksPort_set.
  2327. *
  2328. * @{
  2329. */
  2330. unsigned int ORPort_set : 1;
  2331. unsigned int SocksPort_set : 1;
  2332. unsigned int TransPort_set : 1;
  2333. unsigned int NATDPort_set : 1;
  2334. unsigned int ControlPort_set : 1;
  2335. unsigned int DirPort_set : 1;
  2336. unsigned int DNSPort_set : 1;
  2337. unsigned int ExtORPort_set : 1;
  2338. unsigned int HTTPTunnelPort_set : 1;
  2339. /**@}*/
  2340. int AssumeReachable; /**< Whether to publish our descriptor regardless. */
  2341. int AuthoritativeDir; /**< Boolean: is this an authoritative directory? */
  2342. int V3AuthoritativeDir; /**< Boolean: is this an authoritative directory
  2343. * for version 3 directories? */
  2344. int VersioningAuthoritativeDir; /**< Boolean: is this an authoritative
  2345. * directory that's willing to recommend
  2346. * versions? */
  2347. int BridgeAuthoritativeDir; /**< Boolean: is this an authoritative directory
  2348. * that aggregates bridge descriptors? */
  2349. /** If set on a bridge relay, it will include this value on a new
  2350. * "bridge-distribution-request" line in its bridge descriptor. */
  2351. char *BridgeDistribution;
  2352. /** If set on a bridge authority, it will answer requests on its dirport
  2353. * for bridge statuses -- but only if the requests use this password. */
  2354. char *BridgePassword;
  2355. /** If BridgePassword is set, this is a SHA256 digest of the basic http
  2356. * authenticator for it. Used so we can do a time-independent comparison. */
  2357. char *BridgePassword_AuthDigest_;
  2358. int UseBridges; /**< Boolean: should we start all circuits with a bridge? */
  2359. config_line_t *Bridges; /**< List of bootstrap bridge addresses. */
  2360. config_line_t *ClientTransportPlugin; /**< List of client
  2361. transport plugins. */
  2362. config_line_t *ServerTransportPlugin; /**< List of client
  2363. transport plugins. */
  2364. /** List of TCP/IP addresses that transports should listen at. */
  2365. config_line_t *ServerTransportListenAddr;
  2366. /** List of options that must be passed to pluggable transports. */
  2367. config_line_t *ServerTransportOptions;
  2368. int BridgeRelay; /**< Boolean: are we acting as a bridge relay? We make
  2369. * this explicit so we can change how we behave in the
  2370. * future. */
  2371. /** Boolean: if we know the bridge's digest, should we get new
  2372. * descriptors from the bridge authorities or from the bridge itself? */
  2373. int UpdateBridgesFromAuthority;
  2374. int AvoidDiskWrites; /**< Boolean: should we never cache things to disk?
  2375. * Not used yet. */
  2376. int ClientOnly; /**< Boolean: should we never evolve into a server role? */
  2377. int ReducedConnectionPadding; /**< Boolean: Should we try to keep connections
  2378. open shorter and pad them less against
  2379. connection-level traffic analysis? */
  2380. /** Autobool: if auto, then connection padding will be negotiated by client
  2381. * and server. If 0, it will be fully disabled. If 1, the client will still
  2382. * pad to the server regardless of server support. */
  2383. int ConnectionPadding;
  2384. /** To what authority types do we publish our descriptor? Choices are
  2385. * "v1", "v2", "v3", "bridge", or "". */
  2386. smartlist_t *PublishServerDescriptor;
  2387. /** A bitfield of authority types, derived from PublishServerDescriptor. */
  2388. dirinfo_type_t PublishServerDescriptor_;
  2389. /** Boolean: do we publish hidden service descriptors to the HS auths? */
  2390. int PublishHidServDescriptors;
  2391. int FetchServerDescriptors; /**< Do we fetch server descriptors as normal? */
  2392. int FetchHidServDescriptors; /**< and hidden service descriptors? */
  2393. int MinUptimeHidServDirectoryV2; /**< As directory authority, accept hidden
  2394. * service directories after what time? */
  2395. int FetchUselessDescriptors; /**< Do we fetch non-running descriptors too? */
  2396. int AllDirActionsPrivate; /**< Should every directory action be sent
  2397. * through a Tor circuit? */
  2398. /** Run in 'tor2web mode'? (I.e. only make client connections to hidden
  2399. * services, and use a single hop for all hidden-service-related
  2400. * circuits.) */
  2401. int Tor2webMode;
  2402. /** A routerset that should be used when picking RPs for HS circuits. */
  2403. routerset_t *Tor2webRendezvousPoints;
  2404. /** A routerset that should be used when picking middle nodes for HS
  2405. * circuits. */
  2406. routerset_t *HSLayer2Nodes;
  2407. /** A routerset that should be used when picking third-hop nodes for HS
  2408. * circuits. */
  2409. routerset_t *HSLayer3Nodes;
  2410. /** Onion Services in HiddenServiceSingleHopMode make one-hop (direct)
  2411. * circuits between the onion service server, and the introduction and
  2412. * rendezvous points. (Onion service descriptors are still posted using
  2413. * 3-hop paths, to avoid onion service directories blocking the service.)
  2414. * This option makes every hidden service instance hosted by
  2415. * this tor instance a Single Onion Service.
  2416. * HiddenServiceSingleHopMode requires HiddenServiceNonAnonymousMode to be
  2417. * set to 1.
  2418. * Use rend_service_allow_non_anonymous_connection() or
  2419. * rend_service_reveal_startup_time() instead of using this option directly.
  2420. */
  2421. int HiddenServiceSingleHopMode;
  2422. /* Makes hidden service clients and servers non-anonymous on this tor
  2423. * instance. Allows the non-anonymous HiddenServiceSingleHopMode. Enables
  2424. * non-anonymous behaviour in the hidden service protocol.
  2425. * Use rend_service_non_anonymous_mode_enabled() instead of using this option
  2426. * directly.
  2427. */
  2428. int HiddenServiceNonAnonymousMode;
  2429. int ConnLimit; /**< Demanded minimum number of simultaneous connections. */
  2430. int ConnLimit_; /**< Maximum allowed number of simultaneous connections. */
  2431. int ConnLimit_high_thresh; /**< start trying to lower socket usage if we
  2432. * have this many. */
  2433. int ConnLimit_low_thresh; /**< try to get down to here after socket
  2434. * exhaustion. */
  2435. int RunAsDaemon; /**< If true, run in the background. (Unix only) */
  2436. int FascistFirewall; /**< Whether to prefer ORs reachable on open ports. */
  2437. smartlist_t *FirewallPorts; /**< Which ports our firewall allows
  2438. * (strings). */
  2439. config_line_t *ReachableAddresses; /**< IP:ports our firewall allows. */
  2440. config_line_t *ReachableORAddresses; /**< IP:ports for OR conns. */
  2441. config_line_t *ReachableDirAddresses; /**< IP:ports for Dir conns. */
  2442. int ConstrainedSockets; /**< Shrink xmit and recv socket buffers. */
  2443. uint64_t ConstrainedSockSize; /**< Size of constrained buffers. */
  2444. /** Whether we should drop exit streams from Tors that we don't know are
  2445. * relays. One of "0" (never refuse), "1" (always refuse), or "-1" (do
  2446. * what the consensus says, defaulting to 'refuse' if the consensus says
  2447. * nothing). */
  2448. int RefuseUnknownExits;
  2449. /** Application ports that require all nodes in circ to have sufficient
  2450. * uptime. */
  2451. smartlist_t *LongLivedPorts;
  2452. /** Application ports that are likely to be unencrypted and
  2453. * unauthenticated; we reject requests for them to prevent the
  2454. * user from screwing up and leaking plaintext secrets to an
  2455. * observer somewhere on the Internet. */
  2456. smartlist_t *RejectPlaintextPorts;
  2457. /** Related to RejectPlaintextPorts above, except this config option
  2458. * controls whether we warn (in the log and via a controller status
  2459. * event) every time a risky connection is attempted. */
  2460. smartlist_t *WarnPlaintextPorts;
  2461. /** Should we try to reuse the same exit node for a given host */
  2462. smartlist_t *TrackHostExits;
  2463. int TrackHostExitsExpire; /**< Number of seconds until we expire an
  2464. * addressmap */
  2465. config_line_t *AddressMap; /**< List of address map directives. */
  2466. int AutomapHostsOnResolve; /**< If true, when we get a resolve request for a
  2467. * hostname ending with one of the suffixes in
  2468. * <b>AutomapHostsSuffixes</b>, map it to a
  2469. * virtual address. */
  2470. /** List of suffixes for <b>AutomapHostsOnResolve</b>. The special value
  2471. * "." means "match everything." */
  2472. smartlist_t *AutomapHostsSuffixes;
  2473. int RendPostPeriod; /**< How often do we post each rendezvous service
  2474. * descriptor? Remember to publish them independently. */
  2475. int KeepalivePeriod; /**< How often do we send padding cells to keep
  2476. * connections alive? */
  2477. int SocksTimeout; /**< How long do we let a socks connection wait
  2478. * unattached before we fail it? */
  2479. int LearnCircuitBuildTimeout; /**< If non-zero, we attempt to learn a value
  2480. * for CircuitBuildTimeout based on timeout
  2481. * history. Use circuit_build_times_disabled()
  2482. * rather than checking this value directly. */
  2483. int CircuitBuildTimeout; /**< Cull non-open circuits that were born at
  2484. * least this many seconds ago. Used until
  2485. * adaptive algorithm learns a new value. */
  2486. int CircuitsAvailableTimeout; /**< Try to have an open circuit for at
  2487. least this long after last activity */
  2488. int CircuitStreamTimeout; /**< If non-zero, detach streams from circuits
  2489. * and try a new circuit if the stream has been
  2490. * waiting for this many seconds. If zero, use
  2491. * our default internal timeout schedule. */
  2492. int MaxOnionQueueDelay; /*< DOCDOC */
  2493. int NewCircuitPeriod; /**< How long do we use a circuit before building
  2494. * a new one? */
  2495. int MaxCircuitDirtiness; /**< Never use circs that were first used more than
  2496. this interval ago. */
  2497. uint64_t BandwidthRate; /**< How much bandwidth, on average, are we willing
  2498. * to use in a second? */
  2499. uint64_t BandwidthBurst; /**< How much bandwidth, at maximum, are we willing
  2500. * to use in a second? */
  2501. uint64_t MaxAdvertisedBandwidth; /**< How much bandwidth are we willing to
  2502. * tell other nodes we have? */
  2503. uint64_t RelayBandwidthRate; /**< How much bandwidth, on average, are we
  2504. * willing to use for all relayed conns? */
  2505. uint64_t RelayBandwidthBurst; /**< How much bandwidth, at maximum, will we
  2506. * use in a second for all relayed conns? */
  2507. uint64_t PerConnBWRate; /**< Long-term bw on a single TLS conn, if set. */
  2508. uint64_t PerConnBWBurst; /**< Allowed burst on a single TLS conn, if set. */
  2509. int NumCPUs; /**< How many CPUs should we try to use? */
  2510. config_line_t *RendConfigLines; /**< List of configuration lines
  2511. * for rendezvous services. */
  2512. config_line_t *HidServAuth; /**< List of configuration lines for client-side
  2513. * authorizations for hidden services */
  2514. char *ContactInfo; /**< Contact info to be published in the directory. */
  2515. int HeartbeatPeriod; /**< Log heartbeat messages after this many seconds
  2516. * have passed. */
  2517. int MainloopStats; /**< Log main loop statistics as part of the
  2518. * heartbeat messages. */
  2519. char *HTTPProxy; /**< hostname[:port] to use as http proxy, if any. */
  2520. tor_addr_t HTTPProxyAddr; /**< Parsed IPv4 addr for http proxy, if any. */
  2521. uint16_t HTTPProxyPort; /**< Parsed port for http proxy, if any. */
  2522. char *HTTPProxyAuthenticator; /**< username:password string, if any. */
  2523. char *HTTPSProxy; /**< hostname[:port] to use as https proxy, if any. */
  2524. tor_addr_t HTTPSProxyAddr; /**< Parsed addr for https proxy, if any. */
  2525. uint16_t HTTPSProxyPort; /**< Parsed port for https proxy, if any. */
  2526. char *HTTPSProxyAuthenticator; /**< username:password string, if any. */
  2527. char *Socks4Proxy; /**< hostname:port to use as a SOCKS4 proxy, if any. */
  2528. tor_addr_t Socks4ProxyAddr; /**< Derived from Socks4Proxy. */
  2529. uint16_t Socks4ProxyPort; /**< Derived from Socks4Proxy. */
  2530. char *Socks5Proxy; /**< hostname:port to use as a SOCKS5 proxy, if any. */
  2531. tor_addr_t Socks5ProxyAddr; /**< Derived from Sock5Proxy. */
  2532. uint16_t Socks5ProxyPort; /**< Derived from Socks5Proxy. */
  2533. char *Socks5ProxyUsername; /**< Username for SOCKS5 authentication, if any */
  2534. char *Socks5ProxyPassword; /**< Password for SOCKS5 authentication, if any */
  2535. /** List of configuration lines for replacement directory authorities.
  2536. * If you just want to replace one class of authority at a time,
  2537. * use the "Alternate*Authority" options below instead. */
  2538. config_line_t *DirAuthorities;
  2539. /** List of fallback directory servers */
  2540. config_line_t *FallbackDir;
  2541. /** Whether to use the default hard-coded FallbackDirs */
  2542. int UseDefaultFallbackDirs;
  2543. /** Weight to apply to all directory authority rates if considering them
  2544. * along with fallbackdirs */
  2545. double DirAuthorityFallbackRate;
  2546. /** If set, use these main (currently v3) directory authorities and
  2547. * not the default ones. */
  2548. config_line_t *AlternateDirAuthority;
  2549. /** If set, use these bridge authorities and not the default one. */
  2550. config_line_t *AlternateBridgeAuthority;
  2551. config_line_t *MyFamily_lines; /**< Declared family for this OR. */
  2552. config_line_t *MyFamily; /**< Declared family for this OR, normalized */
  2553. config_line_t *NodeFamilies; /**< List of config lines for
  2554. * node families */
  2555. smartlist_t *NodeFamilySets; /**< List of parsed NodeFamilies values. */
  2556. config_line_t *AuthDirBadExit; /**< Address policy for descriptors to
  2557. * mark as bad exits. */
  2558. config_line_t *AuthDirReject; /**< Address policy for descriptors to
  2559. * reject. */
  2560. config_line_t *AuthDirInvalid; /**< Address policy for descriptors to
  2561. * never mark as valid. */
  2562. /** @name AuthDir...CC
  2563. *
  2564. * Lists of country codes to mark as BadExit, or Invalid, or to
  2565. * reject entirely.
  2566. *
  2567. * @{
  2568. */
  2569. smartlist_t *AuthDirBadExitCCs;
  2570. smartlist_t *AuthDirInvalidCCs;
  2571. smartlist_t *AuthDirRejectCCs;
  2572. /**@}*/
  2573. int AuthDirListBadExits; /**< True iff we should list bad exits,
  2574. * and vote for all other exits as good. */
  2575. int AuthDirMaxServersPerAddr; /**< Do not permit more than this
  2576. * number of servers per IP address. */
  2577. int AuthDirHasIPv6Connectivity; /**< Boolean: are we on IPv6? */
  2578. int AuthDirPinKeys; /**< Boolean: Do we enforce key-pinning? */
  2579. /** If non-zero, always vote the Fast flag for any relay advertising
  2580. * this amount of capacity or more. */
  2581. uint64_t AuthDirFastGuarantee;
  2582. /** If non-zero, this advertised capacity or more is always sufficient
  2583. * to satisfy the bandwidth requirement for the Guard flag. */
  2584. uint64_t AuthDirGuardBWGuarantee;
  2585. char *AccountingStart; /**< How long is the accounting interval, and when
  2586. * does it start? */
  2587. uint64_t AccountingMax; /**< How many bytes do we allow per accounting
  2588. * interval before hibernation? 0 for "never
  2589. * hibernate." */
  2590. /** How do we determine when our AccountingMax has been reached?
  2591. * "max" for when in or out reaches AccountingMax
  2592. * "sum" for when in plus out reaches AccountingMax
  2593. * "in" for when in reaches AccountingMax
  2594. * "out" for when out reaches AccountingMax */
  2595. char *AccountingRule_option;
  2596. enum { ACCT_MAX, ACCT_SUM, ACCT_IN, ACCT_OUT } AccountingRule;
  2597. /** Base64-encoded hash of accepted passwords for the control system. */
  2598. config_line_t *HashedControlPassword;
  2599. /** As HashedControlPassword, but not saved. */
  2600. config_line_t *HashedControlSessionPassword;
  2601. int CookieAuthentication; /**< Boolean: do we enable cookie-based auth for
  2602. * the control system? */
  2603. char *CookieAuthFile; /**< Filesystem location of a ControlPort
  2604. * authentication cookie. */
  2605. char *ExtORPortCookieAuthFile; /**< Filesystem location of Extended
  2606. * ORPort authentication cookie. */
  2607. int CookieAuthFileGroupReadable; /**< Boolean: Is the CookieAuthFile g+r? */
  2608. int ExtORPortCookieAuthFileGroupReadable; /**< Boolean: Is the
  2609. * ExtORPortCookieAuthFile g+r? */
  2610. int LeaveStreamsUnattached; /**< Boolean: Does Tor attach new streams to
  2611. * circuits itself (0), or does it expect a controller
  2612. * to cope? (1) */
  2613. int DisablePredictedCircuits; /**< Boolean: does Tor preemptively
  2614. * make circuits in the background (0),
  2615. * or not (1)? */
  2616. /** Process specifier for a controller that ‘owns’ this Tor
  2617. * instance. Tor will terminate if its owning controller does. */
  2618. char *OwningControllerProcess;
  2619. /** FD specifier for a controller that owns this Tor instance. */
  2620. int OwningControllerFD;
  2621. int ShutdownWaitLength; /**< When we get a SIGINT and we're a server, how
  2622. * long do we wait before exiting? */
  2623. char *SafeLogging; /**< Contains "relay", "1", "0" (meaning no scrubbing). */
  2624. /* Derived from SafeLogging */
  2625. enum {
  2626. SAFELOG_SCRUB_ALL, SAFELOG_SCRUB_RELAY, SAFELOG_SCRUB_NONE
  2627. } SafeLogging_;
  2628. int Sandbox; /**< Boolean: should sandboxing be enabled? */
  2629. int SafeSocks; /**< Boolean: should we outright refuse application
  2630. * connections that use socks4 or socks5-with-local-dns? */
  2631. int ProtocolWarnings; /**< Boolean: when other parties screw up the Tor
  2632. * protocol, is it a warn or an info in our logs? */
  2633. int TestSocks; /**< Boolean: when we get a socks connection, do we loudly
  2634. * log whether it was DNS-leaking or not? */
  2635. int HardwareAccel; /**< Boolean: Should we enable OpenSSL hardware
  2636. * acceleration where available? */
  2637. /** Token Bucket Refill resolution in milliseconds. */
  2638. int TokenBucketRefillInterval;
  2639. char *AccelName; /**< Optional hardware acceleration engine name. */
  2640. char *AccelDir; /**< Optional hardware acceleration engine search dir. */
  2641. /** Boolean: Do we try to enter from a smallish number
  2642. * of fixed nodes? */
  2643. int UseEntryGuards_option;
  2644. /** Internal variable to remember whether we're actually acting on
  2645. * UseEntryGuards_option -- when we're a non-anonymous Tor2web client or
  2646. * Single Onion Service, it is always false, otherwise we use the value of
  2647. * UseEntryGuards_option. */
  2648. int UseEntryGuards;
  2649. int NumEntryGuards; /**< How many entry guards do we try to establish? */
  2650. /** If 1, we use any guardfraction information we see in the
  2651. * consensus. If 0, we don't. If -1, let the consensus parameter
  2652. * decide. */
  2653. int UseGuardFraction;
  2654. int NumDirectoryGuards; /**< How many dir guards do we try to establish?
  2655. * If 0, use value from NumEntryGuards. */
  2656. int NumPrimaryGuards; /**< How many primary guards do we want? */
  2657. int RephistTrackTime; /**< How many seconds do we keep rephist info? */
  2658. /** Should we always fetch our dir info on the mirror schedule (which
  2659. * means directly from the authorities) no matter our other config? */
  2660. int FetchDirInfoEarly;
  2661. /** Should we fetch our dir info at the start of the consensus period? */
  2662. int FetchDirInfoExtraEarly;
  2663. int DirCache; /**< Cache all directory documents and accept requests via
  2664. * tunnelled dir conns from clients. If 1, enabled (default);
  2665. * If 0, disabled. */
  2666. char *VirtualAddrNetworkIPv4; /**< Address and mask to hand out for virtual
  2667. * MAPADDRESS requests for IPv4 addresses */
  2668. char *VirtualAddrNetworkIPv6; /**< Address and mask to hand out for virtual
  2669. * MAPADDRESS requests for IPv6 addresses */
  2670. int ServerDNSSearchDomains; /**< Boolean: If set, we don't force exit
  2671. * addresses to be FQDNs, but rather search for them in
  2672. * the local domains. */
  2673. int ServerDNSDetectHijacking; /**< Boolean: If true, check for DNS failure
  2674. * hijacking. */
  2675. int ServerDNSRandomizeCase; /**< Boolean: Use the 0x20-hack to prevent
  2676. * DNS poisoning attacks. */
  2677. char *ServerDNSResolvConfFile; /**< If provided, we configure our internal
  2678. * resolver from the file here rather than from
  2679. * /etc/resolv.conf (Unix) or the registry (Windows). */
  2680. char *DirPortFrontPage; /**< This is a full path to a file with an html
  2681. disclaimer. This allows a server administrator to show
  2682. that they're running Tor and anyone visiting their server
  2683. will know this without any specialized knowledge. */
  2684. int DisableDebuggerAttachment; /**< Currently Linux only specific attempt to
  2685. disable ptrace; needs BSD testing. */
  2686. /** Boolean: if set, we start even if our resolv.conf file is missing
  2687. * or broken. */
  2688. int ServerDNSAllowBrokenConfig;
  2689. /** Boolean: if set, then even connections to private addresses will get
  2690. * rate-limited. */
  2691. int CountPrivateBandwidth;
  2692. smartlist_t *ServerDNSTestAddresses; /**< A list of addresses that definitely
  2693. * should be resolvable. Used for
  2694. * testing our DNS server. */
  2695. int EnforceDistinctSubnets; /**< If true, don't allow multiple routers in the
  2696. * same network zone in the same circuit. */
  2697. int AllowNonRFC953Hostnames; /**< If true, we allow connections to hostnames
  2698. * with weird characters. */
  2699. /** If true, we try resolving hostnames with weird characters. */
  2700. int ServerDNSAllowNonRFC953Hostnames;
  2701. /** If true, we try to download extra-info documents (and we serve them,
  2702. * if we are a cache). For authorities, this is always true. */
  2703. int DownloadExtraInfo;
  2704. /** If true, we're configured to collect statistics on clients
  2705. * requesting network statuses from us as directory. */
  2706. int DirReqStatistics_option;
  2707. /** Internal variable to remember whether we're actually acting on
  2708. * DirReqStatistics_option -- yes if it's set and we're a server, else no. */
  2709. int DirReqStatistics;
  2710. /** If true, the user wants us to collect statistics on port usage. */
  2711. int ExitPortStatistics;
  2712. /** If true, the user wants us to collect connection statistics. */
  2713. int ConnDirectionStatistics;
  2714. /** If true, the user wants us to collect cell statistics. */
  2715. int CellStatistics;
  2716. /** If true, the user wants us to collect padding statistics. */
  2717. int PaddingStatistics;
  2718. /** If true, the user wants us to collect statistics as entry node. */
  2719. int EntryStatistics;
  2720. /** If true, the user wants us to collect statistics as hidden service
  2721. * directory, introduction point, or rendezvous point. */
  2722. int HiddenServiceStatistics_option;
  2723. /** Internal variable to remember whether we're actually acting on
  2724. * HiddenServiceStatistics_option -- yes if it's set and we're a server,
  2725. * else no. */
  2726. int HiddenServiceStatistics;
  2727. /** If true, include statistics file contents in extra-info documents. */
  2728. int ExtraInfoStatistics;
  2729. /** If true, do not believe anybody who tells us that a domain resolves
  2730. * to an internal address, or that an internal address has a PTR mapping.
  2731. * Helps avoid some cross-site attacks. */
  2732. int ClientDNSRejectInternalAddresses;
  2733. /** If true, do not accept any requests to connect to internal addresses
  2734. * over randomly chosen exits. */
  2735. int ClientRejectInternalAddresses;
  2736. /** If true, clients may connect over IPv4. If false, they will avoid
  2737. * connecting over IPv4. We enforce this for OR and Dir connections. */
  2738. int ClientUseIPv4;
  2739. /** If true, clients may connect over IPv6. If false, they will avoid
  2740. * connecting over IPv4. We enforce this for OR and Dir connections.
  2741. * Use fascist_firewall_use_ipv6() instead of accessing this value
  2742. * directly. */
  2743. int ClientUseIPv6;
  2744. /** If true, prefer an IPv6 OR port over an IPv4 one for entry node
  2745. * connections. If auto, bridge clients prefer IPv6, and other clients
  2746. * prefer IPv4. Use node_ipv6_or_preferred() instead of accessing this value
  2747. * directly. */
  2748. int ClientPreferIPv6ORPort;
  2749. /** If true, prefer an IPv6 directory port over an IPv4 one for direct
  2750. * directory connections. If auto, bridge clients prefer IPv6, and other
  2751. * clients prefer IPv4. Use fascist_firewall_prefer_ipv6_dirport() instead of
  2752. * accessing this value directly. */
  2753. int ClientPreferIPv6DirPort;
  2754. /** The length of time that we think a consensus should be fresh. */
  2755. int V3AuthVotingInterval;
  2756. /** The length of time we think it will take to distribute votes. */
  2757. int V3AuthVoteDelay;
  2758. /** The length of time we think it will take to distribute signatures. */
  2759. int V3AuthDistDelay;
  2760. /** The number of intervals we think a consensus should be valid. */
  2761. int V3AuthNIntervalsValid;
  2762. /** Should advertise and sign consensuses with a legacy key, for key
  2763. * migration purposes? */
  2764. int V3AuthUseLegacyKey;
  2765. /** Location of bandwidth measurement file */
  2766. char *V3BandwidthsFile;
  2767. /** Location of guardfraction file */
  2768. char *GuardfractionFile;
  2769. /** Authority only: key=value pairs that we add to our networkstatus
  2770. * consensus vote on the 'params' line. */
  2771. char *ConsensusParams;
  2772. /** Authority only: minimum number of measured bandwidths we must see
  2773. * before we only believe measured bandwidths to assign flags. */
  2774. int MinMeasuredBWsForAuthToIgnoreAdvertised;
  2775. /** The length of time that we think an initial consensus should be fresh.
  2776. * Only altered on testing networks. */
  2777. int TestingV3AuthInitialVotingInterval;
  2778. /** The length of time we think it will take to distribute initial votes.
  2779. * Only altered on testing networks. */
  2780. int TestingV3AuthInitialVoteDelay;
  2781. /** The length of time we think it will take to distribute initial
  2782. * signatures. Only altered on testing networks.*/
  2783. int TestingV3AuthInitialDistDelay;
  2784. /** Offset in seconds added to the starting time for consensus
  2785. voting. Only altered on testing networks. */
  2786. int TestingV3AuthVotingStartOffset;
  2787. /** If an authority has been around for less than this amount of time, it
  2788. * does not believe its reachability information is accurate. Only
  2789. * altered on testing networks. */
  2790. int TestingAuthDirTimeToLearnReachability;
  2791. /** Clients don't download any descriptor this recent, since it will
  2792. * probably not have propagated to enough caches. Only altered on testing
  2793. * networks. */
  2794. int TestingEstimatedDescriptorPropagationTime;
  2795. /** Schedule for when servers should download things in general. Only
  2796. * altered on testing networks. */
  2797. int TestingServerDownloadInitialDelay;
  2798. /** Schedule for when clients should download things in general. Only
  2799. * altered on testing networks. */
  2800. int TestingClientDownloadInitialDelay;
  2801. /** Schedule for when servers should download consensuses. Only altered
  2802. * on testing networks. */
  2803. int TestingServerConsensusDownloadInitialDelay;
  2804. /** Schedule for when clients should download consensuses. Only altered
  2805. * on testing networks. */
  2806. int TestingClientConsensusDownloadInitialDelay;
  2807. /** Schedule for when clients should download consensuses from authorities
  2808. * if they are bootstrapping (that is, they don't have a usable, reasonably
  2809. * live consensus). Only used by clients fetching from a list of fallback
  2810. * directory mirrors.
  2811. *
  2812. * This schedule is incremented by (potentially concurrent) connection
  2813. * attempts, unlike other schedules, which are incremented by connection
  2814. * failures. Only altered on testing networks. */
  2815. int ClientBootstrapConsensusAuthorityDownloadInitialDelay;
  2816. /** Schedule for when clients should download consensuses from fallback
  2817. * directory mirrors if they are bootstrapping (that is, they don't have a
  2818. * usable, reasonably live consensus). Only used by clients fetching from a
  2819. * list of fallback directory mirrors.
  2820. *
  2821. * This schedule is incremented by (potentially concurrent) connection
  2822. * attempts, unlike other schedules, which are incremented by connection
  2823. * failures. Only altered on testing networks. */
  2824. int ClientBootstrapConsensusFallbackDownloadInitialDelay;
  2825. /** Schedule for when clients should download consensuses from authorities
  2826. * if they are bootstrapping (that is, they don't have a usable, reasonably
  2827. * live consensus). Only used by clients which don't have or won't fetch
  2828. * from a list of fallback directory mirrors.
  2829. *
  2830. * This schedule is incremented by (potentially concurrent) connection
  2831. * attempts, unlike other schedules, which are incremented by connection
  2832. * failures. Only altered on testing networks. */
  2833. int ClientBootstrapConsensusAuthorityOnlyDownloadInitialDelay;
  2834. /** Schedule for when clients should download bridge descriptors. Only
  2835. * altered on testing networks. */
  2836. int TestingBridgeDownloadInitialDelay;
  2837. /** Schedule for when clients should download bridge descriptors when they
  2838. * have no running bridges. Only altered on testing networks. */
  2839. int TestingBridgeBootstrapDownloadInitialDelay;
  2840. /** When directory clients have only a few descriptors to request, they
  2841. * batch them until they have more, or until this amount of time has
  2842. * passed. Only altered on testing networks. */
  2843. int TestingClientMaxIntervalWithoutRequest;
  2844. /** How long do we let a directory connection stall before expiring
  2845. * it? Only altered on testing networks. */
  2846. int TestingDirConnectionMaxStall;
  2847. /** How many simultaneous in-progress connections will we make when trying
  2848. * to fetch a consensus before we wait for one to complete, timeout, or
  2849. * error out? Only altered on testing networks. */
  2850. int ClientBootstrapConsensusMaxInProgressTries;
  2851. /** If true, we take part in a testing network. Change the defaults of a
  2852. * couple of other configuration options and allow to change the values
  2853. * of certain configuration options. */
  2854. int TestingTorNetwork;
  2855. /** Minimum value for the Exit flag threshold on testing networks. */
  2856. uint64_t TestingMinExitFlagThreshold;
  2857. /** Minimum value for the Fast flag threshold on testing networks. */
  2858. uint64_t TestingMinFastFlagThreshold;
  2859. /** Relays in a testing network which should be voted Exit
  2860. * regardless of exit policy. */
  2861. routerset_t *TestingDirAuthVoteExit;
  2862. int TestingDirAuthVoteExitIsStrict;
  2863. /** Relays in a testing network which should be voted Guard
  2864. * regardless of uptime and bandwidth. */
  2865. routerset_t *TestingDirAuthVoteGuard;
  2866. int TestingDirAuthVoteGuardIsStrict;
  2867. /** Relays in a testing network which should be voted HSDir
  2868. * regardless of uptime and DirPort. */
  2869. routerset_t *TestingDirAuthVoteHSDir;
  2870. int TestingDirAuthVoteHSDirIsStrict;
  2871. /** Enable CONN_BW events. Only altered on testing networks. */
  2872. int TestingEnableConnBwEvent;
  2873. /** Enable CELL_STATS events. Only altered on testing networks. */
  2874. int TestingEnableCellStatsEvent;
  2875. /** If true, and we have GeoIP data, and we're a bridge, keep a per-country
  2876. * count of how many client addresses have contacted us so that we can help
  2877. * the bridge authority guess which countries have blocked access to us. */
  2878. int BridgeRecordUsageByCountry;
  2879. /** Optionally, IPv4 and IPv6 GeoIP data. */
  2880. char *GeoIPFile;
  2881. char *GeoIPv6File;
  2882. /** Autobool: if auto, then any attempt to Exclude{Exit,}Nodes a particular
  2883. * country code will exclude all nodes in ?? and A1. If true, all nodes in
  2884. * ?? and A1 are excluded. Has no effect if we don't know any GeoIP data. */
  2885. int GeoIPExcludeUnknown;
  2886. /** If true, SIGHUP should reload the torrc. Sometimes controllers want
  2887. * to make this false. */
  2888. int ReloadTorrcOnSIGHUP;
  2889. /* The main parameter for picking circuits within a connection.
  2890. *
  2891. * If this value is positive, when picking a cell to relay on a connection,
  2892. * we always relay from the circuit whose weighted cell count is lowest.
  2893. * Cells are weighted exponentially such that if one cell is sent
  2894. * 'CircuitPriorityHalflife' seconds before another, it counts for half as
  2895. * much.
  2896. *
  2897. * If this value is zero, we're disabling the cell-EWMA algorithm.
  2898. *
  2899. * If this value is negative, we're using the default approach
  2900. * according to either Tor or a parameter set in the consensus.
  2901. */
  2902. double CircuitPriorityHalflife;
  2903. /** Set to true if the TestingTorNetwork configuration option is set.
  2904. * This is used so that options_validate() has a chance to realize that
  2905. * the defaults have changed. */
  2906. int UsingTestNetworkDefaults_;
  2907. /** If 1, we try to use microdescriptors to build circuits. If 0, we don't.
  2908. * If -1, Tor decides. */
  2909. int UseMicrodescriptors;
  2910. /** File where we should write the ControlPort. */
  2911. char *ControlPortWriteToFile;
  2912. /** Should that file be group-readable? */
  2913. int ControlPortFileGroupReadable;
  2914. #define MAX_MAX_CLIENT_CIRCUITS_PENDING 1024
  2915. /** Maximum number of non-open general-purpose origin circuits to allow at
  2916. * once. */
  2917. int MaxClientCircuitsPending;
  2918. /** If 1, we always send optimistic data when it's supported. If 0, we
  2919. * never use it. If -1, we do what the consensus says. */
  2920. int OptimisticData;
  2921. /** If 1, we accept and launch no external network connections, except on
  2922. * control ports. */
  2923. int DisableNetwork;
  2924. /**
  2925. * Parameters for path-bias detection.
  2926. * @{
  2927. * These options override the default behavior of Tor's (**currently
  2928. * experimental**) path bias detection algorithm. To try to find broken or
  2929. * misbehaving guard nodes, Tor looks for nodes where more than a certain
  2930. * fraction of circuits through that guard fail to get built.
  2931. *
  2932. * The PathBiasCircThreshold option controls how many circuits we need to
  2933. * build through a guard before we make these checks. The
  2934. * PathBiasNoticeRate, PathBiasWarnRate and PathBiasExtremeRate options
  2935. * control what fraction of circuits must succeed through a guard so we
  2936. * won't write log messages. If less than PathBiasExtremeRate circuits
  2937. * succeed *and* PathBiasDropGuards is set to 1, we disable use of that
  2938. * guard.
  2939. *
  2940. * When we have seen more than PathBiasScaleThreshold circuits through a
  2941. * guard, we scale our observations by 0.5 (governed by the consensus) so
  2942. * that new observations don't get swamped by old ones.
  2943. *
  2944. * By default, or if a negative value is provided for one of these options,
  2945. * Tor uses reasonable defaults from the networkstatus consensus document.
  2946. * If no defaults are available there, these options default to 150, .70,
  2947. * .50, .30, 0, and 300 respectively.
  2948. */
  2949. int PathBiasCircThreshold;
  2950. double PathBiasNoticeRate;
  2951. double PathBiasWarnRate;
  2952. double PathBiasExtremeRate;
  2953. int PathBiasDropGuards;
  2954. int PathBiasScaleThreshold;
  2955. /** @} */
  2956. /**
  2957. * Parameters for path-bias use detection
  2958. * @{
  2959. * Similar to the above options, these options override the default behavior
  2960. * of Tor's (**currently experimental**) path use bias detection algorithm.
  2961. *
  2962. * Where as the path bias parameters govern thresholds for successfully
  2963. * building circuits, these four path use bias parameters govern thresholds
  2964. * only for circuit usage. Circuits which receive no stream usage are not
  2965. * counted by this detection algorithm. A used circuit is considered
  2966. * successful if it is capable of carrying streams or otherwise receiving
  2967. * well-formed responses to RELAY cells.
  2968. *
  2969. * By default, or if a negative value is provided for one of these options,
  2970. * Tor uses reasonable defaults from the networkstatus consensus document.
  2971. * If no defaults are available there, these options default to 20, .80,
  2972. * .60, and 100, respectively.
  2973. */
  2974. int PathBiasUseThreshold;
  2975. double PathBiasNoticeUseRate;
  2976. double PathBiasExtremeUseRate;
  2977. int PathBiasScaleUseThreshold;
  2978. /** @} */
  2979. int IPv6Exit; /**< Do we support exiting to IPv6 addresses? */
  2980. /** Fraction: */
  2981. double PathsNeededToBuildCircuits;
  2982. /** What expiry time shall we place on our SSL certs? "0" means we
  2983. * should guess a suitable value. */
  2984. int SSLKeyLifetime;
  2985. /** How long (seconds) do we keep a guard before picking a new one? */
  2986. int GuardLifetime;
  2987. /** Is this an exit node? This is a tristate, where "1" means "yes, and use
  2988. * the default exit policy if none is given" and "0" means "no; exit policy
  2989. * is 'reject *'" and "auto" (-1) means "same as 1, but warn the user."
  2990. *
  2991. * XXXX Eventually, the default will be 0. */
  2992. int ExitRelay;
  2993. /** For how long (seconds) do we declare our signing keys to be valid? */
  2994. int SigningKeyLifetime;
  2995. /** For how long (seconds) do we declare our link keys to be valid? */
  2996. int TestingLinkCertLifetime;
  2997. /** For how long (seconds) do we declare our auth keys to be valid? */
  2998. int TestingAuthKeyLifetime;
  2999. /** How long before signing keys expire will we try to make a new one? */
  3000. int TestingSigningKeySlop;
  3001. /** How long before link keys expire will we try to make a new one? */
  3002. int TestingLinkKeySlop;
  3003. /** How long before auth keys expire will we try to make a new one? */
  3004. int TestingAuthKeySlop;
  3005. /** Force use of offline master key features: never generate a master
  3006. * ed25519 identity key except from tor --keygen */
  3007. int OfflineMasterKey;
  3008. enum {
  3009. FORCE_PASSPHRASE_AUTO=0,
  3010. FORCE_PASSPHRASE_ON,
  3011. FORCE_PASSPHRASE_OFF
  3012. } keygen_force_passphrase;
  3013. int use_keygen_passphrase_fd;
  3014. int keygen_passphrase_fd;
  3015. int change_key_passphrase;
  3016. char *master_key_fname;
  3017. /** Autobool: Do we try to retain capabilities if we can? */
  3018. int KeepBindCapabilities;
  3019. /** Maximum total size of unparseable descriptors to log during the
  3020. * lifetime of this Tor process.
  3021. */
  3022. uint64_t MaxUnparseableDescSizeToLog;
  3023. /** Bool (default: 1): Switch for the shared random protocol. Only
  3024. * relevant to a directory authority. If off, the authority won't
  3025. * participate in the protocol. If on (default), a flag is added to the
  3026. * vote indicating participation. */
  3027. int AuthDirSharedRandomness;
  3028. /** If 1, we skip all OOS checks. */
  3029. int DisableOOSCheck;
  3030. /** Autobool: Should we include Ed25519 identities in extend2 cells?
  3031. * If -1, we should do whatever the consensus parameter says. */
  3032. int ExtendByEd25519ID;
  3033. /** Bool (default: 1): When testing routerinfos as a directory authority,
  3034. * do we enforce Ed25519 identity match? */
  3035. /* NOTE: remove this option someday. */
  3036. int AuthDirTestEd25519LinkKeys;
  3037. /** Bool (default: 0): Tells if a %include was used on torrc */
  3038. int IncludeUsed;
  3039. /** The seconds after expiration which we as a relay should keep old
  3040. * consensuses around so that we can generate diffs from them. If 0,
  3041. * use the default. */
  3042. int MaxConsensusAgeForDiffs;
  3043. /** Bool (default: 0). Tells Tor to never try to exec another program.
  3044. */
  3045. int NoExec;
  3046. /** Have the KIST scheduler run every X milliseconds. If less than zero, do
  3047. * not use the KIST scheduler but use the old vanilla scheduler instead. If
  3048. * zero, do what the consensus says and fall back to using KIST as if this is
  3049. * set to "10 msec" if the consensus doesn't say anything. */
  3050. int KISTSchedRunInterval;
  3051. /** A multiplier for the KIST per-socket limit calculation. */
  3052. double KISTSockBufSizeFactor;
  3053. /** The list of scheduler type string ordered by priority that is first one
  3054. * has to be tried first. Default: KIST,KISTLite,Vanilla */
  3055. smartlist_t *Schedulers;
  3056. /* An ordered list of scheduler_types mapped from Schedulers. */
  3057. smartlist_t *SchedulerTypes_;
  3058. /** List of files that were opened by %include in torrc and torrc-defaults */
  3059. smartlist_t *FilesOpenedByIncludes;
  3060. /** If true, Tor shouldn't install any posix signal handlers, since it is
  3061. * running embedded inside another process.
  3062. */
  3063. int DisableSignalHandlers;
  3064. /** Autobool: Is the circuit creation DoS mitigation subsystem enabled? */
  3065. int DoSCircuitCreationEnabled;
  3066. /** Minimum concurrent connection needed from one single address before any
  3067. * defense is used. */
  3068. int DoSCircuitCreationMinConnections;
  3069. /** Circuit rate used to refill the token bucket. */
  3070. int DoSCircuitCreationRate;
  3071. /** Maximum allowed burst of circuits. Reaching that value, the address is
  3072. * detected as malicious and a defense might be used. */
  3073. int DoSCircuitCreationBurst;
  3074. /** When an address is marked as malicous, what defense should be used
  3075. * against it. See the dos_cc_defense_type_t enum. */
  3076. int DoSCircuitCreationDefenseType;
  3077. /** For how much time (in seconds) the defense is applicable for a malicious
  3078. * address. A random time delta is added to the defense time of an address
  3079. * which will be between 1 second and half of this value. */
  3080. int DoSCircuitCreationDefenseTimePeriod;
  3081. /** Autobool: Is the DoS connection mitigation subsystem enabled? */
  3082. int DoSConnectionEnabled;
  3083. /** Maximum concurrent connection allowed per address. */
  3084. int DoSConnectionMaxConcurrentCount;
  3085. /** When an address is reaches the maximum count, what defense should be
  3086. * used against it. See the dos_conn_defense_type_t enum. */
  3087. int DoSConnectionDefenseType;
  3088. /** Autobool: Do we refuse single hop client rendezvous? */
  3089. int DoSRefuseSingleHopClientRendezvous;
  3090. } or_options_t;
  3091. #define LOG_PROTOCOL_WARN (get_protocol_warning_severity_level())
  3092. /** Persistent state for an onion router, as saved to disk. */
  3093. typedef struct {
  3094. uint32_t magic_;
  3095. /** The time at which we next plan to write the state to the disk. Equal to
  3096. * TIME_MAX if there are no savable changes, 0 if there are changes that
  3097. * should be saved right away. */
  3098. time_t next_write;
  3099. /** When was the state last written to disk? */
  3100. time_t LastWritten;
  3101. /** Fields for accounting bandwidth use. */
  3102. time_t AccountingIntervalStart;
  3103. uint64_t AccountingBytesReadInInterval;
  3104. uint64_t AccountingBytesWrittenInInterval;
  3105. int AccountingSecondsActive;
  3106. int AccountingSecondsToReachSoftLimit;
  3107. time_t AccountingSoftLimitHitAt;
  3108. uint64_t AccountingBytesAtSoftLimit;
  3109. uint64_t AccountingExpectedUsage;
  3110. /** A list of Entry Guard-related configuration lines. (pre-prop271) */
  3111. config_line_t *EntryGuards;
  3112. /** A list of guard-related configuration lines. (post-prop271) */
  3113. config_line_t *Guard;
  3114. config_line_t *TransportProxies;
  3115. /** Cached revision counters for active hidden services on this host */
  3116. config_line_t *HidServRevCounter;
  3117. /** These fields hold information on the history of bandwidth usage for
  3118. * servers. The "Ends" fields hold the time when we last updated the
  3119. * bandwidth usage. The "Interval" fields hold the granularity, in seconds,
  3120. * of the entries of Values. The "Values" lists hold decimal string
  3121. * representations of the number of bytes read or written in each
  3122. * interval. The "Maxima" list holds decimal strings describing the highest
  3123. * rate achieved during the interval.
  3124. */
  3125. time_t BWHistoryReadEnds;
  3126. int BWHistoryReadInterval;
  3127. smartlist_t *BWHistoryReadValues;
  3128. smartlist_t *BWHistoryReadMaxima;
  3129. time_t BWHistoryWriteEnds;
  3130. int BWHistoryWriteInterval;
  3131. smartlist_t *BWHistoryWriteValues;
  3132. smartlist_t *BWHistoryWriteMaxima;
  3133. time_t BWHistoryDirReadEnds;
  3134. int BWHistoryDirReadInterval;
  3135. smartlist_t *BWHistoryDirReadValues;
  3136. smartlist_t *BWHistoryDirReadMaxima;
  3137. time_t BWHistoryDirWriteEnds;
  3138. int BWHistoryDirWriteInterval;
  3139. smartlist_t *BWHistoryDirWriteValues;
  3140. smartlist_t *BWHistoryDirWriteMaxima;
  3141. /** Build time histogram */
  3142. config_line_t * BuildtimeHistogram;
  3143. int TotalBuildTimes;
  3144. int CircuitBuildAbandonedCount;
  3145. /** What version of Tor wrote this state file? */
  3146. char *TorVersion;
  3147. /** Holds any unrecognized values we found in the state file, in the order
  3148. * in which we found them. */
  3149. config_line_t *ExtraLines;
  3150. /** When did we last rotate our onion key? "0" for 'no idea'. */
  3151. time_t LastRotatedOnionKey;
  3152. } or_state_t;
  3153. #define MAX_SOCKS_REPLY_LEN 1024
  3154. #define MAX_SOCKS_ADDR_LEN 256
  3155. #define SOCKS_NO_AUTH 0x00
  3156. #define SOCKS_USER_PASS 0x02
  3157. /** Please open a TCP connection to this addr:port. */
  3158. #define SOCKS_COMMAND_CONNECT 0x01
  3159. /** Please turn this FQDN into an IP address, privately. */
  3160. #define SOCKS_COMMAND_RESOLVE 0xF0
  3161. /** Please turn this IP address into an FQDN, privately. */
  3162. #define SOCKS_COMMAND_RESOLVE_PTR 0xF1
  3163. /* || 0 is for -Wparentheses-equality (-Wall?) appeasement under clang */
  3164. #define SOCKS_COMMAND_IS_CONNECT(c) (((c)==SOCKS_COMMAND_CONNECT) || 0)
  3165. #define SOCKS_COMMAND_IS_RESOLVE(c) ((c)==SOCKS_COMMAND_RESOLVE || \
  3166. (c)==SOCKS_COMMAND_RESOLVE_PTR)
  3167. /** State of a SOCKS request from a user to an OP. Also used to encode other
  3168. * information for non-socks user request (such as those on TransPort and
  3169. * DNSPort) */
  3170. struct socks_request_t {
  3171. /** Which version of SOCKS did the client use? One of "0, 4, 5" -- where
  3172. * 0 means that no socks handshake ever took place, and this is just a
  3173. * stub connection (e.g. see connection_ap_make_link()). */
  3174. uint8_t socks_version;
  3175. /** If using socks5 authentication, which authentication type did we
  3176. * negotiate? currently we support 0 (no authentication) and 2
  3177. * (username/password). */
  3178. uint8_t auth_type;
  3179. /** What is this stream's goal? One of the SOCKS_COMMAND_* values */
  3180. uint8_t command;
  3181. /** Which kind of listener created this stream? */
  3182. uint8_t listener_type;
  3183. size_t replylen; /**< Length of <b>reply</b>. */
  3184. uint8_t reply[MAX_SOCKS_REPLY_LEN]; /**< Write an entry into this string if
  3185. * we want to specify our own socks reply,
  3186. * rather than using the default socks4 or
  3187. * socks5 socks reply. We use this for the
  3188. * two-stage socks5 handshake.
  3189. */
  3190. char address[MAX_SOCKS_ADDR_LEN]; /**< What address did the client ask to
  3191. connect to/resolve? */
  3192. uint16_t port; /**< What port did the client ask to connect to? */
  3193. unsigned int has_finished : 1; /**< Has the SOCKS handshake finished? Used to
  3194. * make sure we send back a socks reply for
  3195. * every connection. */
  3196. unsigned int got_auth : 1; /**< Have we received any authentication data? */
  3197. /** If this is set, we will choose "no authentication" instead of
  3198. * "username/password" authentication if both are offered. Used as input to
  3199. * parse_socks. */
  3200. unsigned int socks_prefer_no_auth : 1;
  3201. /** Number of bytes in username; 0 if username is NULL */
  3202. size_t usernamelen;
  3203. /** Number of bytes in password; 0 if password is NULL */
  3204. uint8_t passwordlen;
  3205. /** The negotiated username value if any (for socks5), or the entire
  3206. * authentication string (for socks4). This value is NOT nul-terminated;
  3207. * see usernamelen for its length. */
  3208. char *username;
  3209. /** The negotiated password value if any (for socks5). This value is NOT
  3210. * nul-terminated; see passwordlen for its length. */
  3211. char *password;
  3212. };
  3213. /********************************* circuitbuild.c **********************/
  3214. /** How many hops does a general-purpose circuit have by default? */
  3215. #define DEFAULT_ROUTE_LEN 3
  3216. /* Circuit Build Timeout "public" structures. */
  3217. /** Precision multiplier for the Bw weights */
  3218. #define BW_WEIGHT_SCALE 10000
  3219. #define BW_MIN_WEIGHT_SCALE 1
  3220. #define BW_MAX_WEIGHT_SCALE INT32_MAX
  3221. /** Total size of the circuit timeout history to accumulate.
  3222. * 1000 is approx 2.5 days worth of continual-use circuits. */
  3223. #define CBT_NCIRCUITS_TO_OBSERVE 1000
  3224. /** Width of the histogram bins in milliseconds */
  3225. #define CBT_BIN_WIDTH ((build_time_t)50)
  3226. /** Number of modes to use in the weighted-avg computation of Xm */
  3227. #define CBT_DEFAULT_NUM_XM_MODES 3
  3228. #define CBT_MIN_NUM_XM_MODES 1
  3229. #define CBT_MAX_NUM_XM_MODES 20
  3230. /** A build_time_t is milliseconds */
  3231. typedef uint32_t build_time_t;
  3232. /**
  3233. * CBT_BUILD_ABANDONED is our flag value to represent a force-closed
  3234. * circuit (Aka a 'right-censored' pareto value).
  3235. */
  3236. #define CBT_BUILD_ABANDONED ((build_time_t)(INT32_MAX-1))
  3237. #define CBT_BUILD_TIME_MAX ((build_time_t)(INT32_MAX))
  3238. /** Save state every 10 circuits */
  3239. #define CBT_SAVE_STATE_EVERY 10
  3240. /* Circuit build times consensus parameters */
  3241. /**
  3242. * How long to wait before actually closing circuits that take too long to
  3243. * build in terms of CDF quantile.
  3244. */
  3245. #define CBT_DEFAULT_CLOSE_QUANTILE 95
  3246. #define CBT_MIN_CLOSE_QUANTILE CBT_MIN_QUANTILE_CUTOFF
  3247. #define CBT_MAX_CLOSE_QUANTILE CBT_MAX_QUANTILE_CUTOFF
  3248. /**
  3249. * How many circuits count as recent when considering if the
  3250. * connection has gone gimpy or changed.
  3251. */
  3252. #define CBT_DEFAULT_RECENT_CIRCUITS 20
  3253. #define CBT_MIN_RECENT_CIRCUITS 3
  3254. #define CBT_MAX_RECENT_CIRCUITS 1000
  3255. /**
  3256. * Maximum count of timeouts that finish the first hop in the past
  3257. * RECENT_CIRCUITS before calculating a new timeout.
  3258. *
  3259. * This tells us whether to abandon timeout history and set
  3260. * the timeout back to whatever circuit_build_times_get_initial_timeout()
  3261. * gives us.
  3262. */
  3263. #define CBT_DEFAULT_MAX_RECENT_TIMEOUT_COUNT (CBT_DEFAULT_RECENT_CIRCUITS*9/10)
  3264. #define CBT_MIN_MAX_RECENT_TIMEOUT_COUNT 3
  3265. #define CBT_MAX_MAX_RECENT_TIMEOUT_COUNT 10000
  3266. /** Minimum circuits before estimating a timeout */
  3267. #define CBT_DEFAULT_MIN_CIRCUITS_TO_OBSERVE 100
  3268. #define CBT_MIN_MIN_CIRCUITS_TO_OBSERVE 1
  3269. #define CBT_MAX_MIN_CIRCUITS_TO_OBSERVE 10000
  3270. /** Cutoff percentile on the CDF for our timeout estimation. */
  3271. #define CBT_DEFAULT_QUANTILE_CUTOFF 80
  3272. #define CBT_MIN_QUANTILE_CUTOFF 10
  3273. #define CBT_MAX_QUANTILE_CUTOFF 99
  3274. double circuit_build_times_quantile_cutoff(void);
  3275. /** How often in seconds should we build a test circuit */
  3276. #define CBT_DEFAULT_TEST_FREQUENCY 10
  3277. #define CBT_MIN_TEST_FREQUENCY 1
  3278. #define CBT_MAX_TEST_FREQUENCY INT32_MAX
  3279. /** Lowest allowable value for CircuitBuildTimeout in milliseconds */
  3280. #define CBT_DEFAULT_TIMEOUT_MIN_VALUE (1500)
  3281. #define CBT_MIN_TIMEOUT_MIN_VALUE 500
  3282. #define CBT_MAX_TIMEOUT_MIN_VALUE INT32_MAX
  3283. /** Initial circuit build timeout in milliseconds */
  3284. #define CBT_DEFAULT_TIMEOUT_INITIAL_VALUE (60*1000)
  3285. #define CBT_MIN_TIMEOUT_INITIAL_VALUE CBT_MIN_TIMEOUT_MIN_VALUE
  3286. #define CBT_MAX_TIMEOUT_INITIAL_VALUE INT32_MAX
  3287. int32_t circuit_build_times_initial_timeout(void);
  3288. #if CBT_DEFAULT_MAX_RECENT_TIMEOUT_COUNT < CBT_MIN_MAX_RECENT_TIMEOUT_COUNT
  3289. #error "RECENT_CIRCUITS is set too low."
  3290. #endif
  3291. /** Information about the state of our local network connection */
  3292. typedef struct {
  3293. /** The timestamp we last completed a TLS handshake or received a cell */
  3294. time_t network_last_live;
  3295. /** If the network is not live, how many timeouts has this caused? */
  3296. int nonlive_timeouts;
  3297. /** Circular array of circuits that have made it to the first hop. Slot is
  3298. * 1 if circuit timed out, 0 if circuit succeeded */
  3299. int8_t *timeouts_after_firsthop;
  3300. /** Number of elements allocated for the above array */
  3301. int num_recent_circs;
  3302. /** Index into circular array. */
  3303. int after_firsthop_idx;
  3304. } network_liveness_t;
  3305. typedef struct circuit_build_times_s circuit_build_times_t;
  3306. /********************************* config.c ***************************/
  3307. /** An error from options_trial_assign() or options_init_from_string(). */
  3308. typedef enum setopt_err_t {
  3309. SETOPT_OK = 0,
  3310. SETOPT_ERR_MISC = -1,
  3311. SETOPT_ERR_PARSE = -2,
  3312. SETOPT_ERR_TRANSITION = -3,
  3313. SETOPT_ERR_SETTING = -4,
  3314. } setopt_err_t;
  3315. /********************************* connection_edge.c *************************/
  3316. /** Enumerates possible origins of a client-side address mapping. */
  3317. typedef enum {
  3318. /** We're remapping this address because the controller told us to. */
  3319. ADDRMAPSRC_CONTROLLER,
  3320. /** We're remapping this address because of an AutomapHostsOnResolve
  3321. * configuration. */
  3322. ADDRMAPSRC_AUTOMAP,
  3323. /** We're remapping this address because our configuration (via torrc, the
  3324. * command line, or a SETCONF command) told us to. */
  3325. ADDRMAPSRC_TORRC,
  3326. /** We're remapping this address because we have TrackHostExit configured,
  3327. * and we want to remember to use the same exit next time. */
  3328. ADDRMAPSRC_TRACKEXIT,
  3329. /** We're remapping this address because we got a DNS resolution from a
  3330. * Tor server that told us what its value was. */
  3331. ADDRMAPSRC_DNS,
  3332. /** No remapping has occurred. This isn't a possible value for an
  3333. * addrmap_entry_t; it's used as a null value when we need to answer "Why
  3334. * did this remapping happen." */
  3335. ADDRMAPSRC_NONE
  3336. } addressmap_entry_source_t;
  3337. #define addressmap_entry_source_bitfield_t ENUM_BF(addressmap_entry_source_t)
  3338. /********************************* control.c ***************************/
  3339. /** Used to indicate the type of a circuit event passed to the controller.
  3340. * The various types are defined in control-spec.txt */
  3341. typedef enum circuit_status_event_t {
  3342. CIRC_EVENT_LAUNCHED = 0,
  3343. CIRC_EVENT_BUILT = 1,
  3344. CIRC_EVENT_EXTENDED = 2,
  3345. CIRC_EVENT_FAILED = 3,
  3346. CIRC_EVENT_CLOSED = 4,
  3347. } circuit_status_event_t;
  3348. /** Used to indicate the type of a CIRC_MINOR event passed to the controller.
  3349. * The various types are defined in control-spec.txt . */
  3350. typedef enum circuit_status_minor_event_t {
  3351. CIRC_MINOR_EVENT_PURPOSE_CHANGED,
  3352. CIRC_MINOR_EVENT_CANNIBALIZED,
  3353. } circuit_status_minor_event_t;
  3354. /** Used to indicate the type of a stream event passed to the controller.
  3355. * The various types are defined in control-spec.txt */
  3356. typedef enum stream_status_event_t {
  3357. STREAM_EVENT_SENT_CONNECT = 0,
  3358. STREAM_EVENT_SENT_RESOLVE = 1,
  3359. STREAM_EVENT_SUCCEEDED = 2,
  3360. STREAM_EVENT_FAILED = 3,
  3361. STREAM_EVENT_CLOSED = 4,
  3362. STREAM_EVENT_NEW = 5,
  3363. STREAM_EVENT_NEW_RESOLVE = 6,
  3364. STREAM_EVENT_FAILED_RETRIABLE = 7,
  3365. STREAM_EVENT_REMAP = 8
  3366. } stream_status_event_t;
  3367. /** Used to indicate the type of an OR connection event passed to the
  3368. * controller. The various types are defined in control-spec.txt */
  3369. typedef enum or_conn_status_event_t {
  3370. OR_CONN_EVENT_LAUNCHED = 0,
  3371. OR_CONN_EVENT_CONNECTED = 1,
  3372. OR_CONN_EVENT_FAILED = 2,
  3373. OR_CONN_EVENT_CLOSED = 3,
  3374. OR_CONN_EVENT_NEW = 4,
  3375. } or_conn_status_event_t;
  3376. /** Used to indicate the type of a buildtime event */
  3377. typedef enum buildtimeout_set_event_t {
  3378. BUILDTIMEOUT_SET_EVENT_COMPUTED = 0,
  3379. BUILDTIMEOUT_SET_EVENT_RESET = 1,
  3380. BUILDTIMEOUT_SET_EVENT_SUSPENDED = 2,
  3381. BUILDTIMEOUT_SET_EVENT_DISCARD = 3,
  3382. BUILDTIMEOUT_SET_EVENT_RESUME = 4
  3383. } buildtimeout_set_event_t;
  3384. /** Execute the statement <b>stmt</b>, which may log events concerning the
  3385. * connection <b>conn</b>. To prevent infinite loops, disable log messages
  3386. * being sent to controllers if <b>conn</b> is a control connection.
  3387. *
  3388. * Stmt must not contain any return or goto statements.
  3389. */
  3390. #define CONN_LOG_PROTECT(conn, stmt) \
  3391. STMT_BEGIN \
  3392. int _log_conn_is_control; \
  3393. tor_assert(conn); \
  3394. _log_conn_is_control = (conn->type == CONN_TYPE_CONTROL); \
  3395. if (_log_conn_is_control) \
  3396. disable_control_logging(); \
  3397. STMT_BEGIN stmt; STMT_END; \
  3398. if (_log_conn_is_control) \
  3399. enable_control_logging(); \
  3400. STMT_END
  3401. /** Enum describing various stages of bootstrapping, for use with controller
  3402. * bootstrap status events. The values range from 0 to 100. */
  3403. typedef enum {
  3404. BOOTSTRAP_STATUS_UNDEF=-1,
  3405. BOOTSTRAP_STATUS_STARTING=0,
  3406. BOOTSTRAP_STATUS_CONN_DIR=5,
  3407. BOOTSTRAP_STATUS_HANDSHAKE=-2,
  3408. BOOTSTRAP_STATUS_HANDSHAKE_DIR=10,
  3409. BOOTSTRAP_STATUS_ONEHOP_CREATE=15,
  3410. BOOTSTRAP_STATUS_REQUESTING_STATUS=20,
  3411. BOOTSTRAP_STATUS_LOADING_STATUS=25,
  3412. BOOTSTRAP_STATUS_LOADING_KEYS=40,
  3413. BOOTSTRAP_STATUS_REQUESTING_DESCRIPTORS=45,
  3414. BOOTSTRAP_STATUS_LOADING_DESCRIPTORS=50,
  3415. BOOTSTRAP_STATUS_CONN_OR=80,
  3416. BOOTSTRAP_STATUS_HANDSHAKE_OR=85,
  3417. BOOTSTRAP_STATUS_CIRCUIT_CREATE=90,
  3418. BOOTSTRAP_STATUS_DONE=100
  3419. } bootstrap_status_t;
  3420. /********************************* directory.c ***************************/
  3421. /** A pair of digests created by dir_split_resource_info_fingerprint_pairs() */
  3422. typedef struct {
  3423. char first[DIGEST_LEN];
  3424. char second[DIGEST_LEN];
  3425. } fp_pair_t;
  3426. /********************************* dirserv.c ***************************/
  3427. /** An enum to describe what format we're generating a routerstatus line in.
  3428. */
  3429. typedef enum {
  3430. /** For use in a v2 opinion */
  3431. NS_V2,
  3432. /** For use in a consensus networkstatus document (ns flavor) */
  3433. NS_V3_CONSENSUS,
  3434. /** For use in a vote networkstatus document */
  3435. NS_V3_VOTE,
  3436. /** For passing to the controlport in response to a GETINFO request */
  3437. NS_CONTROL_PORT,
  3438. /** For use in a consensus networkstatus document (microdesc flavor) */
  3439. NS_V3_CONSENSUS_MICRODESC
  3440. } routerstatus_format_type_t;
  3441. #ifdef DIRSERV_PRIVATE
  3442. typedef struct measured_bw_line_t {
  3443. char node_id[DIGEST_LEN];
  3444. char node_hex[MAX_HEX_NICKNAME_LEN+1];
  3445. long int bw_kb;
  3446. } measured_bw_line_t;
  3447. #endif /* defined(DIRSERV_PRIVATE) */
  3448. /********************************* dirvote.c ************************/
  3449. /** Describes the schedule by which votes should be generated. */
  3450. typedef struct vote_timing_t {
  3451. /** Length in seconds between one consensus becoming valid and the next
  3452. * becoming valid. */
  3453. int vote_interval;
  3454. /** For how many intervals is a consensus valid? */
  3455. int n_intervals_valid;
  3456. /** Time in seconds allowed to propagate votes */
  3457. int vote_delay;
  3458. /** Time in seconds allowed to propagate signatures */
  3459. int dist_delay;
  3460. } vote_timing_t;
  3461. /********************************* geoip.c **************************/
  3462. /** Indicates an action that we might be noting geoip statistics on.
  3463. * Note that if we're noticing CONNECT, we're a bridge, and if we're noticing
  3464. * the others, we're not.
  3465. */
  3466. typedef enum {
  3467. /** We've noticed a connection as a bridge relay or entry guard. */
  3468. GEOIP_CLIENT_CONNECT = 0,
  3469. /** We've served a networkstatus consensus as a directory server. */
  3470. GEOIP_CLIENT_NETWORKSTATUS = 1,
  3471. } geoip_client_action_t;
  3472. /** Indicates either a positive reply or a reason for rejectng a network
  3473. * status request that will be included in geoip statistics. */
  3474. typedef enum {
  3475. /** Request is answered successfully. */
  3476. GEOIP_SUCCESS = 0,
  3477. /** V3 network status is not signed by a sufficient number of requested
  3478. * authorities. */
  3479. GEOIP_REJECT_NOT_ENOUGH_SIGS = 1,
  3480. /** Requested network status object is unavailable. */
  3481. GEOIP_REJECT_UNAVAILABLE = 2,
  3482. /** Requested network status not found. */
  3483. GEOIP_REJECT_NOT_FOUND = 3,
  3484. /** Network status has not been modified since If-Modified-Since time. */
  3485. GEOIP_REJECT_NOT_MODIFIED = 4,
  3486. /** Directory is busy. */
  3487. GEOIP_REJECT_BUSY = 5,
  3488. } geoip_ns_response_t;
  3489. #define GEOIP_NS_RESPONSE_NUM 6
  3490. /** Directory requests that we are measuring can be either direct or
  3491. * tunneled. */
  3492. typedef enum {
  3493. DIRREQ_DIRECT = 0,
  3494. DIRREQ_TUNNELED = 1,
  3495. } dirreq_type_t;
  3496. /** Possible states for either direct or tunneled directory requests that
  3497. * are relevant for determining network status download times. */
  3498. typedef enum {
  3499. /** Found that the client requests a network status; applies to both
  3500. * direct and tunneled requests; initial state of a request that we are
  3501. * measuring. */
  3502. DIRREQ_IS_FOR_NETWORK_STATUS = 0,
  3503. /** Finished writing a network status to the directory connection;
  3504. * applies to both direct and tunneled requests; completes a direct
  3505. * request. */
  3506. DIRREQ_FLUSHING_DIR_CONN_FINISHED = 1,
  3507. /** END cell sent to circuit that initiated a tunneled request. */
  3508. DIRREQ_END_CELL_SENT = 2,
  3509. /** Flushed last cell from queue of the circuit that initiated a
  3510. * tunneled request to the outbuf of the OR connection. */
  3511. DIRREQ_CIRC_QUEUE_FLUSHED = 3,
  3512. /** Flushed last byte from buffer of the channel belonging to the
  3513. * circuit that initiated a tunneled request; completes a tunneled
  3514. * request. */
  3515. DIRREQ_CHANNEL_BUFFER_FLUSHED = 4
  3516. } dirreq_state_t;
  3517. #define WRITE_STATS_INTERVAL (24*60*60)
  3518. /********************************* microdesc.c *************************/
  3519. typedef struct microdesc_cache_t microdesc_cache_t;
  3520. /********************************* networkstatus.c *********************/
  3521. /** Possible statuses of a version of Tor, given opinions from the directory
  3522. * servers. */
  3523. typedef enum version_status_t {
  3524. VS_RECOMMENDED=0, /**< This version is listed as recommended. */
  3525. VS_OLD=1, /**< This version is older than any recommended version. */
  3526. VS_NEW=2, /**< This version is newer than any recommended version. */
  3527. VS_NEW_IN_SERIES=3, /**< This version is newer than any recommended version
  3528. * in its series, but later recommended versions exist.
  3529. */
  3530. VS_UNRECOMMENDED=4, /**< This version is not recommended (general case). */
  3531. VS_EMPTY=5, /**< The version list was empty; no agreed-on versions. */
  3532. VS_UNKNOWN, /**< We have no idea. */
  3533. } version_status_t;
  3534. /********************************* policies.c ************************/
  3535. /** Outcome of applying an address policy to an address. */
  3536. typedef enum {
  3537. /** The address was accepted */
  3538. ADDR_POLICY_ACCEPTED=0,
  3539. /** The address was rejected */
  3540. ADDR_POLICY_REJECTED=-1,
  3541. /** Part of the address was unknown, but as far as we can tell, it was
  3542. * accepted. */
  3543. ADDR_POLICY_PROBABLY_ACCEPTED=1,
  3544. /** Part of the address was unknown, but as far as we can tell, it was
  3545. * rejected. */
  3546. ADDR_POLICY_PROBABLY_REJECTED=2,
  3547. } addr_policy_result_t;
  3548. /********************************* rephist.c ***************************/
  3549. /** Possible public/private key operations in Tor: used to keep track of where
  3550. * we're spending our time. */
  3551. typedef enum {
  3552. SIGN_DIR, SIGN_RTR,
  3553. VERIFY_DIR, VERIFY_RTR,
  3554. ENC_ONIONSKIN, DEC_ONIONSKIN,
  3555. TLS_HANDSHAKE_C, TLS_HANDSHAKE_S,
  3556. REND_CLIENT, REND_MID, REND_SERVER,
  3557. } pk_op_t;
  3558. /********************************* rendcommon.c ***************************/
  3559. /** Hidden-service side configuration of client authorization. */
  3560. typedef struct rend_authorized_client_t {
  3561. char *client_name;
  3562. uint8_t descriptor_cookie[REND_DESC_COOKIE_LEN];
  3563. crypto_pk_t *client_key;
  3564. } rend_authorized_client_t;
  3565. /** ASCII-encoded v2 hidden service descriptor. */
  3566. typedef struct rend_encoded_v2_service_descriptor_t {
  3567. char desc_id[DIGEST_LEN]; /**< Descriptor ID. */
  3568. char *desc_str; /**< Descriptor string. */
  3569. } rend_encoded_v2_service_descriptor_t;
  3570. /** The maximum number of non-circuit-build-timeout failures a hidden
  3571. * service client will tolerate while trying to build a circuit to an
  3572. * introduction point. See also rend_intro_point_t.unreachable_count. */
  3573. #define MAX_INTRO_POINT_REACHABILITY_FAILURES 5
  3574. /** The minimum and maximum number of distinct INTRODUCE2 cells which a
  3575. * hidden service's introduction point will receive before it begins to
  3576. * expire. */
  3577. #define INTRO_POINT_MIN_LIFETIME_INTRODUCTIONS 16384
  3578. /* Double the minimum value so the interval is [min, min * 2]. */
  3579. #define INTRO_POINT_MAX_LIFETIME_INTRODUCTIONS \
  3580. (INTRO_POINT_MIN_LIFETIME_INTRODUCTIONS * 2)
  3581. /** The minimum number of seconds that an introduction point will last
  3582. * before expiring due to old age. (If it receives
  3583. * INTRO_POINT_LIFETIME_INTRODUCTIONS INTRODUCE2 cells, it may expire
  3584. * sooner.)
  3585. *
  3586. * XXX Should this be configurable? */
  3587. #define INTRO_POINT_LIFETIME_MIN_SECONDS (18*60*60)
  3588. /** The maximum number of seconds that an introduction point will last
  3589. * before expiring due to old age.
  3590. *
  3591. * XXX Should this be configurable? */
  3592. #define INTRO_POINT_LIFETIME_MAX_SECONDS (24*60*60)
  3593. /** The maximum number of circuit creation retry we do to an intro point
  3594. * before giving up. We try to reuse intro point that fails during their
  3595. * lifetime so this is a hard limit on the amount of time we do that. */
  3596. #define MAX_INTRO_POINT_CIRCUIT_RETRIES 3
  3597. /** Introduction point information. Used both in rend_service_t (on
  3598. * the service side) and in rend_service_descriptor_t (on both the
  3599. * client and service side). */
  3600. typedef struct rend_intro_point_t {
  3601. extend_info_t *extend_info; /**< Extend info for connecting to this
  3602. * introduction point via a multi-hop path. */
  3603. crypto_pk_t *intro_key; /**< Introduction key that replaces the service
  3604. * key, if this descriptor is V2. */
  3605. /** (Client side only) Flag indicating that a timeout has occurred
  3606. * after sending an INTRODUCE cell to this intro point. After a
  3607. * timeout, an intro point should not be tried again during the same
  3608. * hidden service connection attempt, but it may be tried again
  3609. * during a future connection attempt. */
  3610. unsigned int timed_out : 1;
  3611. /** (Client side only) The number of times we have failed to build a
  3612. * circuit to this intro point for some reason other than our
  3613. * circuit-build timeout. See also MAX_INTRO_POINT_REACHABILITY_FAILURES. */
  3614. unsigned int unreachable_count : 3;
  3615. /** (Service side only) Flag indicating that this intro point was
  3616. * included in the last HS descriptor we generated. */
  3617. unsigned int listed_in_last_desc : 1;
  3618. /** (Service side only) A replay cache recording the RSA-encrypted parts
  3619. * of INTRODUCE2 cells this intro point's circuit has received. This is
  3620. * used to prevent replay attacks. */
  3621. replaycache_t *accepted_intro_rsa_parts;
  3622. /** (Service side only) Count of INTRODUCE2 cells accepted from this
  3623. * intro point.
  3624. */
  3625. int accepted_introduce2_count;
  3626. /** (Service side only) Maximum number of INTRODUCE2 cells that this IP
  3627. * will accept. This is a random value between
  3628. * INTRO_POINT_MIN_LIFETIME_INTRODUCTIONS and
  3629. * INTRO_POINT_MAX_LIFETIME_INTRODUCTIONS. */
  3630. int max_introductions;
  3631. /** (Service side only) The time at which this intro point was first
  3632. * published, or -1 if this intro point has not yet been
  3633. * published. */
  3634. time_t time_published;
  3635. /** (Service side only) The time at which this intro point should
  3636. * (start to) expire, or -1 if we haven't decided when this intro
  3637. * point should expire. */
  3638. time_t time_to_expire;
  3639. /** (Service side only) The amount of circuit creation we've made to this
  3640. * intro point. This is incremented every time we do a circuit relaunch on
  3641. * this object which is triggered when the circuit dies but the node is
  3642. * still in the consensus. After MAX_INTRO_POINT_CIRCUIT_RETRIES, we give
  3643. * up on it. */
  3644. unsigned int circuit_retries;
  3645. /** (Service side only) Set if this intro point has an established circuit
  3646. * and unset if it doesn't. */
  3647. unsigned int circuit_established:1;
  3648. } rend_intro_point_t;
  3649. #define REND_PROTOCOL_VERSION_BITMASK_WIDTH 16
  3650. /** Information used to connect to a hidden service. Used on both the
  3651. * service side and the client side. */
  3652. typedef struct rend_service_descriptor_t {
  3653. crypto_pk_t *pk; /**< This service's public key. */
  3654. int version; /**< Version of the descriptor format: 0 or 2. */
  3655. time_t timestamp; /**< Time when the descriptor was generated. */
  3656. /** Bitmask: which introduce/rendezvous protocols are supported?
  3657. * (We allow bits '0', '1', '2' and '3' to be set.) */
  3658. unsigned protocols : REND_PROTOCOL_VERSION_BITMASK_WIDTH;
  3659. /** List of the service's introduction points. Elements are removed if
  3660. * introduction attempts fail. */
  3661. smartlist_t *intro_nodes;
  3662. /** Has descriptor been uploaded to all hidden service directories? */
  3663. int all_uploads_performed;
  3664. /** List of hidden service directories to which an upload request for
  3665. * this descriptor could be sent. Smartlist exists only when at least one
  3666. * of the previous upload requests failed (otherwise it's not important
  3667. * to know which uploads succeeded and which not). */
  3668. smartlist_t *successful_uploads;
  3669. } rend_service_descriptor_t;
  3670. /********************************* routerlist.c ***************************/
  3671. typedef struct dir_server_t dir_server_t;
  3672. #define RELAY_REQUIRED_MIN_BANDWIDTH (75*1024)
  3673. #define BRIDGE_REQUIRED_MIN_BANDWIDTH (50*1024)
  3674. #define ROUTER_MAX_DECLARED_BANDWIDTH INT32_MAX
  3675. /* Flags for pick_directory_server() and pick_trusteddirserver(). */
  3676. /** Flag to indicate that we should not automatically be willing to use
  3677. * ourself to answer a directory request.
  3678. * Passed to router_pick_directory_server (et al).*/
  3679. #define PDS_ALLOW_SELF (1<<0)
  3680. /** Flag to indicate that if no servers seem to be up, we should mark all
  3681. * directory servers as up and try again.
  3682. * Passed to router_pick_directory_server (et al).*/
  3683. #define PDS_RETRY_IF_NO_SERVERS (1<<1)
  3684. /** Flag to indicate that we should not exclude directory servers that
  3685. * our ReachableAddress settings would exclude. This usually means that
  3686. * we're going to connect to the server over Tor, and so we don't need to
  3687. * worry about our firewall telling us we can't.
  3688. * Passed to router_pick_directory_server (et al).*/
  3689. #define PDS_IGNORE_FASCISTFIREWALL (1<<2)
  3690. /** Flag to indicate that we should not use any directory authority to which
  3691. * we have an existing directory connection for downloading server descriptors
  3692. * or extrainfo documents.
  3693. *
  3694. * Passed to router_pick_directory_server (et al)
  3695. */
  3696. #define PDS_NO_EXISTING_SERVERDESC_FETCH (1<<3)
  3697. /** Flag to indicate that we should not use any directory authority to which
  3698. * we have an existing directory connection for downloading microdescs.
  3699. *
  3700. * Passed to router_pick_directory_server (et al)
  3701. */
  3702. #define PDS_NO_EXISTING_MICRODESC_FETCH (1<<4)
  3703. /** Possible ways to weight routers when choosing one randomly. See
  3704. * routerlist_sl_choose_by_bandwidth() for more information.*/
  3705. typedef enum bandwidth_weight_rule_t {
  3706. NO_WEIGHTING, WEIGHT_FOR_EXIT, WEIGHT_FOR_MID, WEIGHT_FOR_GUARD,
  3707. WEIGHT_FOR_DIR
  3708. } bandwidth_weight_rule_t;
  3709. /** Flags to be passed to control router_choose_random_node() to indicate what
  3710. * kind of nodes to pick according to what algorithm. */
  3711. typedef enum {
  3712. CRN_NEED_UPTIME = 1<<0,
  3713. CRN_NEED_CAPACITY = 1<<1,
  3714. CRN_NEED_GUARD = 1<<2,
  3715. /* XXXX not used, apparently. */
  3716. CRN_WEIGHT_AS_EXIT = 1<<5,
  3717. CRN_NEED_DESC = 1<<6,
  3718. /* On clients, only provide nodes that satisfy ClientPreferIPv6OR */
  3719. CRN_PREF_ADDR = 1<<7,
  3720. /* On clients, only provide nodes that we can connect to directly, based on
  3721. * our firewall rules */
  3722. CRN_DIRECT_CONN = 1<<8,
  3723. /* On clients, only provide nodes with HSRend >= 2 protocol version which
  3724. * is required for hidden service version >= 3. */
  3725. CRN_RENDEZVOUS_V3 = 1<<9,
  3726. } router_crn_flags_t;
  3727. /** Return value for router_add_to_routerlist() and dirserv_add_descriptor() */
  3728. typedef enum was_router_added_t {
  3729. /* Router was added successfully. */
  3730. ROUTER_ADDED_SUCCESSFULLY = 1,
  3731. /* Extrainfo document was rejected because no corresponding router
  3732. * descriptor was found OR router descriptor was rejected because
  3733. * it was incompatible with its extrainfo document. */
  3734. ROUTER_BAD_EI = -1,
  3735. /* Router descriptor was rejected because it is already known. */
  3736. ROUTER_IS_ALREADY_KNOWN = -2,
  3737. /* General purpose router was rejected, because it was not listed
  3738. * in consensus. */
  3739. ROUTER_NOT_IN_CONSENSUS = -3,
  3740. /* Router was neither in directory consensus nor in any of
  3741. * networkstatus documents. Caching it to access later.
  3742. * (Applies to fetched descriptors only.) */
  3743. ROUTER_NOT_IN_CONSENSUS_OR_NETWORKSTATUS = -4,
  3744. /* Router was rejected by directory authority. */
  3745. ROUTER_AUTHDIR_REJECTS = -5,
  3746. /* Bridge descriptor was rejected because such bridge was not one
  3747. * of the bridges we have listed in our configuration. */
  3748. ROUTER_WAS_NOT_WANTED = -6,
  3749. /* Router descriptor was rejected because it was older than
  3750. * OLD_ROUTER_DESC_MAX_AGE. */
  3751. ROUTER_WAS_TOO_OLD = -7, /* note contrast with 'NOT_NEW' */
  3752. /* DOCDOC */
  3753. ROUTER_CERTS_EXPIRED = -8
  3754. } was_router_added_t;
  3755. /********************************* routerparse.c ************************/
  3756. #define MAX_STATUS_TAG_LEN 32
  3757. /** Structure to hold parsed Tor versions. This is a little messier
  3758. * than we would like it to be, because we changed version schemes with 0.1.0.
  3759. *
  3760. * See version-spec.txt for the whole business.
  3761. */
  3762. typedef struct tor_version_t {
  3763. int major;
  3764. int minor;
  3765. int micro;
  3766. /** Release status. For version in the post-0.1 format, this is always
  3767. * VER_RELEASE. */
  3768. enum { VER_PRE=0, VER_RC=1, VER_RELEASE=2, } status;
  3769. int patchlevel;
  3770. char status_tag[MAX_STATUS_TAG_LEN];
  3771. int svn_revision;
  3772. int git_tag_len;
  3773. char git_tag[DIGEST_LEN];
  3774. } tor_version_t;
  3775. #endif /* !defined(TOR_OR_H) */