routerlist.c 169 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001
  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-2014, The Tor Project, Inc. */
  5. /* See LICENSE for licensing information */
  6. /**
  7. * \file routerlist.c
  8. * \brief Code to
  9. * maintain and access the global list of routerinfos for known
  10. * servers.
  11. **/
  12. #define ROUTERLIST_PRIVATE
  13. #include "or.h"
  14. #include "circuitstats.h"
  15. #include "config.h"
  16. #include "connection.h"
  17. #include "control.h"
  18. #include "directory.h"
  19. #include "dirserv.h"
  20. #include "dirvote.h"
  21. #include "entrynodes.h"
  22. #include "fp_pair.h"
  23. #include "geoip.h"
  24. #include "hibernate.h"
  25. #include "main.h"
  26. #include "microdesc.h"
  27. #include "networkstatus.h"
  28. #include "nodelist.h"
  29. #include "policies.h"
  30. #include "reasons.h"
  31. #include "rendcommon.h"
  32. #include "rendservice.h"
  33. #include "rephist.h"
  34. #include "router.h"
  35. #include "routerlist.h"
  36. #include "routerparse.h"
  37. #include "routerset.h"
  38. #include "../common/sandbox.h"
  39. // #define DEBUG_ROUTERLIST
  40. /****************************************************************************/
  41. DECLARE_TYPED_DIGESTMAP_FNS(sdmap_, digest_sd_map_t, signed_descriptor_t)
  42. DECLARE_TYPED_DIGESTMAP_FNS(rimap_, digest_ri_map_t, routerinfo_t)
  43. DECLARE_TYPED_DIGESTMAP_FNS(eimap_, digest_ei_map_t, extrainfo_t)
  44. DECLARE_TYPED_DIGESTMAP_FNS(dsmap_, digest_ds_map_t, download_status_t)
  45. #define SDMAP_FOREACH(map, keyvar, valvar) \
  46. DIGESTMAP_FOREACH(sdmap_to_digestmap(map), keyvar, signed_descriptor_t *, \
  47. valvar)
  48. #define RIMAP_FOREACH(map, keyvar, valvar) \
  49. DIGESTMAP_FOREACH(rimap_to_digestmap(map), keyvar, routerinfo_t *, valvar)
  50. #define EIMAP_FOREACH(map, keyvar, valvar) \
  51. DIGESTMAP_FOREACH(eimap_to_digestmap(map), keyvar, extrainfo_t *, valvar)
  52. #define DSMAP_FOREACH(map, keyvar, valvar) \
  53. DIGESTMAP_FOREACH(dsmap_to_digestmap(map), keyvar, download_status_t *, \
  54. valvar)
  55. /* Forward declaration for cert_list_t */
  56. typedef struct cert_list_t cert_list_t;
  57. /* static function prototypes */
  58. static int compute_weighted_bandwidths(const smartlist_t *sl,
  59. bandwidth_weight_rule_t rule,
  60. u64_dbl_t **bandwidths_out);
  61. static const routerstatus_t *router_pick_directory_server_impl(
  62. dirinfo_type_t auth, int flags);
  63. static const routerstatus_t *router_pick_trusteddirserver_impl(
  64. const smartlist_t *sourcelist, dirinfo_type_t auth,
  65. int flags, int *n_busy_out);
  66. static const routerstatus_t *router_pick_dirserver_generic(
  67. smartlist_t *sourcelist,
  68. dirinfo_type_t type, int flags);
  69. static void mark_all_dirservers_up(smartlist_t *server_list);
  70. static void dir_server_free(dir_server_t *ds);
  71. static int signed_desc_digest_is_recognized(signed_descriptor_t *desc);
  72. static const char *signed_descriptor_get_body_impl(
  73. const signed_descriptor_t *desc,
  74. int with_annotations);
  75. static void list_pending_downloads(digestmap_t *result,
  76. digest256map_t *result256,
  77. int purpose, const char *prefix);
  78. static void list_pending_fpsk_downloads(fp_pair_map_t *result);
  79. static void launch_dummy_descriptor_download_as_needed(time_t now,
  80. const or_options_t *options);
  81. static void download_status_reset_by_sk_in_cl(cert_list_t *cl,
  82. const char *digest);
  83. static int download_status_is_ready_by_sk_in_cl(cert_list_t *cl,
  84. const char *digest,
  85. time_t now, int max_failures);
  86. /****************************************************************************/
  87. /** Global list of a dir_server_t object for each directory
  88. * authority. */
  89. static smartlist_t *trusted_dir_servers = NULL;
  90. /** Global list of dir_server_t objects for all directory authorities
  91. * and all fallback directory servers. */
  92. static smartlist_t *fallback_dir_servers = NULL;
  93. /** List of certificates for a single authority, and download status for
  94. * latest certificate.
  95. */
  96. struct cert_list_t {
  97. /*
  98. * The keys of download status map are cert->signing_key_digest for pending
  99. * downloads by (identity digest/signing key digest) pair; functions such
  100. * as authority_cert_get_by_digest() already assume these are unique.
  101. */
  102. struct digest_ds_map_t *dl_status_map;
  103. /* There is also a dlstatus for the download by identity key only */
  104. download_status_t dl_status_by_id;
  105. smartlist_t *certs;
  106. };
  107. /** Map from v3 identity key digest to cert_list_t. */
  108. static digestmap_t *trusted_dir_certs = NULL;
  109. /** True iff any key certificate in at least one member of
  110. * <b>trusted_dir_certs</b> has changed since we last flushed the
  111. * certificates to disk. */
  112. static int trusted_dir_servers_certs_changed = 0;
  113. /** Global list of all of the routers that we know about. */
  114. static routerlist_t *routerlist = NULL;
  115. /** List of strings for nicknames we've already warned about and that are
  116. * still unknown / unavailable. */
  117. static smartlist_t *warned_nicknames = NULL;
  118. /** The last time we tried to download any routerdesc, or 0 for "never". We
  119. * use this to rate-limit download attempts when the number of routerdescs to
  120. * download is low. */
  121. static time_t last_descriptor_download_attempted = 0;
  122. /** Return the number of directory authorities whose type matches some bit set
  123. * in <b>type</b> */
  124. int
  125. get_n_authorities(dirinfo_type_t type)
  126. {
  127. int n = 0;
  128. if (!trusted_dir_servers)
  129. return 0;
  130. SMARTLIST_FOREACH(trusted_dir_servers, dir_server_t *, ds,
  131. if (ds->type & type)
  132. ++n);
  133. return n;
  134. }
  135. /** Reset the download status of a specified element in a dsmap */
  136. static void
  137. download_status_reset_by_sk_in_cl(cert_list_t *cl, const char *digest)
  138. {
  139. download_status_t *dlstatus = NULL;
  140. tor_assert(cl);
  141. tor_assert(digest);
  142. /* Make sure we have a dsmap */
  143. if (!(cl->dl_status_map)) {
  144. cl->dl_status_map = dsmap_new();
  145. }
  146. /* Look for a download_status_t in the map with this digest */
  147. dlstatus = dsmap_get(cl->dl_status_map, digest);
  148. /* Got one? */
  149. if (!dlstatus) {
  150. /* Insert before we reset */
  151. dlstatus = tor_malloc_zero(sizeof(*dlstatus));
  152. dsmap_set(cl->dl_status_map, digest, dlstatus);
  153. }
  154. tor_assert(dlstatus);
  155. /* Go ahead and reset it */
  156. download_status_reset(dlstatus);
  157. }
  158. /**
  159. * Return true if the download for this signing key digest in cl is ready
  160. * to be re-attempted.
  161. */
  162. static int
  163. download_status_is_ready_by_sk_in_cl(cert_list_t *cl,
  164. const char *digest,
  165. time_t now, int max_failures)
  166. {
  167. int rv = 0;
  168. download_status_t *dlstatus = NULL;
  169. tor_assert(cl);
  170. tor_assert(digest);
  171. /* Make sure we have a dsmap */
  172. if (!(cl->dl_status_map)) {
  173. cl->dl_status_map = dsmap_new();
  174. }
  175. /* Look for a download_status_t in the map with this digest */
  176. dlstatus = dsmap_get(cl->dl_status_map, digest);
  177. /* Got one? */
  178. if (dlstatus) {
  179. /* Use download_status_is_ready() */
  180. rv = download_status_is_ready(dlstatus, now, max_failures);
  181. } else {
  182. /*
  183. * If we don't know anything about it, return 1, since we haven't
  184. * tried this one before. We need to create a new entry here,
  185. * too.
  186. */
  187. dlstatus = tor_malloc_zero(sizeof(*dlstatus));
  188. download_status_reset(dlstatus);
  189. dsmap_set(cl->dl_status_map, digest, dlstatus);
  190. rv = 1;
  191. }
  192. return rv;
  193. }
  194. /** Helper: Return the cert_list_t for an authority whose authority ID is
  195. * <b>id_digest</b>, allocating a new list if necessary. */
  196. static cert_list_t *
  197. get_cert_list(const char *id_digest)
  198. {
  199. cert_list_t *cl;
  200. if (!trusted_dir_certs)
  201. trusted_dir_certs = digestmap_new();
  202. cl = digestmap_get(trusted_dir_certs, id_digest);
  203. if (!cl) {
  204. cl = tor_malloc_zero(sizeof(cert_list_t));
  205. cl->dl_status_by_id.schedule = DL_SCHED_CONSENSUS;
  206. cl->certs = smartlist_new();
  207. cl->dl_status_map = dsmap_new();
  208. digestmap_set(trusted_dir_certs, id_digest, cl);
  209. }
  210. return cl;
  211. }
  212. /** Release all space held by a cert_list_t */
  213. static void
  214. cert_list_free(cert_list_t *cl)
  215. {
  216. if (!cl)
  217. return;
  218. SMARTLIST_FOREACH(cl->certs, authority_cert_t *, cert,
  219. authority_cert_free(cert));
  220. smartlist_free(cl->certs);
  221. dsmap_free(cl->dl_status_map, tor_free_);
  222. tor_free(cl);
  223. }
  224. /** Wrapper for cert_list_free so we can pass it to digestmap_free */
  225. static void
  226. cert_list_free_(void *cl)
  227. {
  228. cert_list_free(cl);
  229. }
  230. /** Reload the cached v3 key certificates from the cached-certs file in
  231. * the data directory. Return 0 on success, -1 on failure. */
  232. int
  233. trusted_dirs_reload_certs(void)
  234. {
  235. char *filename;
  236. char *contents;
  237. int r;
  238. filename = get_datadir_fname("cached-certs");
  239. contents = read_file_to_str(filename, RFTS_IGNORE_MISSING, NULL);
  240. tor_free(filename);
  241. if (!contents)
  242. return 0;
  243. r = trusted_dirs_load_certs_from_string(
  244. contents,
  245. TRUSTED_DIRS_CERTS_SRC_FROM_STORE, 1);
  246. tor_free(contents);
  247. return r;
  248. }
  249. /** Helper: return true iff we already have loaded the exact cert
  250. * <b>cert</b>. */
  251. static INLINE int
  252. already_have_cert(authority_cert_t *cert)
  253. {
  254. cert_list_t *cl = get_cert_list(cert->cache_info.identity_digest);
  255. SMARTLIST_FOREACH(cl->certs, authority_cert_t *, c,
  256. {
  257. if (tor_memeq(c->cache_info.signed_descriptor_digest,
  258. cert->cache_info.signed_descriptor_digest,
  259. DIGEST_LEN))
  260. return 1;
  261. });
  262. return 0;
  263. }
  264. /** Load a bunch of new key certificates from the string <b>contents</b>. If
  265. * <b>source</b> is TRUSTED_DIRS_CERTS_SRC_FROM_STORE, the certificates are
  266. * from the cache, and we don't need to flush them to disk. If we are a
  267. * dirauth loading our own cert, source is TRUSTED_DIRS_CERTS_SRC_SELF.
  268. * Otherwise, source is download type: TRUSTED_DIRS_CERTS_SRC_DL_BY_ID_DIGEST
  269. * or TRUSTED_DIRS_CERTS_SRC_DL_BY_ID_SK_DIGEST. If <b>flush</b> is true, we
  270. * need to flush any changed certificates to disk now. Return 0 on success,
  271. * -1 if any certs fail to parse.
  272. */
  273. int
  274. trusted_dirs_load_certs_from_string(const char *contents, int source,
  275. int flush)
  276. {
  277. dir_server_t *ds;
  278. const char *s, *eos;
  279. int failure_code = 0;
  280. int from_store = (source == TRUSTED_DIRS_CERTS_SRC_FROM_STORE);
  281. for (s = contents; *s; s = eos) {
  282. authority_cert_t *cert = authority_cert_parse_from_string(s, &eos);
  283. cert_list_t *cl;
  284. if (!cert) {
  285. failure_code = -1;
  286. break;
  287. }
  288. ds = trusteddirserver_get_by_v3_auth_digest(
  289. cert->cache_info.identity_digest);
  290. log_debug(LD_DIR, "Parsed certificate for %s",
  291. ds ? ds->nickname : "unknown authority");
  292. if (already_have_cert(cert)) {
  293. /* we already have this one. continue. */
  294. log_info(LD_DIR, "Skipping %s certificate for %s that we "
  295. "already have.",
  296. from_store ? "cached" : "downloaded",
  297. ds ? ds->nickname : "an old or new authority");
  298. /*
  299. * A duplicate on download should be treated as a failure, so we call
  300. * authority_cert_dl_failed() to reset the download status to make sure
  301. * we can't try again. Since we've implemented the fp-sk mechanism
  302. * to download certs by signing key, this should be much rarer than it
  303. * was and is perhaps cause for concern.
  304. */
  305. if (!from_store) {
  306. if (authdir_mode(get_options())) {
  307. log_warn(LD_DIR,
  308. "Got a certificate for %s, but we already have it. "
  309. "Maybe they haven't updated it. Waiting for a while.",
  310. ds ? ds->nickname : "an old or new authority");
  311. } else {
  312. log_info(LD_DIR,
  313. "Got a certificate for %s, but we already have it. "
  314. "Maybe they haven't updated it. Waiting for a while.",
  315. ds ? ds->nickname : "an old or new authority");
  316. }
  317. /*
  318. * This is where we care about the source; authority_cert_dl_failed()
  319. * needs to know whether the download was by fp or (fp,sk) pair to
  320. * twiddle the right bit in the download map.
  321. */
  322. if (source == TRUSTED_DIRS_CERTS_SRC_DL_BY_ID_DIGEST) {
  323. authority_cert_dl_failed(cert->cache_info.identity_digest,
  324. NULL, 404);
  325. } else if (source == TRUSTED_DIRS_CERTS_SRC_DL_BY_ID_SK_DIGEST) {
  326. authority_cert_dl_failed(cert->cache_info.identity_digest,
  327. cert->signing_key_digest, 404);
  328. }
  329. }
  330. authority_cert_free(cert);
  331. continue;
  332. }
  333. if (ds) {
  334. log_info(LD_DIR, "Adding %s certificate for directory authority %s with "
  335. "signing key %s", from_store ? "cached" : "downloaded",
  336. ds->nickname, hex_str(cert->signing_key_digest,DIGEST_LEN));
  337. } else {
  338. int adding = directory_caches_unknown_auth_certs(get_options());
  339. log_info(LD_DIR, "%s %s certificate for unrecognized directory "
  340. "authority with signing key %s",
  341. adding ? "Adding" : "Not adding",
  342. from_store ? "cached" : "downloaded",
  343. hex_str(cert->signing_key_digest,DIGEST_LEN));
  344. if (!adding) {
  345. authority_cert_free(cert);
  346. continue;
  347. }
  348. }
  349. cl = get_cert_list(cert->cache_info.identity_digest);
  350. smartlist_add(cl->certs, cert);
  351. if (ds && cert->cache_info.published_on > ds->addr_current_at) {
  352. /* Check to see whether we should update our view of the authority's
  353. * address. */
  354. if (cert->addr && cert->dir_port &&
  355. (ds->addr != cert->addr ||
  356. ds->dir_port != cert->dir_port)) {
  357. char *a = tor_dup_ip(cert->addr);
  358. log_notice(LD_DIR, "Updating address for directory authority %s "
  359. "from %s:%d to %s:%d based on certificate.",
  360. ds->nickname, ds->address, (int)ds->dir_port,
  361. a, cert->dir_port);
  362. tor_free(a);
  363. ds->addr = cert->addr;
  364. ds->dir_port = cert->dir_port;
  365. }
  366. ds->addr_current_at = cert->cache_info.published_on;
  367. }
  368. if (!from_store)
  369. trusted_dir_servers_certs_changed = 1;
  370. }
  371. if (flush)
  372. trusted_dirs_flush_certs_to_disk();
  373. /* call this even if failure_code is <0, since some certs might have
  374. * succeeded. */
  375. networkstatus_note_certs_arrived();
  376. return failure_code;
  377. }
  378. /** Save all v3 key certificates to the cached-certs file. */
  379. void
  380. trusted_dirs_flush_certs_to_disk(void)
  381. {
  382. char *filename;
  383. smartlist_t *chunks;
  384. if (!trusted_dir_servers_certs_changed || !trusted_dir_certs)
  385. return;
  386. chunks = smartlist_new();
  387. DIGESTMAP_FOREACH(trusted_dir_certs, key, cert_list_t *, cl) {
  388. SMARTLIST_FOREACH(cl->certs, authority_cert_t *, cert,
  389. {
  390. sized_chunk_t *c = tor_malloc(sizeof(sized_chunk_t));
  391. c->bytes = cert->cache_info.signed_descriptor_body;
  392. c->len = cert->cache_info.signed_descriptor_len;
  393. smartlist_add(chunks, c);
  394. });
  395. } DIGESTMAP_FOREACH_END;
  396. filename = get_datadir_fname("cached-certs");
  397. if (write_chunks_to_file(filename, chunks, 0, 0)) {
  398. log_warn(LD_FS, "Error writing certificates to disk.");
  399. }
  400. tor_free(filename);
  401. SMARTLIST_FOREACH(chunks, sized_chunk_t *, c, tor_free(c));
  402. smartlist_free(chunks);
  403. trusted_dir_servers_certs_changed = 0;
  404. }
  405. /** Remove all expired v3 authority certificates that have been superseded for
  406. * more than 48 hours or, if not expired, that were published more than 7 days
  407. * before being superseded. (If the most recent cert was published more than 48
  408. * hours ago, then we aren't going to get any consensuses signed with older
  409. * keys.) */
  410. static void
  411. trusted_dirs_remove_old_certs(void)
  412. {
  413. time_t now = time(NULL);
  414. #define DEAD_CERT_LIFETIME (2*24*60*60)
  415. #define OLD_CERT_LIFETIME (7*24*60*60)
  416. if (!trusted_dir_certs)
  417. return;
  418. DIGESTMAP_FOREACH(trusted_dir_certs, key, cert_list_t *, cl) {
  419. authority_cert_t *newest = NULL;
  420. SMARTLIST_FOREACH(cl->certs, authority_cert_t *, cert,
  421. if (!newest || (cert->cache_info.published_on >
  422. newest->cache_info.published_on))
  423. newest = cert);
  424. if (newest) {
  425. const time_t newest_published = newest->cache_info.published_on;
  426. SMARTLIST_FOREACH_BEGIN(cl->certs, authority_cert_t *, cert) {
  427. int expired;
  428. time_t cert_published;
  429. if (newest == cert)
  430. continue;
  431. /* resolve spurious clang shallow analysis null pointer errors */
  432. tor_assert(cert);
  433. expired = now > cert->expires;
  434. cert_published = cert->cache_info.published_on;
  435. /* Store expired certs for 48 hours after a newer arrives;
  436. */
  437. if (expired ?
  438. (newest_published + DEAD_CERT_LIFETIME < now) :
  439. (cert_published + OLD_CERT_LIFETIME < newest_published)) {
  440. SMARTLIST_DEL_CURRENT(cl->certs, cert);
  441. authority_cert_free(cert);
  442. trusted_dir_servers_certs_changed = 1;
  443. }
  444. } SMARTLIST_FOREACH_END(cert);
  445. }
  446. } DIGESTMAP_FOREACH_END;
  447. #undef DEAD_CERT_LIFETIME
  448. #undef OLD_CERT_LIFETIME
  449. trusted_dirs_flush_certs_to_disk();
  450. }
  451. /** Return the newest v3 authority certificate whose v3 authority identity key
  452. * has digest <b>id_digest</b>. Return NULL if no such authority is known,
  453. * or it has no certificate. */
  454. authority_cert_t *
  455. authority_cert_get_newest_by_id(const char *id_digest)
  456. {
  457. cert_list_t *cl;
  458. authority_cert_t *best = NULL;
  459. if (!trusted_dir_certs ||
  460. !(cl = digestmap_get(trusted_dir_certs, id_digest)))
  461. return NULL;
  462. SMARTLIST_FOREACH(cl->certs, authority_cert_t *, cert,
  463. {
  464. if (!best || cert->cache_info.published_on > best->cache_info.published_on)
  465. best = cert;
  466. });
  467. return best;
  468. }
  469. /** Return the newest v3 authority certificate whose directory signing key has
  470. * digest <b>sk_digest</b>. Return NULL if no such certificate is known.
  471. */
  472. authority_cert_t *
  473. authority_cert_get_by_sk_digest(const char *sk_digest)
  474. {
  475. authority_cert_t *c;
  476. if (!trusted_dir_certs)
  477. return NULL;
  478. if ((c = get_my_v3_authority_cert()) &&
  479. tor_memeq(c->signing_key_digest, sk_digest, DIGEST_LEN))
  480. return c;
  481. if ((c = get_my_v3_legacy_cert()) &&
  482. tor_memeq(c->signing_key_digest, sk_digest, DIGEST_LEN))
  483. return c;
  484. DIGESTMAP_FOREACH(trusted_dir_certs, key, cert_list_t *, cl) {
  485. SMARTLIST_FOREACH(cl->certs, authority_cert_t *, cert,
  486. {
  487. if (tor_memeq(cert->signing_key_digest, sk_digest, DIGEST_LEN))
  488. return cert;
  489. });
  490. } DIGESTMAP_FOREACH_END;
  491. return NULL;
  492. }
  493. /** Return the v3 authority certificate with signing key matching
  494. * <b>sk_digest</b>, for the authority with identity digest <b>id_digest</b>.
  495. * Return NULL if no such authority is known. */
  496. authority_cert_t *
  497. authority_cert_get_by_digests(const char *id_digest,
  498. const char *sk_digest)
  499. {
  500. cert_list_t *cl;
  501. if (!trusted_dir_certs ||
  502. !(cl = digestmap_get(trusted_dir_certs, id_digest)))
  503. return NULL;
  504. SMARTLIST_FOREACH(cl->certs, authority_cert_t *, cert,
  505. if (tor_memeq(cert->signing_key_digest, sk_digest, DIGEST_LEN))
  506. return cert; );
  507. return NULL;
  508. }
  509. /** Add every known authority_cert_t to <b>certs_out</b>. */
  510. void
  511. authority_cert_get_all(smartlist_t *certs_out)
  512. {
  513. tor_assert(certs_out);
  514. if (!trusted_dir_certs)
  515. return;
  516. DIGESTMAP_FOREACH(trusted_dir_certs, key, cert_list_t *, cl) {
  517. SMARTLIST_FOREACH(cl->certs, authority_cert_t *, c,
  518. smartlist_add(certs_out, c));
  519. } DIGESTMAP_FOREACH_END;
  520. }
  521. /** Called when an attempt to download a certificate with the authority with
  522. * ID <b>id_digest</b> and, if not NULL, signed with key signing_key_digest
  523. * fails with HTTP response code <b>status</b>: remember the failure, so we
  524. * don't try again immediately. */
  525. void
  526. authority_cert_dl_failed(const char *id_digest,
  527. const char *signing_key_digest, int status)
  528. {
  529. cert_list_t *cl;
  530. download_status_t *dlstatus = NULL;
  531. char id_digest_str[2*DIGEST_LEN+1];
  532. char sk_digest_str[2*DIGEST_LEN+1];
  533. if (!trusted_dir_certs ||
  534. !(cl = digestmap_get(trusted_dir_certs, id_digest)))
  535. return;
  536. /*
  537. * Are we noting a failed download of the latest cert for the id digest,
  538. * or of a download by (id, signing key) digest pair?
  539. */
  540. if (!signing_key_digest) {
  541. /* Just by id digest */
  542. download_status_failed(&cl->dl_status_by_id, status);
  543. } else {
  544. /* Reset by (id, signing key) digest pair
  545. *
  546. * Look for a download_status_t in the map with this digest
  547. */
  548. dlstatus = dsmap_get(cl->dl_status_map, signing_key_digest);
  549. /* Got one? */
  550. if (dlstatus) {
  551. download_status_failed(dlstatus, status);
  552. } else {
  553. /*
  554. * Do this rather than hex_str(), since hex_str clobbers
  555. * old results and we call twice in the param list.
  556. */
  557. base16_encode(id_digest_str, sizeof(id_digest_str),
  558. id_digest, DIGEST_LEN);
  559. base16_encode(sk_digest_str, sizeof(sk_digest_str),
  560. signing_key_digest, DIGEST_LEN);
  561. log_warn(LD_BUG,
  562. "Got failure for cert fetch with (fp,sk) = (%s,%s), with "
  563. "status %d, but knew nothing about the download.",
  564. id_digest_str, sk_digest_str, status);
  565. }
  566. }
  567. }
  568. static const char *BAD_SIGNING_KEYS[] = {
  569. "09CD84F751FD6E955E0F8ADB497D5401470D697E", // Expires 2015-01-11 16:26:31
  570. "0E7E9C07F0969D0468AD741E172A6109DC289F3C", // Expires 2014-08-12 10:18:26
  571. "57B85409891D3FB32137F642FDEDF8B7F8CDFDCD", // Expires 2015-02-11 17:19:09
  572. "87326329007AF781F587AF5B594E540B2B6C7630", // Expires 2014-07-17 11:10:09
  573. "98CC82342DE8D298CF99D3F1A396475901E0D38E", // Expires 2014-11-10 13:18:56
  574. "9904B52336713A5ADCB13E4FB14DC919E0D45571", // Expires 2014-04-20 20:01:01
  575. "9DCD8E3F1DD1597E2AD476BBA28A1A89F3095227", // Expires 2015-01-16 03:52:30
  576. "A61682F34B9BB9694AC98491FE1ABBFE61923941", // Expires 2014-06-11 09:25:09
  577. "B59F6E99C575113650C99F1C425BA7B20A8C071D", // Expires 2014-07-31 13:22:10
  578. "D27178388FA75B96D37FA36E0B015227DDDBDA51", // Expires 2014-08-04 04:01:57
  579. NULL,
  580. };
  581. /** DOCDOC */
  582. int
  583. authority_cert_is_blacklisted(const authority_cert_t *cert)
  584. {
  585. char hex_digest[HEX_DIGEST_LEN+1];
  586. int i;
  587. base16_encode(hex_digest, sizeof(hex_digest),
  588. cert->signing_key_digest, sizeof(cert->signing_key_digest));
  589. for (i = 0; BAD_SIGNING_KEYS[i]; ++i) {
  590. if (!strcasecmp(hex_digest, BAD_SIGNING_KEYS[i])) {
  591. return 1;
  592. }
  593. }
  594. return 0;
  595. }
  596. /** Return true iff when we've been getting enough failures when trying to
  597. * download the certificate with ID digest <b>id_digest</b> that we're willing
  598. * to start bugging the user about it. */
  599. int
  600. authority_cert_dl_looks_uncertain(const char *id_digest)
  601. {
  602. #define N_AUTH_CERT_DL_FAILURES_TO_BUG_USER 2
  603. cert_list_t *cl;
  604. int n_failures;
  605. if (!trusted_dir_certs ||
  606. !(cl = digestmap_get(trusted_dir_certs, id_digest)))
  607. return 0;
  608. n_failures = download_status_get_n_failures(&cl->dl_status_by_id);
  609. return n_failures >= N_AUTH_CERT_DL_FAILURES_TO_BUG_USER;
  610. }
  611. /** Try to download any v3 authority certificates that we may be missing. If
  612. * <b>status</b> is provided, try to get all the ones that were used to sign
  613. * <b>status</b>. Additionally, try to have a non-expired certificate for
  614. * every V3 authority in trusted_dir_servers. Don't fetch certificates we
  615. * already have.
  616. **/
  617. void
  618. authority_certs_fetch_missing(networkstatus_t *status, time_t now)
  619. {
  620. /*
  621. * The pending_id digestmap tracks pending certificate downloads by
  622. * identity digest; the pending_cert digestmap tracks pending downloads
  623. * by (identity digest, signing key digest) pairs.
  624. */
  625. digestmap_t *pending_id;
  626. fp_pair_map_t *pending_cert;
  627. authority_cert_t *cert;
  628. /*
  629. * The missing_id_digests smartlist will hold a list of id digests
  630. * we want to fetch the newest cert for; the missing_cert_digests
  631. * smartlist will hold a list of fp_pair_t with an identity and
  632. * signing key digest.
  633. */
  634. smartlist_t *missing_cert_digests, *missing_id_digests;
  635. char *resource = NULL;
  636. cert_list_t *cl;
  637. const int cache = directory_caches_unknown_auth_certs(get_options());
  638. fp_pair_t *fp_tmp = NULL;
  639. char id_digest_str[2*DIGEST_LEN+1];
  640. char sk_digest_str[2*DIGEST_LEN+1];
  641. if (should_delay_dir_fetches(get_options(), NULL))
  642. return;
  643. pending_cert = fp_pair_map_new();
  644. pending_id = digestmap_new();
  645. missing_cert_digests = smartlist_new();
  646. missing_id_digests = smartlist_new();
  647. /*
  648. * First, we get the lists of already pending downloads so we don't
  649. * duplicate effort.
  650. */
  651. list_pending_downloads(pending_id, NULL,
  652. DIR_PURPOSE_FETCH_CERTIFICATE, "fp/");
  653. list_pending_fpsk_downloads(pending_cert);
  654. /*
  655. * Now, we download any trusted authority certs we don't have by
  656. * identity digest only. This gets the latest cert for that authority.
  657. */
  658. SMARTLIST_FOREACH_BEGIN(trusted_dir_servers, dir_server_t *, ds) {
  659. int found = 0;
  660. if (!(ds->type & V3_DIRINFO))
  661. continue;
  662. if (smartlist_contains_digest(missing_id_digests,
  663. ds->v3_identity_digest))
  664. continue;
  665. cl = get_cert_list(ds->v3_identity_digest);
  666. SMARTLIST_FOREACH_BEGIN(cl->certs, authority_cert_t *, cert) {
  667. if (now < cert->expires) {
  668. /* It's not expired, and we weren't looking for something to
  669. * verify a consensus with. Call it done. */
  670. download_status_reset(&(cl->dl_status_by_id));
  671. /* No sense trying to download it specifically by signing key hash */
  672. download_status_reset_by_sk_in_cl(cl, cert->signing_key_digest);
  673. found = 1;
  674. break;
  675. }
  676. } SMARTLIST_FOREACH_END(cert);
  677. if (!found &&
  678. download_status_is_ready(&(cl->dl_status_by_id), now,
  679. get_options()->TestingCertMaxDownloadTries) &&
  680. !digestmap_get(pending_id, ds->v3_identity_digest)) {
  681. log_info(LD_DIR,
  682. "No current certificate known for authority %s "
  683. "(ID digest %s); launching request.",
  684. ds->nickname, hex_str(ds->v3_identity_digest, DIGEST_LEN));
  685. smartlist_add(missing_id_digests, ds->v3_identity_digest);
  686. }
  687. } SMARTLIST_FOREACH_END(ds);
  688. /*
  689. * Next, if we have a consensus, scan through it and look for anything
  690. * signed with a key from a cert we don't have. Those get downloaded
  691. * by (fp,sk) pair, but if we don't know any certs at all for the fp
  692. * (identity digest), and it's one of the trusted dir server certs
  693. * we started off above or a pending download in pending_id, don't
  694. * try to get it yet. Most likely, the one we'll get for that will
  695. * have the right signing key too, and we'd just be downloading
  696. * redundantly.
  697. */
  698. if (status) {
  699. SMARTLIST_FOREACH_BEGIN(status->voters, networkstatus_voter_info_t *,
  700. voter) {
  701. if (!smartlist_len(voter->sigs))
  702. continue; /* This authority never signed this consensus, so don't
  703. * go looking for a cert with key digest 0000000000. */
  704. if (!cache &&
  705. !trusteddirserver_get_by_v3_auth_digest(voter->identity_digest))
  706. continue; /* We are not a cache, and we don't know this authority.*/
  707. /*
  708. * If we don't know *any* cert for this authority, and a download by ID
  709. * is pending or we added it to missing_id_digests above, skip this
  710. * one for now to avoid duplicate downloads.
  711. */
  712. cl = get_cert_list(voter->identity_digest);
  713. if (smartlist_len(cl->certs) == 0) {
  714. /* We have no certs at all for this one */
  715. /* Do we have a download of one pending? */
  716. if (digestmap_get(pending_id, voter->identity_digest))
  717. continue;
  718. /*
  719. * Are we about to launch a download of one due to the trusted
  720. * dir server check above?
  721. */
  722. if (smartlist_contains_digest(missing_id_digests,
  723. voter->identity_digest))
  724. continue;
  725. }
  726. SMARTLIST_FOREACH_BEGIN(voter->sigs, document_signature_t *, sig) {
  727. cert = authority_cert_get_by_digests(voter->identity_digest,
  728. sig->signing_key_digest);
  729. if (cert) {
  730. if (now < cert->expires)
  731. download_status_reset_by_sk_in_cl(cl, sig->signing_key_digest);
  732. continue;
  733. }
  734. if (download_status_is_ready_by_sk_in_cl(
  735. cl, sig->signing_key_digest,
  736. now, get_options()->TestingCertMaxDownloadTries) &&
  737. !fp_pair_map_get_by_digests(pending_cert,
  738. voter->identity_digest,
  739. sig->signing_key_digest)) {
  740. /*
  741. * Do this rather than hex_str(), since hex_str clobbers
  742. * old results and we call twice in the param list.
  743. */
  744. base16_encode(id_digest_str, sizeof(id_digest_str),
  745. voter->identity_digest, DIGEST_LEN);
  746. base16_encode(sk_digest_str, sizeof(sk_digest_str),
  747. sig->signing_key_digest, DIGEST_LEN);
  748. if (voter->nickname) {
  749. log_info(LD_DIR,
  750. "We're missing a certificate from authority %s "
  751. "(ID digest %s) with signing key %s: "
  752. "launching request.",
  753. voter->nickname, id_digest_str, sk_digest_str);
  754. } else {
  755. log_info(LD_DIR,
  756. "We're missing a certificate from authority ID digest "
  757. "%s with signing key %s: launching request.",
  758. id_digest_str, sk_digest_str);
  759. }
  760. /* Allocate a new fp_pair_t to append */
  761. fp_tmp = tor_malloc(sizeof(*fp_tmp));
  762. memcpy(fp_tmp->first, voter->identity_digest, sizeof(fp_tmp->first));
  763. memcpy(fp_tmp->second, sig->signing_key_digest,
  764. sizeof(fp_tmp->second));
  765. smartlist_add(missing_cert_digests, fp_tmp);
  766. }
  767. } SMARTLIST_FOREACH_END(sig);
  768. } SMARTLIST_FOREACH_END(voter);
  769. }
  770. /* Do downloads by identity digest */
  771. if (smartlist_len(missing_id_digests) > 0) {
  772. int need_plus = 0;
  773. smartlist_t *fps = smartlist_new();
  774. smartlist_add(fps, tor_strdup("fp/"));
  775. SMARTLIST_FOREACH_BEGIN(missing_id_digests, const char *, d) {
  776. char *fp = NULL;
  777. if (digestmap_get(pending_id, d))
  778. continue;
  779. base16_encode(id_digest_str, sizeof(id_digest_str),
  780. d, DIGEST_LEN);
  781. if (need_plus) {
  782. tor_asprintf(&fp, "+%s", id_digest_str);
  783. } else {
  784. /* No need for tor_asprintf() in this case; first one gets no '+' */
  785. fp = tor_strdup(id_digest_str);
  786. need_plus = 1;
  787. }
  788. smartlist_add(fps, fp);
  789. } SMARTLIST_FOREACH_END(d);
  790. if (smartlist_len(fps) > 1) {
  791. resource = smartlist_join_strings(fps, "", 0, NULL);
  792. directory_get_from_dirserver(DIR_PURPOSE_FETCH_CERTIFICATE, 0,
  793. resource, PDS_RETRY_IF_NO_SERVERS);
  794. tor_free(resource);
  795. }
  796. /* else we didn't add any: they were all pending */
  797. SMARTLIST_FOREACH(fps, char *, cp, tor_free(cp));
  798. smartlist_free(fps);
  799. }
  800. /* Do downloads by identity digest/signing key pair */
  801. if (smartlist_len(missing_cert_digests) > 0) {
  802. int need_plus = 0;
  803. smartlist_t *fp_pairs = smartlist_new();
  804. smartlist_add(fp_pairs, tor_strdup("fp-sk/"));
  805. SMARTLIST_FOREACH_BEGIN(missing_cert_digests, const fp_pair_t *, d) {
  806. char *fp_pair = NULL;
  807. if (fp_pair_map_get(pending_cert, d))
  808. continue;
  809. /* Construct string encodings of the digests */
  810. base16_encode(id_digest_str, sizeof(id_digest_str),
  811. d->first, DIGEST_LEN);
  812. base16_encode(sk_digest_str, sizeof(sk_digest_str),
  813. d->second, DIGEST_LEN);
  814. /* Now tor_asprintf() */
  815. if (need_plus) {
  816. tor_asprintf(&fp_pair, "+%s-%s", id_digest_str, sk_digest_str);
  817. } else {
  818. /* First one in the list doesn't get a '+' */
  819. tor_asprintf(&fp_pair, "%s-%s", id_digest_str, sk_digest_str);
  820. need_plus = 1;
  821. }
  822. /* Add it to the list of pairs to request */
  823. smartlist_add(fp_pairs, fp_pair);
  824. } SMARTLIST_FOREACH_END(d);
  825. if (smartlist_len(fp_pairs) > 1) {
  826. resource = smartlist_join_strings(fp_pairs, "", 0, NULL);
  827. directory_get_from_dirserver(DIR_PURPOSE_FETCH_CERTIFICATE, 0,
  828. resource, PDS_RETRY_IF_NO_SERVERS);
  829. tor_free(resource);
  830. }
  831. /* else they were all pending */
  832. SMARTLIST_FOREACH(fp_pairs, char *, p, tor_free(p));
  833. smartlist_free(fp_pairs);
  834. }
  835. smartlist_free(missing_id_digests);
  836. SMARTLIST_FOREACH(missing_cert_digests, fp_pair_t *, p, tor_free(p));
  837. smartlist_free(missing_cert_digests);
  838. digestmap_free(pending_id, NULL);
  839. fp_pair_map_free(pending_cert, NULL);
  840. }
  841. /* Router descriptor storage.
  842. *
  843. * Routerdescs are stored in a big file, named "cached-descriptors". As new
  844. * routerdescs arrive, we append them to a journal file named
  845. * "cached-descriptors.new".
  846. *
  847. * From time to time, we replace "cached-descriptors" with a new file
  848. * containing only the live, non-superseded descriptors, and clear
  849. * cached-routers.new.
  850. *
  851. * On startup, we read both files.
  852. */
  853. /** Helper: return 1 iff the router log is so big we want to rebuild the
  854. * store. */
  855. static int
  856. router_should_rebuild_store(desc_store_t *store)
  857. {
  858. if (store->store_len > (1<<16))
  859. return (store->journal_len > store->store_len / 2 ||
  860. store->bytes_dropped > store->store_len / 2);
  861. else
  862. return store->journal_len > (1<<15);
  863. }
  864. /** Return the desc_store_t in <b>rl</b> that should be used to store
  865. * <b>sd</b>. */
  866. static INLINE desc_store_t *
  867. desc_get_store(routerlist_t *rl, const signed_descriptor_t *sd)
  868. {
  869. if (sd->is_extrainfo)
  870. return &rl->extrainfo_store;
  871. else
  872. return &rl->desc_store;
  873. }
  874. /** Add the signed_descriptor_t in <b>desc</b> to the router
  875. * journal; change its saved_location to SAVED_IN_JOURNAL and set its
  876. * offset appropriately. */
  877. static int
  878. signed_desc_append_to_journal(signed_descriptor_t *desc,
  879. desc_store_t *store)
  880. {
  881. char *fname = get_datadir_fname_suffix(store->fname_base, ".new");
  882. const char *body = signed_descriptor_get_body_impl(desc,1);
  883. size_t len = desc->signed_descriptor_len + desc->annotations_len;
  884. if (append_bytes_to_file(fname, body, len, 1)) {
  885. log_warn(LD_FS, "Unable to store router descriptor");
  886. tor_free(fname);
  887. return -1;
  888. }
  889. desc->saved_location = SAVED_IN_JOURNAL;
  890. tor_free(fname);
  891. desc->saved_offset = store->journal_len;
  892. store->journal_len += len;
  893. return 0;
  894. }
  895. /** Sorting helper: return &lt;0, 0, or &gt;0 depending on whether the
  896. * signed_descriptor_t* in *<b>a</b> is older, the same age as, or newer than
  897. * the signed_descriptor_t* in *<b>b</b>. */
  898. static int
  899. compare_signed_descriptors_by_age_(const void **_a, const void **_b)
  900. {
  901. const signed_descriptor_t *r1 = *_a, *r2 = *_b;
  902. return (int)(r1->published_on - r2->published_on);
  903. }
  904. #define RRS_FORCE 1
  905. #define RRS_DONT_REMOVE_OLD 2
  906. /** If the journal of <b>store</b> is too long, or if RRS_FORCE is set in
  907. * <b>flags</b>, then atomically replace the saved router store with the
  908. * routers currently in our routerlist, and clear the journal. Unless
  909. * RRS_DONT_REMOVE_OLD is set in <b>flags</b>, delete expired routers before
  910. * rebuilding the store. Return 0 on success, -1 on failure.
  911. */
  912. static int
  913. router_rebuild_store(int flags, desc_store_t *store)
  914. {
  915. smartlist_t *chunk_list = NULL;
  916. char *fname = NULL, *fname_tmp = NULL;
  917. int r = -1;
  918. off_t offset = 0;
  919. smartlist_t *signed_descriptors = NULL;
  920. int nocache=0;
  921. size_t total_expected_len = 0;
  922. int had_any;
  923. int force = flags & RRS_FORCE;
  924. if (!force && !router_should_rebuild_store(store)) {
  925. r = 0;
  926. goto done;
  927. }
  928. if (!routerlist) {
  929. r = 0;
  930. goto done;
  931. }
  932. if (store->type == EXTRAINFO_STORE)
  933. had_any = !eimap_isempty(routerlist->extra_info_map);
  934. else
  935. had_any = (smartlist_len(routerlist->routers)+
  936. smartlist_len(routerlist->old_routers))>0;
  937. /* Don't save deadweight. */
  938. if (!(flags & RRS_DONT_REMOVE_OLD))
  939. routerlist_remove_old_routers();
  940. log_info(LD_DIR, "Rebuilding %s cache", store->description);
  941. fname = get_datadir_fname(store->fname_base);
  942. fname_tmp = get_datadir_fname_suffix(store->fname_base, ".tmp");
  943. chunk_list = smartlist_new();
  944. /* We sort the routers by age to enhance locality on disk. */
  945. signed_descriptors = smartlist_new();
  946. if (store->type == EXTRAINFO_STORE) {
  947. eimap_iter_t *iter;
  948. for (iter = eimap_iter_init(routerlist->extra_info_map);
  949. !eimap_iter_done(iter);
  950. iter = eimap_iter_next(routerlist->extra_info_map, iter)) {
  951. const char *key;
  952. extrainfo_t *ei;
  953. eimap_iter_get(iter, &key, &ei);
  954. smartlist_add(signed_descriptors, &ei->cache_info);
  955. }
  956. } else {
  957. SMARTLIST_FOREACH(routerlist->old_routers, signed_descriptor_t *, sd,
  958. smartlist_add(signed_descriptors, sd));
  959. SMARTLIST_FOREACH(routerlist->routers, routerinfo_t *, ri,
  960. smartlist_add(signed_descriptors, &ri->cache_info));
  961. }
  962. smartlist_sort(signed_descriptors, compare_signed_descriptors_by_age_);
  963. /* Now, add the appropriate members to chunk_list */
  964. SMARTLIST_FOREACH_BEGIN(signed_descriptors, signed_descriptor_t *, sd) {
  965. sized_chunk_t *c;
  966. const char *body = signed_descriptor_get_body_impl(sd, 1);
  967. if (!body) {
  968. log_warn(LD_BUG, "No descriptor available for router.");
  969. goto done;
  970. }
  971. if (sd->do_not_cache) {
  972. ++nocache;
  973. continue;
  974. }
  975. c = tor_malloc(sizeof(sized_chunk_t));
  976. c->bytes = body;
  977. c->len = sd->signed_descriptor_len + sd->annotations_len;
  978. total_expected_len += c->len;
  979. smartlist_add(chunk_list, c);
  980. } SMARTLIST_FOREACH_END(sd);
  981. if (write_chunks_to_file(fname_tmp, chunk_list, 1, 1)<0) {
  982. log_warn(LD_FS, "Error writing router store to disk.");
  983. goto done;
  984. }
  985. /* Our mmap is now invalid. */
  986. if (store->mmap) {
  987. int res = tor_munmap_file(store->mmap);
  988. store->mmap = NULL;
  989. if (res != 0) {
  990. log_warn(LD_FS, "Unable to munmap route store in %s", fname);
  991. }
  992. }
  993. if (replace_file(fname_tmp, fname)<0) {
  994. log_warn(LD_FS, "Error replacing old router store: %s", strerror(errno));
  995. goto done;
  996. }
  997. errno = 0;
  998. store->mmap = tor_mmap_file(fname);
  999. if (! store->mmap) {
  1000. if (errno == ERANGE) {
  1001. /* empty store.*/
  1002. if (total_expected_len) {
  1003. log_warn(LD_FS, "We wrote some bytes to a new descriptor file at '%s',"
  1004. " but when we went to mmap it, it was empty!", fname);
  1005. } else if (had_any) {
  1006. log_info(LD_FS, "We just removed every descriptor in '%s'. This is "
  1007. "okay if we're just starting up after a long time. "
  1008. "Otherwise, it's a bug.", fname);
  1009. }
  1010. } else {
  1011. log_warn(LD_FS, "Unable to mmap new descriptor file at '%s'.",fname);
  1012. }
  1013. }
  1014. log_info(LD_DIR, "Reconstructing pointers into cache");
  1015. offset = 0;
  1016. SMARTLIST_FOREACH_BEGIN(signed_descriptors, signed_descriptor_t *, sd) {
  1017. if (sd->do_not_cache)
  1018. continue;
  1019. sd->saved_location = SAVED_IN_CACHE;
  1020. if (store->mmap) {
  1021. tor_free(sd->signed_descriptor_body); // sets it to null
  1022. sd->saved_offset = offset;
  1023. }
  1024. offset += sd->signed_descriptor_len + sd->annotations_len;
  1025. signed_descriptor_get_body(sd); /* reconstruct and assert */
  1026. } SMARTLIST_FOREACH_END(sd);
  1027. tor_free(fname);
  1028. fname = get_datadir_fname_suffix(store->fname_base, ".new");
  1029. write_str_to_file(fname, "", 1);
  1030. r = 0;
  1031. store->store_len = (size_t) offset;
  1032. store->journal_len = 0;
  1033. store->bytes_dropped = 0;
  1034. done:
  1035. smartlist_free(signed_descriptors);
  1036. tor_free(fname);
  1037. tor_free(fname_tmp);
  1038. if (chunk_list) {
  1039. SMARTLIST_FOREACH(chunk_list, sized_chunk_t *, c, tor_free(c));
  1040. smartlist_free(chunk_list);
  1041. }
  1042. return r;
  1043. }
  1044. /** Helper: Reload a cache file and its associated journal, setting metadata
  1045. * appropriately. If <b>extrainfo</b> is true, reload the extrainfo store;
  1046. * else reload the router descriptor store. */
  1047. static int
  1048. router_reload_router_list_impl(desc_store_t *store)
  1049. {
  1050. char *fname = NULL, *contents = NULL;
  1051. struct stat st;
  1052. int extrainfo = (store->type == EXTRAINFO_STORE);
  1053. store->journal_len = store->store_len = 0;
  1054. fname = get_datadir_fname(store->fname_base);
  1055. if (store->mmap) {
  1056. /* get rid of it first */
  1057. int res = tor_munmap_file(store->mmap);
  1058. store->mmap = NULL;
  1059. if (res != 0) {
  1060. log_warn(LD_FS, "Failed to munmap %s", fname);
  1061. tor_free(fname);
  1062. return -1;
  1063. }
  1064. }
  1065. store->mmap = tor_mmap_file(fname);
  1066. if (store->mmap) {
  1067. store->store_len = store->mmap->size;
  1068. if (extrainfo)
  1069. router_load_extrainfo_from_string(store->mmap->data,
  1070. store->mmap->data+store->mmap->size,
  1071. SAVED_IN_CACHE, NULL, 0);
  1072. else
  1073. router_load_routers_from_string(store->mmap->data,
  1074. store->mmap->data+store->mmap->size,
  1075. SAVED_IN_CACHE, NULL, 0, NULL);
  1076. }
  1077. tor_free(fname);
  1078. fname = get_datadir_fname_suffix(store->fname_base, ".new");
  1079. /* don't load empty files - we wouldn't get any data, even if we tried */
  1080. if (file_status(fname) == FN_FILE)
  1081. contents = read_file_to_str(fname, RFTS_BIN|RFTS_IGNORE_MISSING, &st);
  1082. if (contents) {
  1083. if (extrainfo)
  1084. router_load_extrainfo_from_string(contents, NULL,SAVED_IN_JOURNAL,
  1085. NULL, 0);
  1086. else
  1087. router_load_routers_from_string(contents, NULL, SAVED_IN_JOURNAL,
  1088. NULL, 0, NULL);
  1089. store->journal_len = (size_t) st.st_size;
  1090. tor_free(contents);
  1091. }
  1092. tor_free(fname);
  1093. if (store->journal_len) {
  1094. /* Always clear the journal on startup.*/
  1095. router_rebuild_store(RRS_FORCE, store);
  1096. } else if (!extrainfo) {
  1097. /* Don't cache expired routers. (This is in an else because
  1098. * router_rebuild_store() also calls remove_old_routers().) */
  1099. routerlist_remove_old_routers();
  1100. }
  1101. return 0;
  1102. }
  1103. /** Load all cached router descriptors and extra-info documents from the
  1104. * store. Return 0 on success and -1 on failure.
  1105. */
  1106. int
  1107. router_reload_router_list(void)
  1108. {
  1109. routerlist_t *rl = router_get_routerlist();
  1110. if (router_reload_router_list_impl(&rl->desc_store))
  1111. return -1;
  1112. if (router_reload_router_list_impl(&rl->extrainfo_store))
  1113. return -1;
  1114. return 0;
  1115. }
  1116. /** Return a smartlist containing a list of dir_server_t * for all
  1117. * known trusted dirservers. Callers must not modify the list or its
  1118. * contents.
  1119. */
  1120. const smartlist_t *
  1121. router_get_trusted_dir_servers(void)
  1122. {
  1123. if (!trusted_dir_servers)
  1124. trusted_dir_servers = smartlist_new();
  1125. return trusted_dir_servers;
  1126. }
  1127. const smartlist_t *
  1128. router_get_fallback_dir_servers(void)
  1129. {
  1130. if (!fallback_dir_servers)
  1131. fallback_dir_servers = smartlist_new();
  1132. return fallback_dir_servers;
  1133. }
  1134. /** Try to find a running dirserver that supports operations of <b>type</b>.
  1135. *
  1136. * If there are no running dirservers in our routerlist and the
  1137. * <b>PDS_RETRY_IF_NO_SERVERS</b> flag is set, set all the authoritative ones
  1138. * as running again, and pick one.
  1139. *
  1140. * If the <b>PDS_IGNORE_FASCISTFIREWALL</b> flag is set, then include
  1141. * dirservers that we can't reach.
  1142. *
  1143. * If the <b>PDS_ALLOW_SELF</b> flag is not set, then don't include ourself
  1144. * (if we're a dirserver).
  1145. *
  1146. * Don't pick an authority if any non-authority is viable; try to avoid using
  1147. * servers that have returned 503 recently.
  1148. */
  1149. const routerstatus_t *
  1150. router_pick_directory_server(dirinfo_type_t type, int flags)
  1151. {
  1152. const routerstatus_t *choice;
  1153. if (!routerlist)
  1154. return NULL;
  1155. choice = router_pick_directory_server_impl(type, flags);
  1156. if (choice || !(flags & PDS_RETRY_IF_NO_SERVERS))
  1157. return choice;
  1158. log_info(LD_DIR,
  1159. "No reachable router entries for dirservers. "
  1160. "Trying them all again.");
  1161. /* mark all authdirservers as up again */
  1162. mark_all_dirservers_up(fallback_dir_servers);
  1163. /* try again */
  1164. choice = router_pick_directory_server_impl(type, flags);
  1165. return choice;
  1166. }
  1167. /** Return the dir_server_t for the directory authority whose identity
  1168. * key hashes to <b>digest</b>, or NULL if no such authority is known.
  1169. */
  1170. dir_server_t *
  1171. router_get_trusteddirserver_by_digest(const char *digest)
  1172. {
  1173. if (!trusted_dir_servers)
  1174. return NULL;
  1175. SMARTLIST_FOREACH(trusted_dir_servers, dir_server_t *, ds,
  1176. {
  1177. if (tor_memeq(ds->digest, digest, DIGEST_LEN))
  1178. return ds;
  1179. });
  1180. return NULL;
  1181. }
  1182. /** Return the dir_server_t for the fallback dirserver whose identity
  1183. * key hashes to <b>digest</b>, or NULL if no such authority is known.
  1184. */
  1185. dir_server_t *
  1186. router_get_fallback_dirserver_by_digest(const char *digest)
  1187. {
  1188. if (!trusted_dir_servers)
  1189. return NULL;
  1190. SMARTLIST_FOREACH(trusted_dir_servers, dir_server_t *, ds,
  1191. {
  1192. if (tor_memeq(ds->digest, digest, DIGEST_LEN))
  1193. return ds;
  1194. });
  1195. return NULL;
  1196. }
  1197. /** Return the dir_server_t for the directory authority whose
  1198. * v3 identity key hashes to <b>digest</b>, or NULL if no such authority
  1199. * is known.
  1200. */
  1201. dir_server_t *
  1202. trusteddirserver_get_by_v3_auth_digest(const char *digest)
  1203. {
  1204. if (!trusted_dir_servers)
  1205. return NULL;
  1206. SMARTLIST_FOREACH(trusted_dir_servers, dir_server_t *, ds,
  1207. {
  1208. if (tor_memeq(ds->v3_identity_digest, digest, DIGEST_LEN) &&
  1209. (ds->type & V3_DIRINFO))
  1210. return ds;
  1211. });
  1212. return NULL;
  1213. }
  1214. /** Try to find a running directory authority. Flags are as for
  1215. * router_pick_directory_server.
  1216. */
  1217. const routerstatus_t *
  1218. router_pick_trusteddirserver(dirinfo_type_t type, int flags)
  1219. {
  1220. return router_pick_dirserver_generic(trusted_dir_servers, type, flags);
  1221. }
  1222. /** Try to find a running fallback directory. Flags are as for
  1223. * router_pick_directory_server.
  1224. */
  1225. const routerstatus_t *
  1226. router_pick_fallback_dirserver(dirinfo_type_t type, int flags)
  1227. {
  1228. return router_pick_dirserver_generic(fallback_dir_servers, type, flags);
  1229. }
  1230. /** Try to find a running fallback directory. Flags are as for
  1231. * router_pick_directory_server.
  1232. */
  1233. static const routerstatus_t *
  1234. router_pick_dirserver_generic(smartlist_t *sourcelist,
  1235. dirinfo_type_t type, int flags)
  1236. {
  1237. const routerstatus_t *choice;
  1238. int busy = 0;
  1239. choice = router_pick_trusteddirserver_impl(sourcelist, type, flags, &busy);
  1240. if (choice || !(flags & PDS_RETRY_IF_NO_SERVERS))
  1241. return choice;
  1242. if (busy) {
  1243. /* If the reason that we got no server is that servers are "busy",
  1244. * we must be excluding good servers because we already have serverdesc
  1245. * fetches with them. Do not mark down servers up because of this. */
  1246. tor_assert((flags & (PDS_NO_EXISTING_SERVERDESC_FETCH|
  1247. PDS_NO_EXISTING_MICRODESC_FETCH)));
  1248. return NULL;
  1249. }
  1250. log_info(LD_DIR,
  1251. "No dirservers are reachable. Trying them all again.");
  1252. mark_all_dirservers_up(sourcelist);
  1253. return router_pick_trusteddirserver_impl(sourcelist, type, flags, NULL);
  1254. }
  1255. /** How long do we avoid using a directory server after it's given us a 503? */
  1256. #define DIR_503_TIMEOUT (60*60)
  1257. /** Pick a random running valid directory server/mirror from our
  1258. * routerlist. Arguments are as for router_pick_directory_server(), except
  1259. * that RETRY_IF_NO_SERVERS is ignored.
  1260. */
  1261. static const routerstatus_t *
  1262. router_pick_directory_server_impl(dirinfo_type_t type, int flags)
  1263. {
  1264. const or_options_t *options = get_options();
  1265. const node_t *result;
  1266. smartlist_t *direct, *tunnel;
  1267. smartlist_t *trusted_direct, *trusted_tunnel;
  1268. smartlist_t *overloaded_direct, *overloaded_tunnel;
  1269. time_t now = time(NULL);
  1270. const networkstatus_t *consensus = networkstatus_get_latest_consensus();
  1271. int requireother = ! (flags & PDS_ALLOW_SELF);
  1272. int fascistfirewall = ! (flags & PDS_IGNORE_FASCISTFIREWALL);
  1273. int for_guard = (flags & PDS_FOR_GUARD);
  1274. int try_excluding = 1, n_excluded = 0;
  1275. if (!consensus)
  1276. return NULL;
  1277. retry_without_exclude:
  1278. direct = smartlist_new();
  1279. tunnel = smartlist_new();
  1280. trusted_direct = smartlist_new();
  1281. trusted_tunnel = smartlist_new();
  1282. overloaded_direct = smartlist_new();
  1283. overloaded_tunnel = smartlist_new();
  1284. /* Find all the running dirservers we know about. */
  1285. SMARTLIST_FOREACH_BEGIN(nodelist_get_list(), const node_t *, node) {
  1286. int is_trusted, is_trusted_extrainfo;
  1287. int is_overloaded;
  1288. tor_addr_t addr;
  1289. const routerstatus_t *status = node->rs;
  1290. const country_t country = node->country;
  1291. if (!status)
  1292. continue;
  1293. if (!node->is_running || !status->dir_port || !node->is_valid)
  1294. continue;
  1295. if (requireother && router_digest_is_me(node->identity))
  1296. continue;
  1297. is_trusted = router_digest_is_trusted_dir(node->identity);
  1298. is_trusted_extrainfo = router_digest_is_trusted_dir_type(
  1299. node->identity, EXTRAINFO_DIRINFO);
  1300. if ((type & EXTRAINFO_DIRINFO) &&
  1301. !router_supports_extrainfo(node->identity, is_trusted_extrainfo))
  1302. continue;
  1303. if ((type & MICRODESC_DIRINFO) && !is_trusted &&
  1304. !node->rs->version_supports_microdesc_cache)
  1305. continue;
  1306. if (for_guard && node->using_as_guard)
  1307. continue; /* Don't make the same node a guard twice. */
  1308. if (try_excluding &&
  1309. routerset_contains_routerstatus(options->ExcludeNodes, status,
  1310. country)) {
  1311. ++n_excluded;
  1312. continue;
  1313. }
  1314. /* XXXX IP6 proposal 118 */
  1315. tor_addr_from_ipv4h(&addr, node->rs->addr);
  1316. is_overloaded = status->last_dir_503_at + DIR_503_TIMEOUT > now;
  1317. if ((!fascistfirewall ||
  1318. fascist_firewall_allows_address_or(&addr, status->or_port)))
  1319. smartlist_add(is_trusted ? trusted_tunnel :
  1320. is_overloaded ? overloaded_tunnel : tunnel, (void*)node);
  1321. else if (!fascistfirewall ||
  1322. fascist_firewall_allows_address_dir(&addr, status->dir_port))
  1323. smartlist_add(is_trusted ? trusted_direct :
  1324. is_overloaded ? overloaded_direct : direct, (void*)node);
  1325. } SMARTLIST_FOREACH_END(node);
  1326. if (smartlist_len(tunnel)) {
  1327. result = node_sl_choose_by_bandwidth(tunnel, WEIGHT_FOR_DIR);
  1328. } else if (smartlist_len(overloaded_tunnel)) {
  1329. result = node_sl_choose_by_bandwidth(overloaded_tunnel,
  1330. WEIGHT_FOR_DIR);
  1331. } else if (smartlist_len(trusted_tunnel)) {
  1332. /* FFFF We don't distinguish between trusteds and overloaded trusteds
  1333. * yet. Maybe one day we should. */
  1334. /* FFFF We also don't load balance over authorities yet. I think this
  1335. * is a feature, but it could easily be a bug. -RD */
  1336. result = smartlist_choose(trusted_tunnel);
  1337. } else if (smartlist_len(direct)) {
  1338. result = node_sl_choose_by_bandwidth(direct, WEIGHT_FOR_DIR);
  1339. } else if (smartlist_len(overloaded_direct)) {
  1340. result = node_sl_choose_by_bandwidth(overloaded_direct,
  1341. WEIGHT_FOR_DIR);
  1342. } else {
  1343. result = smartlist_choose(trusted_direct);
  1344. }
  1345. smartlist_free(direct);
  1346. smartlist_free(tunnel);
  1347. smartlist_free(trusted_direct);
  1348. smartlist_free(trusted_tunnel);
  1349. smartlist_free(overloaded_direct);
  1350. smartlist_free(overloaded_tunnel);
  1351. if (result == NULL && try_excluding && !options->StrictNodes && n_excluded) {
  1352. /* If we got no result, and we are excluding nodes, and StrictNodes is
  1353. * not set, try again without excluding nodes. */
  1354. try_excluding = 0;
  1355. n_excluded = 0;
  1356. goto retry_without_exclude;
  1357. }
  1358. return result ? result->rs : NULL;
  1359. }
  1360. /** Pick a random element from a list of dir_server_t, weighting by their
  1361. * <b>weight</b> field. */
  1362. static const dir_server_t *
  1363. dirserver_choose_by_weight(const smartlist_t *servers, double authority_weight)
  1364. {
  1365. int n = smartlist_len(servers);
  1366. int i;
  1367. u64_dbl_t *weights;
  1368. const dir_server_t *ds;
  1369. weights = tor_calloc(n, sizeof(u64_dbl_t));
  1370. for (i = 0; i < n; ++i) {
  1371. ds = smartlist_get(servers, i);
  1372. weights[i].dbl = ds->weight;
  1373. if (ds->is_authority)
  1374. weights[i].dbl *= authority_weight;
  1375. }
  1376. scale_array_elements_to_u64(weights, n, NULL);
  1377. i = choose_array_element_by_weight(weights, n);
  1378. tor_free(weights);
  1379. return (i < 0) ? NULL : smartlist_get(servers, i);
  1380. }
  1381. /** Choose randomly from among the dir_server_ts in sourcelist that
  1382. * are up. Flags are as for router_pick_directory_server_impl().
  1383. */
  1384. static const routerstatus_t *
  1385. router_pick_trusteddirserver_impl(const smartlist_t *sourcelist,
  1386. dirinfo_type_t type, int flags,
  1387. int *n_busy_out)
  1388. {
  1389. const or_options_t *options = get_options();
  1390. smartlist_t *direct, *tunnel;
  1391. smartlist_t *overloaded_direct, *overloaded_tunnel;
  1392. const routerinfo_t *me = router_get_my_routerinfo();
  1393. const routerstatus_t *result = NULL;
  1394. time_t now = time(NULL);
  1395. const int requireother = ! (flags & PDS_ALLOW_SELF);
  1396. const int fascistfirewall = ! (flags & PDS_IGNORE_FASCISTFIREWALL);
  1397. const int no_serverdesc_fetching =(flags & PDS_NO_EXISTING_SERVERDESC_FETCH);
  1398. const int no_microdesc_fetching =(flags & PDS_NO_EXISTING_MICRODESC_FETCH);
  1399. const double auth_weight = (sourcelist == fallback_dir_servers) ?
  1400. options->DirAuthorityFallbackRate : 1.0;
  1401. smartlist_t *pick_from;
  1402. int n_busy = 0;
  1403. int try_excluding = 1, n_excluded = 0;
  1404. if (!sourcelist)
  1405. return NULL;
  1406. retry_without_exclude:
  1407. direct = smartlist_new();
  1408. tunnel = smartlist_new();
  1409. overloaded_direct = smartlist_new();
  1410. overloaded_tunnel = smartlist_new();
  1411. SMARTLIST_FOREACH_BEGIN(sourcelist, const dir_server_t *, d)
  1412. {
  1413. int is_overloaded =
  1414. d->fake_status.last_dir_503_at + DIR_503_TIMEOUT > now;
  1415. tor_addr_t addr;
  1416. if (!d->is_running) continue;
  1417. if ((type & d->type) == 0)
  1418. continue;
  1419. if ((type & EXTRAINFO_DIRINFO) &&
  1420. !router_supports_extrainfo(d->digest, 1))
  1421. continue;
  1422. if (requireother && me && router_digest_is_me(d->digest))
  1423. continue;
  1424. if (try_excluding &&
  1425. routerset_contains_routerstatus(options->ExcludeNodes,
  1426. &d->fake_status, -1)) {
  1427. ++n_excluded;
  1428. continue;
  1429. }
  1430. /* XXXX IP6 proposal 118 */
  1431. tor_addr_from_ipv4h(&addr, d->addr);
  1432. if (no_serverdesc_fetching) {
  1433. if (connection_get_by_type_addr_port_purpose(
  1434. CONN_TYPE_DIR, &addr, d->dir_port, DIR_PURPOSE_FETCH_SERVERDESC)
  1435. || connection_get_by_type_addr_port_purpose(
  1436. CONN_TYPE_DIR, &addr, d->dir_port, DIR_PURPOSE_FETCH_EXTRAINFO)) {
  1437. //log_debug(LD_DIR, "We have an existing connection to fetch "
  1438. // "descriptor from %s; delaying",d->description);
  1439. ++n_busy;
  1440. continue;
  1441. }
  1442. }
  1443. if (no_microdesc_fetching) {
  1444. if (connection_get_by_type_addr_port_purpose(
  1445. CONN_TYPE_DIR, &addr, d->dir_port, DIR_PURPOSE_FETCH_MICRODESC)) {
  1446. ++n_busy;
  1447. continue;
  1448. }
  1449. }
  1450. if (d->or_port &&
  1451. (!fascistfirewall ||
  1452. fascist_firewall_allows_address_or(&addr, d->or_port)))
  1453. smartlist_add(is_overloaded ? overloaded_tunnel : tunnel, (void*)d);
  1454. else if (!fascistfirewall ||
  1455. fascist_firewall_allows_address_dir(&addr, d->dir_port))
  1456. smartlist_add(is_overloaded ? overloaded_direct : direct, (void*)d);
  1457. }
  1458. SMARTLIST_FOREACH_END(d);
  1459. if (smartlist_len(tunnel)) {
  1460. pick_from = tunnel;
  1461. } else if (smartlist_len(overloaded_tunnel)) {
  1462. pick_from = overloaded_tunnel;
  1463. } else if (smartlist_len(direct)) {
  1464. pick_from = direct;
  1465. } else {
  1466. pick_from = overloaded_direct;
  1467. }
  1468. {
  1469. const dir_server_t *selection =
  1470. dirserver_choose_by_weight(pick_from, auth_weight);
  1471. if (selection)
  1472. result = &selection->fake_status;
  1473. }
  1474. if (n_busy_out)
  1475. *n_busy_out = n_busy;
  1476. smartlist_free(direct);
  1477. smartlist_free(tunnel);
  1478. smartlist_free(overloaded_direct);
  1479. smartlist_free(overloaded_tunnel);
  1480. if (result == NULL && try_excluding && !options->StrictNodes && n_excluded) {
  1481. /* If we got no result, and we are excluding nodes, and StrictNodes is
  1482. * not set, try again without excluding nodes. */
  1483. try_excluding = 0;
  1484. n_excluded = 0;
  1485. goto retry_without_exclude;
  1486. }
  1487. return result;
  1488. }
  1489. /** Mark as running every dir_server_t in <b>server_list</b>. */
  1490. static void
  1491. mark_all_dirservers_up(smartlist_t *server_list)
  1492. {
  1493. if (server_list) {
  1494. SMARTLIST_FOREACH_BEGIN(server_list, dir_server_t *, dir) {
  1495. routerstatus_t *rs;
  1496. node_t *node;
  1497. dir->is_running = 1;
  1498. node = node_get_mutable_by_id(dir->digest);
  1499. if (node)
  1500. node->is_running = 1;
  1501. rs = router_get_mutable_consensus_status_by_id(dir->digest);
  1502. if (rs) {
  1503. rs->last_dir_503_at = 0;
  1504. control_event_networkstatus_changed_single(rs);
  1505. }
  1506. } SMARTLIST_FOREACH_END(dir);
  1507. }
  1508. router_dir_info_changed();
  1509. }
  1510. /** Return true iff r1 and r2 have the same address and OR port. */
  1511. int
  1512. routers_have_same_or_addrs(const routerinfo_t *r1, const routerinfo_t *r2)
  1513. {
  1514. return r1->addr == r2->addr && r1->or_port == r2->or_port &&
  1515. tor_addr_eq(&r1->ipv6_addr, &r2->ipv6_addr) &&
  1516. r1->ipv6_orport == r2->ipv6_orport;
  1517. }
  1518. /** Reset all internal variables used to count failed downloads of network
  1519. * status objects. */
  1520. void
  1521. router_reset_status_download_failures(void)
  1522. {
  1523. mark_all_dirservers_up(fallback_dir_servers);
  1524. }
  1525. /** Given a <b>router</b>, add every node_t in its family (including the
  1526. * node itself!) to <b>sl</b>.
  1527. *
  1528. * Note the type mismatch: This function takes a routerinfo, but adds nodes
  1529. * to the smartlist!
  1530. */
  1531. static void
  1532. routerlist_add_node_and_family(smartlist_t *sl, const routerinfo_t *router)
  1533. {
  1534. /* XXXX MOVE ? */
  1535. node_t fake_node;
  1536. const node_t *node = node_get_by_id(router->cache_info.identity_digest);;
  1537. if (node == NULL) {
  1538. memset(&fake_node, 0, sizeof(fake_node));
  1539. fake_node.ri = (routerinfo_t *)router;
  1540. memcpy(fake_node.identity, router->cache_info.identity_digest, DIGEST_LEN);
  1541. node = &fake_node;
  1542. }
  1543. nodelist_add_node_and_family(sl, node);
  1544. }
  1545. /** Add every suitable node from our nodelist to <b>sl</b>, so that
  1546. * we can pick a node for a circuit.
  1547. */
  1548. static void
  1549. router_add_running_nodes_to_smartlist(smartlist_t *sl, int allow_invalid,
  1550. int need_uptime, int need_capacity,
  1551. int need_guard, int need_desc)
  1552. { /* XXXX MOVE */
  1553. SMARTLIST_FOREACH_BEGIN(nodelist_get_list(), const node_t *, node) {
  1554. if (!node->is_running ||
  1555. (!node->is_valid && !allow_invalid))
  1556. continue;
  1557. if (need_desc && !(node->ri || (node->rs && node->md)))
  1558. continue;
  1559. if (node->ri && node->ri->purpose != ROUTER_PURPOSE_GENERAL)
  1560. continue;
  1561. if (node_is_unreliable(node, need_uptime, need_capacity, need_guard))
  1562. continue;
  1563. smartlist_add(sl, (void *)node);
  1564. } SMARTLIST_FOREACH_END(node);
  1565. }
  1566. /** Look through the routerlist until we find a router that has my key.
  1567. Return it. */
  1568. const routerinfo_t *
  1569. routerlist_find_my_routerinfo(void)
  1570. {
  1571. if (!routerlist)
  1572. return NULL;
  1573. SMARTLIST_FOREACH(routerlist->routers, routerinfo_t *, router,
  1574. {
  1575. if (router_is_me(router))
  1576. return router;
  1577. });
  1578. return NULL;
  1579. }
  1580. /** Return the smaller of the router's configured BandwidthRate
  1581. * and its advertised capacity. */
  1582. uint32_t
  1583. router_get_advertised_bandwidth(const routerinfo_t *router)
  1584. {
  1585. if (router->bandwidthcapacity < router->bandwidthrate)
  1586. return router->bandwidthcapacity;
  1587. return router->bandwidthrate;
  1588. }
  1589. /** Do not weight any declared bandwidth more than this much when picking
  1590. * routers by bandwidth. */
  1591. #define DEFAULT_MAX_BELIEVABLE_BANDWIDTH 10000000 /* 10 MB/sec */
  1592. /** Return the smaller of the router's configured BandwidthRate
  1593. * and its advertised capacity, capped by max-believe-bw. */
  1594. uint32_t
  1595. router_get_advertised_bandwidth_capped(const routerinfo_t *router)
  1596. {
  1597. uint32_t result = router->bandwidthcapacity;
  1598. if (result > router->bandwidthrate)
  1599. result = router->bandwidthrate;
  1600. if (result > DEFAULT_MAX_BELIEVABLE_BANDWIDTH)
  1601. result = DEFAULT_MAX_BELIEVABLE_BANDWIDTH;
  1602. return result;
  1603. }
  1604. /** Given an array of double/uint64_t unions that are currently being used as
  1605. * doubles, convert them to uint64_t, and try to scale them linearly so as to
  1606. * much of the range of uint64_t. If <b>total_out</b> is provided, set it to
  1607. * the sum of all elements in the array _before_ scaling. */
  1608. STATIC void
  1609. scale_array_elements_to_u64(u64_dbl_t *entries, int n_entries,
  1610. uint64_t *total_out)
  1611. {
  1612. double total = 0.0;
  1613. double scale_factor = 0.0;
  1614. int i;
  1615. /* big, but far away from overflowing an int64_t */
  1616. #define SCALE_TO_U64_MAX ((int64_t) (INT64_MAX / 4))
  1617. for (i = 0; i < n_entries; ++i)
  1618. total += entries[i].dbl;
  1619. if (total > 0.0)
  1620. scale_factor = SCALE_TO_U64_MAX / total;
  1621. for (i = 0; i < n_entries; ++i)
  1622. entries[i].u64 = tor_llround(entries[i].dbl * scale_factor);
  1623. if (total_out)
  1624. *total_out = (uint64_t) total;
  1625. #undef SCALE_TO_U64_MAX
  1626. }
  1627. /** Time-invariant 64-bit greater-than; works on two integers in the range
  1628. * (0,INT64_MAX). */
  1629. #if SIZEOF_VOID_P == 8
  1630. #define gt_i64_timei(a,b) ((a) > (b))
  1631. #else
  1632. static INLINE int
  1633. gt_i64_timei(uint64_t a, uint64_t b)
  1634. {
  1635. int64_t diff = (int64_t) (b - a);
  1636. int res = diff >> 63;
  1637. return res & 1;
  1638. }
  1639. #endif
  1640. /** Pick a random element of <b>n_entries</b>-element array <b>entries</b>,
  1641. * choosing each element with a probability proportional to its (uint64_t)
  1642. * value, and return the index of that element. If all elements are 0, choose
  1643. * an index at random. Return -1 on error.
  1644. */
  1645. STATIC int
  1646. choose_array_element_by_weight(const u64_dbl_t *entries, int n_entries)
  1647. {
  1648. int i, i_chosen=-1, n_chosen=0;
  1649. uint64_t total_so_far = 0;
  1650. uint64_t rand_val;
  1651. uint64_t total = 0;
  1652. for (i = 0; i < n_entries; ++i)
  1653. total += entries[i].u64;
  1654. if (n_entries < 1)
  1655. return -1;
  1656. if (total == 0)
  1657. return crypto_rand_int(n_entries);
  1658. tor_assert(total < INT64_MAX);
  1659. rand_val = crypto_rand_uint64(total);
  1660. for (i = 0; i < n_entries; ++i) {
  1661. total_so_far += entries[i].u64;
  1662. if (gt_i64_timei(total_so_far, rand_val)) {
  1663. i_chosen = i;
  1664. n_chosen++;
  1665. /* Set rand_val to INT64_MAX rather than stopping the loop. This way,
  1666. * the time we spend in the loop does not leak which element we chose. */
  1667. rand_val = INT64_MAX;
  1668. }
  1669. }
  1670. tor_assert(total_so_far == total);
  1671. tor_assert(n_chosen == 1);
  1672. tor_assert(i_chosen >= 0);
  1673. tor_assert(i_chosen < n_entries);
  1674. return i_chosen;
  1675. }
  1676. /** When weighting bridges, enforce these values as lower and upper
  1677. * bound for believable bandwidth, because there is no way for us
  1678. * to verify a bridge's bandwidth currently. */
  1679. #define BRIDGE_MIN_BELIEVABLE_BANDWIDTH 20000 /* 20 kB/sec */
  1680. #define BRIDGE_MAX_BELIEVABLE_BANDWIDTH 100000 /* 100 kB/sec */
  1681. /** Return the smaller of the router's configured BandwidthRate
  1682. * and its advertised capacity, making sure to stay within the
  1683. * interval between bridge-min-believe-bw and
  1684. * bridge-max-believe-bw. */
  1685. static uint32_t
  1686. bridge_get_advertised_bandwidth_bounded(routerinfo_t *router)
  1687. {
  1688. uint32_t result = router->bandwidthcapacity;
  1689. if (result > router->bandwidthrate)
  1690. result = router->bandwidthrate;
  1691. if (result > BRIDGE_MAX_BELIEVABLE_BANDWIDTH)
  1692. result = BRIDGE_MAX_BELIEVABLE_BANDWIDTH;
  1693. else if (result < BRIDGE_MIN_BELIEVABLE_BANDWIDTH)
  1694. result = BRIDGE_MIN_BELIEVABLE_BANDWIDTH;
  1695. return result;
  1696. }
  1697. /** Return bw*1000, unless bw*1000 would overflow, in which case return
  1698. * INT32_MAX. */
  1699. static INLINE int32_t
  1700. kb_to_bytes(uint32_t bw)
  1701. {
  1702. return (bw > (INT32_MAX/1000)) ? INT32_MAX : bw*1000;
  1703. }
  1704. /** Helper function:
  1705. * choose a random element of smartlist <b>sl</b> of nodes, weighted by
  1706. * the advertised bandwidth of each element using the consensus
  1707. * bandwidth weights.
  1708. *
  1709. * If <b>rule</b>==WEIGHT_FOR_EXIT. we're picking an exit node: consider all
  1710. * nodes' bandwidth equally regardless of their Exit status, since there may
  1711. * be some in the list because they exit to obscure ports. If
  1712. * <b>rule</b>==NO_WEIGHTING, we're picking a non-exit node: weight
  1713. * exit-node's bandwidth less depending on the smallness of the fraction of
  1714. * Exit-to-total bandwidth. If <b>rule</b>==WEIGHT_FOR_GUARD, we're picking a
  1715. * guard node: consider all guard's bandwidth equally. Otherwise, weight
  1716. * guards proportionally less.
  1717. */
  1718. static const node_t *
  1719. smartlist_choose_node_by_bandwidth_weights(const smartlist_t *sl,
  1720. bandwidth_weight_rule_t rule)
  1721. {
  1722. u64_dbl_t *bandwidths=NULL;
  1723. if (compute_weighted_bandwidths(sl, rule, &bandwidths) < 0)
  1724. return NULL;
  1725. scale_array_elements_to_u64(bandwidths, smartlist_len(sl), NULL);
  1726. {
  1727. int idx = choose_array_element_by_weight(bandwidths,
  1728. smartlist_len(sl));
  1729. tor_free(bandwidths);
  1730. return idx < 0 ? NULL : smartlist_get(sl, idx);
  1731. }
  1732. }
  1733. /** Given a list of routers and a weighting rule as in
  1734. * smartlist_choose_node_by_bandwidth_weights, compute weighted bandwidth
  1735. * values for each node and store them in a freshly allocated
  1736. * *<b>bandwidths_out</b> of the same length as <b>sl</b>, and holding results
  1737. * as doubles. Return 0 on success, -1 on failure. */
  1738. static int
  1739. compute_weighted_bandwidths(const smartlist_t *sl,
  1740. bandwidth_weight_rule_t rule,
  1741. u64_dbl_t **bandwidths_out)
  1742. {
  1743. int64_t weight_scale;
  1744. double Wg = -1, Wm = -1, We = -1, Wd = -1;
  1745. double Wgb = -1, Wmb = -1, Web = -1, Wdb = -1;
  1746. uint64_t weighted_bw = 0;
  1747. u64_dbl_t *bandwidths;
  1748. /* Can't choose exit and guard at same time */
  1749. tor_assert(rule == NO_WEIGHTING ||
  1750. rule == WEIGHT_FOR_EXIT ||
  1751. rule == WEIGHT_FOR_GUARD ||
  1752. rule == WEIGHT_FOR_MID ||
  1753. rule == WEIGHT_FOR_DIR);
  1754. if (smartlist_len(sl) == 0) {
  1755. log_info(LD_CIRC,
  1756. "Empty routerlist passed in to consensus weight node "
  1757. "selection for rule %s",
  1758. bandwidth_weight_rule_to_string(rule));
  1759. return -1;
  1760. }
  1761. weight_scale = networkstatus_get_weight_scale_param(NULL);
  1762. if (rule == WEIGHT_FOR_GUARD) {
  1763. Wg = networkstatus_get_bw_weight(NULL, "Wgg", -1);
  1764. Wm = networkstatus_get_bw_weight(NULL, "Wgm", -1); /* Bridges */
  1765. We = 0;
  1766. Wd = networkstatus_get_bw_weight(NULL, "Wgd", -1);
  1767. Wgb = networkstatus_get_bw_weight(NULL, "Wgb", -1);
  1768. Wmb = networkstatus_get_bw_weight(NULL, "Wmb", -1);
  1769. Web = networkstatus_get_bw_weight(NULL, "Web", -1);
  1770. Wdb = networkstatus_get_bw_weight(NULL, "Wdb", -1);
  1771. } else if (rule == WEIGHT_FOR_MID) {
  1772. Wg = networkstatus_get_bw_weight(NULL, "Wmg", -1);
  1773. Wm = networkstatus_get_bw_weight(NULL, "Wmm", -1);
  1774. We = networkstatus_get_bw_weight(NULL, "Wme", -1);
  1775. Wd = networkstatus_get_bw_weight(NULL, "Wmd", -1);
  1776. Wgb = networkstatus_get_bw_weight(NULL, "Wgb", -1);
  1777. Wmb = networkstatus_get_bw_weight(NULL, "Wmb", -1);
  1778. Web = networkstatus_get_bw_weight(NULL, "Web", -1);
  1779. Wdb = networkstatus_get_bw_weight(NULL, "Wdb", -1);
  1780. } else if (rule == WEIGHT_FOR_EXIT) {
  1781. // Guards CAN be exits if they have weird exit policies
  1782. // They are d then I guess...
  1783. We = networkstatus_get_bw_weight(NULL, "Wee", -1);
  1784. Wm = networkstatus_get_bw_weight(NULL, "Wem", -1); /* Odd exit policies */
  1785. Wd = networkstatus_get_bw_weight(NULL, "Wed", -1);
  1786. Wg = networkstatus_get_bw_weight(NULL, "Weg", -1); /* Odd exit policies */
  1787. Wgb = networkstatus_get_bw_weight(NULL, "Wgb", -1);
  1788. Wmb = networkstatus_get_bw_weight(NULL, "Wmb", -1);
  1789. Web = networkstatus_get_bw_weight(NULL, "Web", -1);
  1790. Wdb = networkstatus_get_bw_weight(NULL, "Wdb", -1);
  1791. } else if (rule == WEIGHT_FOR_DIR) {
  1792. We = networkstatus_get_bw_weight(NULL, "Wbe", -1);
  1793. Wm = networkstatus_get_bw_weight(NULL, "Wbm", -1);
  1794. Wd = networkstatus_get_bw_weight(NULL, "Wbd", -1);
  1795. Wg = networkstatus_get_bw_weight(NULL, "Wbg", -1);
  1796. Wgb = Wmb = Web = Wdb = weight_scale;
  1797. } else if (rule == NO_WEIGHTING) {
  1798. Wg = Wm = We = Wd = weight_scale;
  1799. Wgb = Wmb = Web = Wdb = weight_scale;
  1800. }
  1801. if (Wg < 0 || Wm < 0 || We < 0 || Wd < 0 || Wgb < 0 || Wmb < 0 || Wdb < 0
  1802. || Web < 0) {
  1803. log_debug(LD_CIRC,
  1804. "Got negative bandwidth weights. Defaulting to naive selection"
  1805. " algorithm.");
  1806. Wg = Wm = We = Wd = weight_scale;
  1807. Wgb = Wmb = Web = Wdb = weight_scale;
  1808. }
  1809. Wg /= weight_scale;
  1810. Wm /= weight_scale;
  1811. We /= weight_scale;
  1812. Wd /= weight_scale;
  1813. Wgb /= weight_scale;
  1814. Wmb /= weight_scale;
  1815. Web /= weight_scale;
  1816. Wdb /= weight_scale;
  1817. bandwidths = tor_calloc(smartlist_len(sl), sizeof(u64_dbl_t));
  1818. // Cycle through smartlist and total the bandwidth.
  1819. static int warned_missing_bw = 0;
  1820. SMARTLIST_FOREACH_BEGIN(sl, const node_t *, node) {
  1821. int is_exit = 0, is_guard = 0, is_dir = 0, this_bw = 0;
  1822. double weight = 1;
  1823. is_exit = node->is_exit && ! node->is_bad_exit;
  1824. is_guard = node->is_possible_guard;
  1825. is_dir = node_is_dir(node);
  1826. if (node->rs) {
  1827. if (!node->rs->has_bandwidth) {
  1828. /* This should never happen, unless all the authorites downgrade
  1829. * to 0.2.0 or rogue routerstatuses get inserted into our consensus. */
  1830. if (! warned_missing_bw) {
  1831. log_warn(LD_BUG,
  1832. "Consensus is missing some bandwidths. Using a naive "
  1833. "router selection algorithm");
  1834. warned_missing_bw = 1;
  1835. }
  1836. this_bw = 30000; /* Chosen arbitrarily */
  1837. } else {
  1838. this_bw = kb_to_bytes(node->rs->bandwidth_kb);
  1839. }
  1840. } else if (node->ri) {
  1841. /* bridge or other descriptor not in our consensus */
  1842. this_bw = bridge_get_advertised_bandwidth_bounded(node->ri);
  1843. } else {
  1844. /* We can't use this one. */
  1845. continue;
  1846. }
  1847. if (is_guard && is_exit) {
  1848. weight = (is_dir ? Wdb*Wd : Wd);
  1849. } else if (is_guard) {
  1850. weight = (is_dir ? Wgb*Wg : Wg);
  1851. } else if (is_exit) {
  1852. weight = (is_dir ? Web*We : We);
  1853. } else { // middle
  1854. weight = (is_dir ? Wmb*Wm : Wm);
  1855. }
  1856. /* These should be impossible; but overflows here would be bad, so let's
  1857. * make sure. */
  1858. if (this_bw < 0)
  1859. this_bw = 0;
  1860. if (weight < 0.0)
  1861. weight = 0.0;
  1862. bandwidths[node_sl_idx].dbl = weight*this_bw + 0.5;
  1863. } SMARTLIST_FOREACH_END(node);
  1864. log_debug(LD_CIRC, "Generated weighted bandwidths for rule %s based "
  1865. "on weights "
  1866. "Wg=%f Wm=%f We=%f Wd=%f with total bw "U64_FORMAT,
  1867. bandwidth_weight_rule_to_string(rule),
  1868. Wg, Wm, We, Wd, U64_PRINTF_ARG(weighted_bw));
  1869. *bandwidths_out = bandwidths;
  1870. return 0;
  1871. }
  1872. /** For all nodes in <b>sl</b>, return the fraction of those nodes, weighted
  1873. * by their weighted bandwidths with rule <b>rule</b>, for which we have
  1874. * descriptors. */
  1875. double
  1876. frac_nodes_with_descriptors(const smartlist_t *sl,
  1877. bandwidth_weight_rule_t rule)
  1878. {
  1879. u64_dbl_t *bandwidths = NULL;
  1880. double total, present;
  1881. if (smartlist_len(sl) == 0)
  1882. return 0.0;
  1883. if (compute_weighted_bandwidths(sl, rule, &bandwidths) < 0) {
  1884. int n_with_descs = 0;
  1885. SMARTLIST_FOREACH(sl, const node_t *, node, {
  1886. if (node_has_descriptor(node))
  1887. n_with_descs++;
  1888. });
  1889. return ((double)n_with_descs) / (double)smartlist_len(sl);
  1890. }
  1891. total = present = 0.0;
  1892. SMARTLIST_FOREACH_BEGIN(sl, const node_t *, node) {
  1893. const double bw = bandwidths[node_sl_idx].dbl;
  1894. total += bw;
  1895. if (node_has_descriptor(node))
  1896. present += bw;
  1897. } SMARTLIST_FOREACH_END(node);
  1898. tor_free(bandwidths);
  1899. if (total < 1.0)
  1900. return 0;
  1901. return present / total;
  1902. }
  1903. /** Choose a random element of status list <b>sl</b>, weighted by
  1904. * the advertised bandwidth of each node */
  1905. const node_t *
  1906. node_sl_choose_by_bandwidth(const smartlist_t *sl,
  1907. bandwidth_weight_rule_t rule)
  1908. { /*XXXX MOVE */
  1909. return smartlist_choose_node_by_bandwidth_weights(sl, rule);
  1910. }
  1911. /** Return a random running node from the nodelist. Never
  1912. * pick a node that is in
  1913. * <b>excludedsmartlist</b>, or which matches <b>excludedset</b>,
  1914. * even if they are the only nodes available.
  1915. * If <b>CRN_NEED_UPTIME</b> is set in flags and any router has more than
  1916. * a minimum uptime, return one of those.
  1917. * If <b>CRN_NEED_CAPACITY</b> is set in flags, weight your choice by the
  1918. * advertised capacity of each router.
  1919. * If <b>CRN_ALLOW_INVALID</b> is not set in flags, consider only Valid
  1920. * routers.
  1921. * If <b>CRN_NEED_GUARD</b> is set in flags, consider only Guard routers.
  1922. * If <b>CRN_WEIGHT_AS_EXIT</b> is set in flags, we weight bandwidths as if
  1923. * picking an exit node, otherwise we weight bandwidths for picking a relay
  1924. * node (that is, possibly discounting exit nodes).
  1925. * If <b>CRN_NEED_DESC</b> is set in flags, we only consider nodes that
  1926. * have a routerinfo or microdescriptor -- that is, enough info to be
  1927. * used to build a circuit.
  1928. */
  1929. const node_t *
  1930. router_choose_random_node(smartlist_t *excludedsmartlist,
  1931. routerset_t *excludedset,
  1932. router_crn_flags_t flags)
  1933. { /* XXXX MOVE */
  1934. const int need_uptime = (flags & CRN_NEED_UPTIME) != 0;
  1935. const int need_capacity = (flags & CRN_NEED_CAPACITY) != 0;
  1936. const int need_guard = (flags & CRN_NEED_GUARD) != 0;
  1937. const int allow_invalid = (flags & CRN_ALLOW_INVALID) != 0;
  1938. const int weight_for_exit = (flags & CRN_WEIGHT_AS_EXIT) != 0;
  1939. const int need_desc = (flags & CRN_NEED_DESC) != 0;
  1940. smartlist_t *sl=smartlist_new(),
  1941. *excludednodes=smartlist_new();
  1942. const node_t *choice = NULL;
  1943. const routerinfo_t *r;
  1944. bandwidth_weight_rule_t rule;
  1945. tor_assert(!(weight_for_exit && need_guard));
  1946. rule = weight_for_exit ? WEIGHT_FOR_EXIT :
  1947. (need_guard ? WEIGHT_FOR_GUARD : WEIGHT_FOR_MID);
  1948. /* Exclude relays that allow single hop exit circuits, if the user
  1949. * wants to (such relays might be risky) */
  1950. if (get_options()->ExcludeSingleHopRelays) {
  1951. SMARTLIST_FOREACH(nodelist_get_list(), node_t *, node,
  1952. if (node_allows_single_hop_exits(node)) {
  1953. smartlist_add(excludednodes, node);
  1954. });
  1955. }
  1956. if ((r = routerlist_find_my_routerinfo()))
  1957. routerlist_add_node_and_family(excludednodes, r);
  1958. router_add_running_nodes_to_smartlist(sl, allow_invalid,
  1959. need_uptime, need_capacity,
  1960. need_guard, need_desc);
  1961. smartlist_subtract(sl,excludednodes);
  1962. if (excludedsmartlist)
  1963. smartlist_subtract(sl,excludedsmartlist);
  1964. if (excludedset)
  1965. routerset_subtract_nodes(sl,excludedset);
  1966. // Always weight by bandwidth
  1967. choice = node_sl_choose_by_bandwidth(sl, rule);
  1968. smartlist_free(sl);
  1969. if (!choice && (need_uptime || need_capacity || need_guard)) {
  1970. /* try once more -- recurse but with fewer restrictions. */
  1971. log_info(LD_CIRC,
  1972. "We couldn't find any live%s%s%s routers; falling back "
  1973. "to list of all routers.",
  1974. need_capacity?", fast":"",
  1975. need_uptime?", stable":"",
  1976. need_guard?", guard":"");
  1977. flags &= ~ (CRN_NEED_UPTIME|CRN_NEED_CAPACITY|CRN_NEED_GUARD);
  1978. choice = router_choose_random_node(
  1979. excludedsmartlist, excludedset, flags);
  1980. }
  1981. smartlist_free(excludednodes);
  1982. if (!choice) {
  1983. log_warn(LD_CIRC,
  1984. "No available nodes when trying to choose node. Failing.");
  1985. }
  1986. return choice;
  1987. }
  1988. /** Helper: given an extended nickname in <b>hexdigest</b> try to decode it.
  1989. * Return 0 on success, -1 on failure. Store the result into the
  1990. * DIGEST_LEN-byte buffer at <b>digest_out</b>, the single character at
  1991. * <b>nickname_qualifier_char_out</b>, and the MAXNICKNAME_LEN+1-byte buffer
  1992. * at <b>nickname_out</b>.
  1993. *
  1994. * The recognized format is:
  1995. * HexName = Dollar? HexDigest NamePart?
  1996. * Dollar = '?'
  1997. * HexDigest = HexChar*20
  1998. * HexChar = 'a'..'f' | 'A'..'F' | '0'..'9'
  1999. * NamePart = QualChar Name
  2000. * QualChar = '=' | '~'
  2001. * Name = NameChar*(1..MAX_NICKNAME_LEN)
  2002. * NameChar = Any ASCII alphanumeric character
  2003. */
  2004. int
  2005. hex_digest_nickname_decode(const char *hexdigest,
  2006. char *digest_out,
  2007. char *nickname_qualifier_char_out,
  2008. char *nickname_out)
  2009. {
  2010. size_t len;
  2011. tor_assert(hexdigest);
  2012. if (hexdigest[0] == '$')
  2013. ++hexdigest;
  2014. len = strlen(hexdigest);
  2015. if (len < HEX_DIGEST_LEN) {
  2016. return -1;
  2017. } else if (len > HEX_DIGEST_LEN && (hexdigest[HEX_DIGEST_LEN] == '=' ||
  2018. hexdigest[HEX_DIGEST_LEN] == '~') &&
  2019. len <= HEX_DIGEST_LEN+1+MAX_NICKNAME_LEN) {
  2020. *nickname_qualifier_char_out = hexdigest[HEX_DIGEST_LEN];
  2021. strlcpy(nickname_out, hexdigest+HEX_DIGEST_LEN+1 , MAX_NICKNAME_LEN+1);
  2022. } else if (len == HEX_DIGEST_LEN) {
  2023. ;
  2024. } else {
  2025. return -1;
  2026. }
  2027. if (base16_decode(digest_out, DIGEST_LEN, hexdigest, HEX_DIGEST_LEN)<0)
  2028. return -1;
  2029. return 0;
  2030. }
  2031. /** Helper: Return true iff the <b>identity_digest</b> and <b>nickname</b>
  2032. * combination of a router, encoded in hexadecimal, matches <b>hexdigest</b>
  2033. * (which is optionally prefixed with a single dollar sign). Return false if
  2034. * <b>hexdigest</b> is malformed, or it doesn't match. */
  2035. int
  2036. hex_digest_nickname_matches(const char *hexdigest, const char *identity_digest,
  2037. const char *nickname, int is_named)
  2038. {
  2039. char digest[DIGEST_LEN];
  2040. char nn_char='\0';
  2041. char nn_buf[MAX_NICKNAME_LEN+1];
  2042. if (hex_digest_nickname_decode(hexdigest, digest, &nn_char, nn_buf) == -1)
  2043. return 0;
  2044. if (nn_char == '=' || nn_char == '~') {
  2045. if (!nickname)
  2046. return 0;
  2047. if (strcasecmp(nn_buf, nickname))
  2048. return 0;
  2049. if (nn_char == '=' && !is_named)
  2050. return 0;
  2051. }
  2052. return tor_memeq(digest, identity_digest, DIGEST_LEN);
  2053. }
  2054. /** Return true iff <b>router</b> is listed as named in the current
  2055. * consensus. */
  2056. int
  2057. router_is_named(const routerinfo_t *router)
  2058. {
  2059. const char *digest =
  2060. networkstatus_get_router_digest_by_nickname(router->nickname);
  2061. return (digest &&
  2062. tor_memeq(digest, router->cache_info.identity_digest, DIGEST_LEN));
  2063. }
  2064. /** Return true iff <b>digest</b> is the digest of the identity key of a
  2065. * trusted directory matching at least one bit of <b>type</b>. If <b>type</b>
  2066. * is zero (NO_DIRINFO), or ALL_DIRINFO, any authority is okay. */
  2067. int
  2068. router_digest_is_trusted_dir_type(const char *digest, dirinfo_type_t type)
  2069. {
  2070. if (!trusted_dir_servers)
  2071. return 0;
  2072. if (authdir_mode(get_options()) && router_digest_is_me(digest))
  2073. return 1;
  2074. SMARTLIST_FOREACH(trusted_dir_servers, dir_server_t *, ent,
  2075. if (tor_memeq(digest, ent->digest, DIGEST_LEN)) {
  2076. return (!type) || ((type & ent->type) != 0);
  2077. });
  2078. return 0;
  2079. }
  2080. /** Return true iff <b>addr</b> is the address of one of our trusted
  2081. * directory authorities. */
  2082. int
  2083. router_addr_is_trusted_dir(uint32_t addr)
  2084. {
  2085. if (!trusted_dir_servers)
  2086. return 0;
  2087. SMARTLIST_FOREACH(trusted_dir_servers, dir_server_t *, ent,
  2088. if (ent->addr == addr)
  2089. return 1;
  2090. );
  2091. return 0;
  2092. }
  2093. /** If hexdigest is correctly formed, base16_decode it into
  2094. * digest, which must have DIGEST_LEN space in it.
  2095. * Return 0 on success, -1 on failure.
  2096. */
  2097. int
  2098. hexdigest_to_digest(const char *hexdigest, char *digest)
  2099. {
  2100. if (hexdigest[0]=='$')
  2101. ++hexdigest;
  2102. if (strlen(hexdigest) < HEX_DIGEST_LEN ||
  2103. base16_decode(digest,DIGEST_LEN,hexdigest,HEX_DIGEST_LEN) < 0)
  2104. return -1;
  2105. return 0;
  2106. }
  2107. /** As router_get_by_id_digest,but return a pointer that you're allowed to
  2108. * modify */
  2109. routerinfo_t *
  2110. router_get_mutable_by_digest(const char *digest)
  2111. {
  2112. tor_assert(digest);
  2113. if (!routerlist) return NULL;
  2114. // routerlist_assert_ok(routerlist);
  2115. return rimap_get(routerlist->identity_map, digest);
  2116. }
  2117. /** Return the router in our routerlist whose 20-byte key digest
  2118. * is <b>digest</b>. Return NULL if no such router is known. */
  2119. const routerinfo_t *
  2120. router_get_by_id_digest(const char *digest)
  2121. {
  2122. return router_get_mutable_by_digest(digest);
  2123. }
  2124. /** Return the router in our routerlist whose 20-byte descriptor
  2125. * is <b>digest</b>. Return NULL if no such router is known. */
  2126. signed_descriptor_t *
  2127. router_get_by_descriptor_digest(const char *digest)
  2128. {
  2129. tor_assert(digest);
  2130. if (!routerlist) return NULL;
  2131. return sdmap_get(routerlist->desc_digest_map, digest);
  2132. }
  2133. /** Return the signed descriptor for the router in our routerlist whose
  2134. * 20-byte extra-info digest is <b>digest</b>. Return NULL if no such router
  2135. * is known. */
  2136. MOCK_IMPL(signed_descriptor_t *,
  2137. router_get_by_extrainfo_digest,(const char *digest))
  2138. {
  2139. tor_assert(digest);
  2140. if (!routerlist) return NULL;
  2141. return sdmap_get(routerlist->desc_by_eid_map, digest);
  2142. }
  2143. /** Return the signed descriptor for the extrainfo_t in our routerlist whose
  2144. * extra-info-digest is <b>digest</b>. Return NULL if no such extra-info
  2145. * document is known. */
  2146. signed_descriptor_t *
  2147. extrainfo_get_by_descriptor_digest(const char *digest)
  2148. {
  2149. extrainfo_t *ei;
  2150. tor_assert(digest);
  2151. if (!routerlist) return NULL;
  2152. ei = eimap_get(routerlist->extra_info_map, digest);
  2153. return ei ? &ei->cache_info : NULL;
  2154. }
  2155. /** Return a pointer to the signed textual representation of a descriptor.
  2156. * The returned string is not guaranteed to be NUL-terminated: the string's
  2157. * length will be in desc-\>signed_descriptor_len.
  2158. *
  2159. * If <b>with_annotations</b> is set, the returned string will include
  2160. * the annotations
  2161. * (if any) preceding the descriptor. This will increase the length of the
  2162. * string by desc-\>annotations_len.
  2163. *
  2164. * The caller must not free the string returned.
  2165. */
  2166. static const char *
  2167. signed_descriptor_get_body_impl(const signed_descriptor_t *desc,
  2168. int with_annotations)
  2169. {
  2170. const char *r = NULL;
  2171. size_t len = desc->signed_descriptor_len;
  2172. off_t offset = desc->saved_offset;
  2173. if (with_annotations)
  2174. len += desc->annotations_len;
  2175. else
  2176. offset += desc->annotations_len;
  2177. tor_assert(len > 32);
  2178. if (desc->saved_location == SAVED_IN_CACHE && routerlist) {
  2179. desc_store_t *store = desc_get_store(router_get_routerlist(), desc);
  2180. if (store && store->mmap) {
  2181. tor_assert(desc->saved_offset + len <= store->mmap->size);
  2182. r = store->mmap->data + offset;
  2183. } else if (store) {
  2184. log_err(LD_DIR, "We couldn't read a descriptor that is supposedly "
  2185. "mmaped in our cache. Is another process running in our data "
  2186. "directory? Exiting.");
  2187. exit(1);
  2188. }
  2189. }
  2190. if (!r) /* no mmap, or not in cache. */
  2191. r = desc->signed_descriptor_body +
  2192. (with_annotations ? 0 : desc->annotations_len);
  2193. tor_assert(r);
  2194. if (!with_annotations) {
  2195. if (fast_memcmp("router ", r, 7) && fast_memcmp("extra-info ", r, 11)) {
  2196. char *cp = tor_strndup(r, 64);
  2197. log_err(LD_DIR, "descriptor at %p begins with unexpected string %s. "
  2198. "Is another process running in our data directory? Exiting.",
  2199. desc, escaped(cp));
  2200. exit(1);
  2201. }
  2202. }
  2203. return r;
  2204. }
  2205. /** Return a pointer to the signed textual representation of a descriptor.
  2206. * The returned string is not guaranteed to be NUL-terminated: the string's
  2207. * length will be in desc-\>signed_descriptor_len.
  2208. *
  2209. * The caller must not free the string returned.
  2210. */
  2211. const char *
  2212. signed_descriptor_get_body(const signed_descriptor_t *desc)
  2213. {
  2214. return signed_descriptor_get_body_impl(desc, 0);
  2215. }
  2216. /** As signed_descriptor_get_body(), but points to the beginning of the
  2217. * annotations section rather than the beginning of the descriptor. */
  2218. const char *
  2219. signed_descriptor_get_annotations(const signed_descriptor_t *desc)
  2220. {
  2221. return signed_descriptor_get_body_impl(desc, 1);
  2222. }
  2223. /** Return the current list of all known routers. */
  2224. routerlist_t *
  2225. router_get_routerlist(void)
  2226. {
  2227. if (PREDICT_UNLIKELY(!routerlist)) {
  2228. routerlist = tor_malloc_zero(sizeof(routerlist_t));
  2229. routerlist->routers = smartlist_new();
  2230. routerlist->old_routers = smartlist_new();
  2231. routerlist->identity_map = rimap_new();
  2232. routerlist->desc_digest_map = sdmap_new();
  2233. routerlist->desc_by_eid_map = sdmap_new();
  2234. routerlist->extra_info_map = eimap_new();
  2235. routerlist->desc_store.fname_base = "cached-descriptors";
  2236. routerlist->extrainfo_store.fname_base = "cached-extrainfo";
  2237. routerlist->desc_store.type = ROUTER_STORE;
  2238. routerlist->extrainfo_store.type = EXTRAINFO_STORE;
  2239. routerlist->desc_store.description = "router descriptors";
  2240. routerlist->extrainfo_store.description = "extra-info documents";
  2241. }
  2242. return routerlist;
  2243. }
  2244. /** Free all storage held by <b>router</b>. */
  2245. void
  2246. routerinfo_free(routerinfo_t *router)
  2247. {
  2248. if (!router)
  2249. return;
  2250. tor_free(router->cache_info.signed_descriptor_body);
  2251. tor_free(router->nickname);
  2252. tor_free(router->platform);
  2253. tor_free(router->contact_info);
  2254. if (router->onion_pkey)
  2255. crypto_pk_free(router->onion_pkey);
  2256. tor_free(router->onion_curve25519_pkey);
  2257. if (router->identity_pkey)
  2258. crypto_pk_free(router->identity_pkey);
  2259. if (router->declared_family) {
  2260. SMARTLIST_FOREACH(router->declared_family, char *, s, tor_free(s));
  2261. smartlist_free(router->declared_family);
  2262. }
  2263. addr_policy_list_free(router->exit_policy);
  2264. short_policy_free(router->ipv6_exit_policy);
  2265. memset(router, 77, sizeof(routerinfo_t));
  2266. tor_free(router);
  2267. }
  2268. /** Release all storage held by <b>extrainfo</b> */
  2269. void
  2270. extrainfo_free(extrainfo_t *extrainfo)
  2271. {
  2272. if (!extrainfo)
  2273. return;
  2274. tor_free(extrainfo->cache_info.signed_descriptor_body);
  2275. tor_free(extrainfo->pending_sig);
  2276. memset(extrainfo, 88, sizeof(extrainfo_t)); /* debug bad memory usage */
  2277. tor_free(extrainfo);
  2278. }
  2279. /** Release storage held by <b>sd</b>. */
  2280. static void
  2281. signed_descriptor_free(signed_descriptor_t *sd)
  2282. {
  2283. if (!sd)
  2284. return;
  2285. tor_free(sd->signed_descriptor_body);
  2286. memset(sd, 99, sizeof(signed_descriptor_t)); /* Debug bad mem usage */
  2287. tor_free(sd);
  2288. }
  2289. /** Extract a signed_descriptor_t from a general routerinfo, and free the
  2290. * routerinfo.
  2291. */
  2292. static signed_descriptor_t *
  2293. signed_descriptor_from_routerinfo(routerinfo_t *ri)
  2294. {
  2295. signed_descriptor_t *sd;
  2296. tor_assert(ri->purpose == ROUTER_PURPOSE_GENERAL);
  2297. sd = tor_malloc_zero(sizeof(signed_descriptor_t));
  2298. memcpy(sd, &(ri->cache_info), sizeof(signed_descriptor_t));
  2299. sd->routerlist_index = -1;
  2300. ri->cache_info.signed_descriptor_body = NULL;
  2301. routerinfo_free(ri);
  2302. return sd;
  2303. }
  2304. /** Helper: free the storage held by the extrainfo_t in <b>e</b>. */
  2305. static void
  2306. extrainfo_free_(void *e)
  2307. {
  2308. extrainfo_free(e);
  2309. }
  2310. /** Free all storage held by a routerlist <b>rl</b>. */
  2311. void
  2312. routerlist_free(routerlist_t *rl)
  2313. {
  2314. if (!rl)
  2315. return;
  2316. rimap_free(rl->identity_map, NULL);
  2317. sdmap_free(rl->desc_digest_map, NULL);
  2318. sdmap_free(rl->desc_by_eid_map, NULL);
  2319. eimap_free(rl->extra_info_map, extrainfo_free_);
  2320. SMARTLIST_FOREACH(rl->routers, routerinfo_t *, r,
  2321. routerinfo_free(r));
  2322. SMARTLIST_FOREACH(rl->old_routers, signed_descriptor_t *, sd,
  2323. signed_descriptor_free(sd));
  2324. smartlist_free(rl->routers);
  2325. smartlist_free(rl->old_routers);
  2326. if (rl->desc_store.mmap) {
  2327. int res = tor_munmap_file(routerlist->desc_store.mmap);
  2328. if (res != 0) {
  2329. log_warn(LD_FS, "Failed to munmap routerlist->desc_store.mmap");
  2330. }
  2331. }
  2332. if (rl->extrainfo_store.mmap) {
  2333. int res = tor_munmap_file(routerlist->extrainfo_store.mmap);
  2334. if (res != 0) {
  2335. log_warn(LD_FS, "Failed to munmap routerlist->extrainfo_store.mmap");
  2336. }
  2337. }
  2338. tor_free(rl);
  2339. router_dir_info_changed();
  2340. }
  2341. /** Log information about how much memory is being used for routerlist,
  2342. * at log level <b>severity</b>. */
  2343. void
  2344. dump_routerlist_mem_usage(int severity)
  2345. {
  2346. uint64_t livedescs = 0;
  2347. uint64_t olddescs = 0;
  2348. if (!routerlist)
  2349. return;
  2350. SMARTLIST_FOREACH(routerlist->routers, routerinfo_t *, r,
  2351. livedescs += r->cache_info.signed_descriptor_len);
  2352. SMARTLIST_FOREACH(routerlist->old_routers, signed_descriptor_t *, sd,
  2353. olddescs += sd->signed_descriptor_len);
  2354. tor_log(severity, LD_DIR,
  2355. "In %d live descriptors: "U64_FORMAT" bytes. "
  2356. "In %d old descriptors: "U64_FORMAT" bytes.",
  2357. smartlist_len(routerlist->routers), U64_PRINTF_ARG(livedescs),
  2358. smartlist_len(routerlist->old_routers), U64_PRINTF_ARG(olddescs));
  2359. }
  2360. /** Debugging helper: If <b>idx</b> is nonnegative, assert that <b>ri</b> is
  2361. * in <b>sl</b> at position <b>idx</b>. Otherwise, search <b>sl</b> for
  2362. * <b>ri</b>. Return the index of <b>ri</b> in <b>sl</b>, or -1 if <b>ri</b>
  2363. * is not in <b>sl</b>. */
  2364. static INLINE int
  2365. routerlist_find_elt_(smartlist_t *sl, void *ri, int idx)
  2366. {
  2367. if (idx < 0) {
  2368. idx = -1;
  2369. SMARTLIST_FOREACH(sl, routerinfo_t *, r,
  2370. if (r == ri) {
  2371. idx = r_sl_idx;
  2372. break;
  2373. });
  2374. } else {
  2375. tor_assert(idx < smartlist_len(sl));
  2376. tor_assert(smartlist_get(sl, idx) == ri);
  2377. };
  2378. return idx;
  2379. }
  2380. /** Insert an item <b>ri</b> into the routerlist <b>rl</b>, updating indices
  2381. * as needed. There must be no previous member of <b>rl</b> with the same
  2382. * identity digest as <b>ri</b>: If there is, call routerlist_replace
  2383. * instead.
  2384. */
  2385. static void
  2386. routerlist_insert(routerlist_t *rl, routerinfo_t *ri)
  2387. {
  2388. routerinfo_t *ri_old;
  2389. signed_descriptor_t *sd_old;
  2390. {
  2391. const routerinfo_t *ri_generated = router_get_my_routerinfo();
  2392. tor_assert(ri_generated != ri);
  2393. }
  2394. tor_assert(ri->cache_info.routerlist_index == -1);
  2395. ri_old = rimap_set(rl->identity_map, ri->cache_info.identity_digest, ri);
  2396. tor_assert(!ri_old);
  2397. sd_old = sdmap_set(rl->desc_digest_map,
  2398. ri->cache_info.signed_descriptor_digest,
  2399. &(ri->cache_info));
  2400. if (sd_old) {
  2401. int idx = sd_old->routerlist_index;
  2402. sd_old->routerlist_index = -1;
  2403. smartlist_del(rl->old_routers, idx);
  2404. if (idx < smartlist_len(rl->old_routers)) {
  2405. signed_descriptor_t *d = smartlist_get(rl->old_routers, idx);
  2406. d->routerlist_index = idx;
  2407. }
  2408. rl->desc_store.bytes_dropped += sd_old->signed_descriptor_len;
  2409. sdmap_remove(rl->desc_by_eid_map, sd_old->extra_info_digest);
  2410. signed_descriptor_free(sd_old);
  2411. }
  2412. if (!tor_digest_is_zero(ri->cache_info.extra_info_digest))
  2413. sdmap_set(rl->desc_by_eid_map, ri->cache_info.extra_info_digest,
  2414. &ri->cache_info);
  2415. smartlist_add(rl->routers, ri);
  2416. ri->cache_info.routerlist_index = smartlist_len(rl->routers) - 1;
  2417. nodelist_set_routerinfo(ri, NULL);
  2418. router_dir_info_changed();
  2419. #ifdef DEBUG_ROUTERLIST
  2420. routerlist_assert_ok(rl);
  2421. #endif
  2422. }
  2423. /** Adds the extrainfo_t <b>ei</b> to the routerlist <b>rl</b>, if there is a
  2424. * corresponding router in rl-\>routers or rl-\>old_routers. Return the status
  2425. * of inserting <b>ei</b>. Free <b>ei</b> if it isn't inserted. */
  2426. MOCK_IMPL(STATIC was_router_added_t,
  2427. extrainfo_insert,(routerlist_t *rl, extrainfo_t *ei))
  2428. {
  2429. was_router_added_t r;
  2430. const char *compatibility_error_msg;
  2431. routerinfo_t *ri = rimap_get(rl->identity_map,
  2432. ei->cache_info.identity_digest);
  2433. signed_descriptor_t *sd =
  2434. sdmap_get(rl->desc_by_eid_map, ei->cache_info.signed_descriptor_digest);
  2435. extrainfo_t *ei_tmp;
  2436. {
  2437. extrainfo_t *ei_generated = router_get_my_extrainfo();
  2438. tor_assert(ei_generated != ei);
  2439. }
  2440. if (!ri) {
  2441. /* This router is unknown; we can't even verify the signature. Give up.*/
  2442. r = ROUTER_NOT_IN_CONSENSUS;
  2443. goto done;
  2444. }
  2445. if (routerinfo_incompatible_with_extrainfo(ri, ei, sd,
  2446. &compatibility_error_msg)) {
  2447. r = (ri->cache_info.extrainfo_is_bogus) ?
  2448. ROUTER_BAD_EI : ROUTER_NOT_IN_CONSENSUS;
  2449. log_warn(LD_DIR,"router info incompatible with extra info (reason: %s)",
  2450. compatibility_error_msg);
  2451. goto done;
  2452. }
  2453. /* Okay, if we make it here, we definitely have a router corresponding to
  2454. * this extrainfo. */
  2455. ei_tmp = eimap_set(rl->extra_info_map,
  2456. ei->cache_info.signed_descriptor_digest,
  2457. ei);
  2458. r = ROUTER_ADDED_SUCCESSFULLY;
  2459. if (ei_tmp) {
  2460. rl->extrainfo_store.bytes_dropped +=
  2461. ei_tmp->cache_info.signed_descriptor_len;
  2462. extrainfo_free(ei_tmp);
  2463. }
  2464. done:
  2465. if (r != ROUTER_ADDED_SUCCESSFULLY)
  2466. extrainfo_free(ei);
  2467. #ifdef DEBUG_ROUTERLIST
  2468. routerlist_assert_ok(rl);
  2469. #endif
  2470. return r;
  2471. }
  2472. #define should_cache_old_descriptors() \
  2473. directory_caches_dir_info(get_options())
  2474. /** If we're a directory cache and routerlist <b>rl</b> doesn't have
  2475. * a copy of router <b>ri</b> yet, add it to the list of old (not
  2476. * recommended but still served) descriptors. Else free it. */
  2477. static void
  2478. routerlist_insert_old(routerlist_t *rl, routerinfo_t *ri)
  2479. {
  2480. {
  2481. const routerinfo_t *ri_generated = router_get_my_routerinfo();
  2482. tor_assert(ri_generated != ri);
  2483. }
  2484. tor_assert(ri->cache_info.routerlist_index == -1);
  2485. if (should_cache_old_descriptors() &&
  2486. ri->purpose == ROUTER_PURPOSE_GENERAL &&
  2487. !sdmap_get(rl->desc_digest_map,
  2488. ri->cache_info.signed_descriptor_digest)) {
  2489. signed_descriptor_t *sd = signed_descriptor_from_routerinfo(ri);
  2490. sdmap_set(rl->desc_digest_map, sd->signed_descriptor_digest, sd);
  2491. smartlist_add(rl->old_routers, sd);
  2492. sd->routerlist_index = smartlist_len(rl->old_routers)-1;
  2493. if (!tor_digest_is_zero(sd->extra_info_digest))
  2494. sdmap_set(rl->desc_by_eid_map, sd->extra_info_digest, sd);
  2495. } else {
  2496. routerinfo_free(ri);
  2497. }
  2498. #ifdef DEBUG_ROUTERLIST
  2499. routerlist_assert_ok(rl);
  2500. #endif
  2501. }
  2502. /** Remove an item <b>ri</b> from the routerlist <b>rl</b>, updating indices
  2503. * as needed. If <b>idx</b> is nonnegative and smartlist_get(rl-&gt;routers,
  2504. * idx) == ri, we don't need to do a linear search over the list to decide
  2505. * which to remove. We fill the gap in rl-&gt;routers with a later element in
  2506. * the list, if any exists. <b>ri</b> is freed.
  2507. *
  2508. * If <b>make_old</b> is true, instead of deleting the router, we try adding
  2509. * it to rl-&gt;old_routers. */
  2510. void
  2511. routerlist_remove(routerlist_t *rl, routerinfo_t *ri, int make_old, time_t now)
  2512. {
  2513. routerinfo_t *ri_tmp;
  2514. extrainfo_t *ei_tmp;
  2515. int idx = ri->cache_info.routerlist_index;
  2516. tor_assert(0 <= idx && idx < smartlist_len(rl->routers));
  2517. tor_assert(smartlist_get(rl->routers, idx) == ri);
  2518. nodelist_remove_routerinfo(ri);
  2519. /* make sure the rephist module knows that it's not running */
  2520. rep_hist_note_router_unreachable(ri->cache_info.identity_digest, now);
  2521. ri->cache_info.routerlist_index = -1;
  2522. smartlist_del(rl->routers, idx);
  2523. if (idx < smartlist_len(rl->routers)) {
  2524. routerinfo_t *r = smartlist_get(rl->routers, idx);
  2525. r->cache_info.routerlist_index = idx;
  2526. }
  2527. ri_tmp = rimap_remove(rl->identity_map, ri->cache_info.identity_digest);
  2528. router_dir_info_changed();
  2529. tor_assert(ri_tmp == ri);
  2530. if (make_old && should_cache_old_descriptors() &&
  2531. ri->purpose == ROUTER_PURPOSE_GENERAL) {
  2532. signed_descriptor_t *sd;
  2533. sd = signed_descriptor_from_routerinfo(ri);
  2534. smartlist_add(rl->old_routers, sd);
  2535. sd->routerlist_index = smartlist_len(rl->old_routers)-1;
  2536. sdmap_set(rl->desc_digest_map, sd->signed_descriptor_digest, sd);
  2537. if (!tor_digest_is_zero(sd->extra_info_digest))
  2538. sdmap_set(rl->desc_by_eid_map, sd->extra_info_digest, sd);
  2539. } else {
  2540. signed_descriptor_t *sd_tmp;
  2541. sd_tmp = sdmap_remove(rl->desc_digest_map,
  2542. ri->cache_info.signed_descriptor_digest);
  2543. tor_assert(sd_tmp == &(ri->cache_info));
  2544. rl->desc_store.bytes_dropped += ri->cache_info.signed_descriptor_len;
  2545. ei_tmp = eimap_remove(rl->extra_info_map,
  2546. ri->cache_info.extra_info_digest);
  2547. if (ei_tmp) {
  2548. rl->extrainfo_store.bytes_dropped +=
  2549. ei_tmp->cache_info.signed_descriptor_len;
  2550. extrainfo_free(ei_tmp);
  2551. }
  2552. if (!tor_digest_is_zero(ri->cache_info.extra_info_digest))
  2553. sdmap_remove(rl->desc_by_eid_map, ri->cache_info.extra_info_digest);
  2554. routerinfo_free(ri);
  2555. }
  2556. #ifdef DEBUG_ROUTERLIST
  2557. routerlist_assert_ok(rl);
  2558. #endif
  2559. }
  2560. /** Remove a signed_descriptor_t <b>sd</b> from <b>rl</b>-\>old_routers, and
  2561. * adjust <b>rl</b> as appropriate. <b>idx</b> is -1, or the index of
  2562. * <b>sd</b>. */
  2563. static void
  2564. routerlist_remove_old(routerlist_t *rl, signed_descriptor_t *sd, int idx)
  2565. {
  2566. signed_descriptor_t *sd_tmp;
  2567. extrainfo_t *ei_tmp;
  2568. desc_store_t *store;
  2569. if (idx == -1) {
  2570. idx = sd->routerlist_index;
  2571. }
  2572. tor_assert(0 <= idx && idx < smartlist_len(rl->old_routers));
  2573. /* XXXX edmanm's bridge relay triggered the following assert while
  2574. * running 0.2.0.12-alpha. If anybody triggers this again, see if we
  2575. * can get a backtrace. */
  2576. tor_assert(smartlist_get(rl->old_routers, idx) == sd);
  2577. tor_assert(idx == sd->routerlist_index);
  2578. sd->routerlist_index = -1;
  2579. smartlist_del(rl->old_routers, idx);
  2580. if (idx < smartlist_len(rl->old_routers)) {
  2581. signed_descriptor_t *d = smartlist_get(rl->old_routers, idx);
  2582. d->routerlist_index = idx;
  2583. }
  2584. sd_tmp = sdmap_remove(rl->desc_digest_map,
  2585. sd->signed_descriptor_digest);
  2586. tor_assert(sd_tmp == sd);
  2587. store = desc_get_store(rl, sd);
  2588. if (store)
  2589. store->bytes_dropped += sd->signed_descriptor_len;
  2590. ei_tmp = eimap_remove(rl->extra_info_map,
  2591. sd->extra_info_digest);
  2592. if (ei_tmp) {
  2593. rl->extrainfo_store.bytes_dropped +=
  2594. ei_tmp->cache_info.signed_descriptor_len;
  2595. extrainfo_free(ei_tmp);
  2596. }
  2597. if (!tor_digest_is_zero(sd->extra_info_digest))
  2598. sdmap_remove(rl->desc_by_eid_map, sd->extra_info_digest);
  2599. signed_descriptor_free(sd);
  2600. #ifdef DEBUG_ROUTERLIST
  2601. routerlist_assert_ok(rl);
  2602. #endif
  2603. }
  2604. /** Remove <b>ri_old</b> from the routerlist <b>rl</b>, and replace it with
  2605. * <b>ri_new</b>, updating all index info. If <b>idx</b> is nonnegative and
  2606. * smartlist_get(rl-&gt;routers, idx) == ri, we don't need to do a linear
  2607. * search over the list to decide which to remove. We put ri_new in the same
  2608. * index as ri_old, if possible. ri is freed as appropriate.
  2609. *
  2610. * If should_cache_descriptors() is true, instead of deleting the router,
  2611. * we add it to rl-&gt;old_routers. */
  2612. static void
  2613. routerlist_replace(routerlist_t *rl, routerinfo_t *ri_old,
  2614. routerinfo_t *ri_new)
  2615. {
  2616. int idx;
  2617. int same_descriptors;
  2618. routerinfo_t *ri_tmp;
  2619. extrainfo_t *ei_tmp;
  2620. {
  2621. const routerinfo_t *ri_generated = router_get_my_routerinfo();
  2622. tor_assert(ri_generated != ri_new);
  2623. }
  2624. tor_assert(ri_old != ri_new);
  2625. tor_assert(ri_new->cache_info.routerlist_index == -1);
  2626. idx = ri_old->cache_info.routerlist_index;
  2627. tor_assert(0 <= idx && idx < smartlist_len(rl->routers));
  2628. tor_assert(smartlist_get(rl->routers, idx) == ri_old);
  2629. {
  2630. routerinfo_t *ri_old_tmp=NULL;
  2631. nodelist_set_routerinfo(ri_new, &ri_old_tmp);
  2632. tor_assert(ri_old == ri_old_tmp);
  2633. }
  2634. router_dir_info_changed();
  2635. if (idx >= 0) {
  2636. smartlist_set(rl->routers, idx, ri_new);
  2637. ri_old->cache_info.routerlist_index = -1;
  2638. ri_new->cache_info.routerlist_index = idx;
  2639. /* Check that ri_old is not in rl->routers anymore: */
  2640. tor_assert( routerlist_find_elt_(rl->routers, ri_old, -1) == -1 );
  2641. } else {
  2642. log_warn(LD_BUG, "Appending entry from routerlist_replace.");
  2643. routerlist_insert(rl, ri_new);
  2644. return;
  2645. }
  2646. if (tor_memneq(ri_old->cache_info.identity_digest,
  2647. ri_new->cache_info.identity_digest, DIGEST_LEN)) {
  2648. /* digests don't match; digestmap_set won't replace */
  2649. rimap_remove(rl->identity_map, ri_old->cache_info.identity_digest);
  2650. }
  2651. ri_tmp = rimap_set(rl->identity_map,
  2652. ri_new->cache_info.identity_digest, ri_new);
  2653. tor_assert(!ri_tmp || ri_tmp == ri_old);
  2654. sdmap_set(rl->desc_digest_map,
  2655. ri_new->cache_info.signed_descriptor_digest,
  2656. &(ri_new->cache_info));
  2657. if (!tor_digest_is_zero(ri_new->cache_info.extra_info_digest)) {
  2658. sdmap_set(rl->desc_by_eid_map, ri_new->cache_info.extra_info_digest,
  2659. &ri_new->cache_info);
  2660. }
  2661. same_descriptors = tor_memeq(ri_old->cache_info.signed_descriptor_digest,
  2662. ri_new->cache_info.signed_descriptor_digest,
  2663. DIGEST_LEN);
  2664. if (should_cache_old_descriptors() &&
  2665. ri_old->purpose == ROUTER_PURPOSE_GENERAL &&
  2666. !same_descriptors) {
  2667. /* ri_old is going to become a signed_descriptor_t and go into
  2668. * old_routers */
  2669. signed_descriptor_t *sd = signed_descriptor_from_routerinfo(ri_old);
  2670. smartlist_add(rl->old_routers, sd);
  2671. sd->routerlist_index = smartlist_len(rl->old_routers)-1;
  2672. sdmap_set(rl->desc_digest_map, sd->signed_descriptor_digest, sd);
  2673. if (!tor_digest_is_zero(sd->extra_info_digest))
  2674. sdmap_set(rl->desc_by_eid_map, sd->extra_info_digest, sd);
  2675. } else {
  2676. /* We're dropping ri_old. */
  2677. if (!same_descriptors) {
  2678. /* digests don't match; The sdmap_set above didn't replace */
  2679. sdmap_remove(rl->desc_digest_map,
  2680. ri_old->cache_info.signed_descriptor_digest);
  2681. if (tor_memneq(ri_old->cache_info.extra_info_digest,
  2682. ri_new->cache_info.extra_info_digest, DIGEST_LEN)) {
  2683. ei_tmp = eimap_remove(rl->extra_info_map,
  2684. ri_old->cache_info.extra_info_digest);
  2685. if (ei_tmp) {
  2686. rl->extrainfo_store.bytes_dropped +=
  2687. ei_tmp->cache_info.signed_descriptor_len;
  2688. extrainfo_free(ei_tmp);
  2689. }
  2690. }
  2691. if (!tor_digest_is_zero(ri_old->cache_info.extra_info_digest)) {
  2692. sdmap_remove(rl->desc_by_eid_map,
  2693. ri_old->cache_info.extra_info_digest);
  2694. }
  2695. }
  2696. rl->desc_store.bytes_dropped += ri_old->cache_info.signed_descriptor_len;
  2697. routerinfo_free(ri_old);
  2698. }
  2699. #ifdef DEBUG_ROUTERLIST
  2700. routerlist_assert_ok(rl);
  2701. #endif
  2702. }
  2703. /** Extract the descriptor <b>sd</b> from old_routerlist, and re-parse
  2704. * it as a fresh routerinfo_t. */
  2705. static routerinfo_t *
  2706. routerlist_reparse_old(routerlist_t *rl, signed_descriptor_t *sd)
  2707. {
  2708. routerinfo_t *ri;
  2709. const char *body;
  2710. body = signed_descriptor_get_annotations(sd);
  2711. ri = router_parse_entry_from_string(body,
  2712. body+sd->signed_descriptor_len+sd->annotations_len,
  2713. 0, 1, NULL, NULL);
  2714. if (!ri)
  2715. return NULL;
  2716. memcpy(&ri->cache_info, sd, sizeof(signed_descriptor_t));
  2717. sd->signed_descriptor_body = NULL; /* Steal reference. */
  2718. ri->cache_info.routerlist_index = -1;
  2719. routerlist_remove_old(rl, sd, -1);
  2720. return ri;
  2721. }
  2722. /** Free all memory held by the routerlist module. */
  2723. void
  2724. routerlist_free_all(void)
  2725. {
  2726. routerlist_free(routerlist);
  2727. routerlist = NULL;
  2728. if (warned_nicknames) {
  2729. SMARTLIST_FOREACH(warned_nicknames, char *, cp, tor_free(cp));
  2730. smartlist_free(warned_nicknames);
  2731. warned_nicknames = NULL;
  2732. }
  2733. clear_dir_servers();
  2734. smartlist_free(trusted_dir_servers);
  2735. smartlist_free(fallback_dir_servers);
  2736. trusted_dir_servers = fallback_dir_servers = NULL;
  2737. if (trusted_dir_certs) {
  2738. digestmap_free(trusted_dir_certs, cert_list_free_);
  2739. trusted_dir_certs = NULL;
  2740. }
  2741. }
  2742. /** Forget that we have issued any router-related warnings, so that we'll
  2743. * warn again if we see the same errors. */
  2744. void
  2745. routerlist_reset_warnings(void)
  2746. {
  2747. if (!warned_nicknames)
  2748. warned_nicknames = smartlist_new();
  2749. SMARTLIST_FOREACH(warned_nicknames, char *, cp, tor_free(cp));
  2750. smartlist_clear(warned_nicknames); /* now the list is empty. */
  2751. networkstatus_reset_warnings();
  2752. }
  2753. /** Return 1 if the signed descriptor of this router is older than
  2754. * <b>seconds</b> seconds. Otherwise return 0. */
  2755. MOCK_IMPL(int,
  2756. router_descriptor_is_older_than,(const routerinfo_t *router, int seconds))
  2757. {
  2758. return router->cache_info.published_on < approx_time() - seconds;
  2759. }
  2760. /** Add <b>router</b> to the routerlist, if we don't already have it. Replace
  2761. * older entries (if any) with the same key. Note: Callers should not hold
  2762. * their pointers to <b>router</b> if this function fails; <b>router</b>
  2763. * will either be inserted into the routerlist or freed. Similarly, even
  2764. * if this call succeeds, they should not hold their pointers to
  2765. * <b>router</b> after subsequent calls with other routerinfo's -- they
  2766. * might cause the original routerinfo to get freed.
  2767. *
  2768. * Returns the status for the operation. Might set *<b>msg</b> if it wants
  2769. * the poster of the router to know something.
  2770. *
  2771. * If <b>from_cache</b>, this descriptor came from our disk cache. If
  2772. * <b>from_fetch</b>, we received it in response to a request we made.
  2773. * (If both are false, that means it was uploaded to us as an auth dir
  2774. * server or via the controller.)
  2775. *
  2776. * This function should be called *after*
  2777. * routers_update_status_from_consensus_networkstatus; subsequently, you
  2778. * should call router_rebuild_store and routerlist_descriptors_added.
  2779. */
  2780. was_router_added_t
  2781. router_add_to_routerlist(routerinfo_t *router, const char **msg,
  2782. int from_cache, int from_fetch)
  2783. {
  2784. const char *id_digest;
  2785. const or_options_t *options = get_options();
  2786. int authdir = authdir_mode_handles_descs(options, router->purpose);
  2787. int authdir_believes_valid = 0;
  2788. routerinfo_t *old_router;
  2789. networkstatus_t *consensus =
  2790. networkstatus_get_latest_consensus_by_flavor(FLAV_NS);
  2791. int in_consensus = 0;
  2792. tor_assert(msg);
  2793. if (!routerlist)
  2794. router_get_routerlist();
  2795. id_digest = router->cache_info.identity_digest;
  2796. old_router = router_get_mutable_by_digest(id_digest);
  2797. /* Make sure that we haven't already got this exact descriptor. */
  2798. if (sdmap_get(routerlist->desc_digest_map,
  2799. router->cache_info.signed_descriptor_digest)) {
  2800. /* If we have this descriptor already and the new descriptor is a bridge
  2801. * descriptor, replace it. If we had a bridge descriptor before and the
  2802. * new one is not a bridge descriptor, don't replace it. */
  2803. /* Only members of routerlist->identity_map can be bridges; we don't
  2804. * put bridges in old_routers. */
  2805. const int was_bridge = old_router &&
  2806. old_router->purpose == ROUTER_PURPOSE_BRIDGE;
  2807. if (routerinfo_is_a_configured_bridge(router) &&
  2808. router->purpose == ROUTER_PURPOSE_BRIDGE &&
  2809. !was_bridge) {
  2810. log_info(LD_DIR, "Replacing non-bridge descriptor with bridge "
  2811. "descriptor for router %s",
  2812. router_describe(router));
  2813. } else {
  2814. log_info(LD_DIR,
  2815. "Dropping descriptor that we already have for router %s",
  2816. router_describe(router));
  2817. *msg = "Router descriptor was not new.";
  2818. routerinfo_free(router);
  2819. return ROUTER_IS_ALREADY_KNOWN;
  2820. }
  2821. }
  2822. if (authdir) {
  2823. if (authdir_wants_to_reject_router(router, msg,
  2824. !from_cache && !from_fetch,
  2825. &authdir_believes_valid)) {
  2826. tor_assert(*msg);
  2827. routerinfo_free(router);
  2828. return ROUTER_AUTHDIR_REJECTS;
  2829. }
  2830. } else if (from_fetch) {
  2831. /* Only check the descriptor digest against the network statuses when
  2832. * we are receiving in response to a fetch. */
  2833. if (!signed_desc_digest_is_recognized(&router->cache_info) &&
  2834. !routerinfo_is_a_configured_bridge(router)) {
  2835. /* We asked for it, so some networkstatus must have listed it when we
  2836. * did. Save it if we're a cache in case somebody else asks for it. */
  2837. log_info(LD_DIR,
  2838. "Received a no-longer-recognized descriptor for router %s",
  2839. router_describe(router));
  2840. *msg = "Router descriptor is not referenced by any network-status.";
  2841. /* Only journal this desc if we'll be serving it. */
  2842. if (!from_cache && should_cache_old_descriptors())
  2843. signed_desc_append_to_journal(&router->cache_info,
  2844. &routerlist->desc_store);
  2845. routerlist_insert_old(routerlist, router);
  2846. return ROUTER_NOT_IN_CONSENSUS_OR_NETWORKSTATUS;
  2847. }
  2848. }
  2849. /* We no longer need a router with this descriptor digest. */
  2850. if (consensus) {
  2851. routerstatus_t *rs = networkstatus_vote_find_mutable_entry(
  2852. consensus, id_digest);
  2853. if (rs && tor_memeq(rs->descriptor_digest,
  2854. router->cache_info.signed_descriptor_digest,
  2855. DIGEST_LEN)) {
  2856. in_consensus = 1;
  2857. }
  2858. }
  2859. if (router->purpose == ROUTER_PURPOSE_GENERAL &&
  2860. consensus && !in_consensus && !authdir) {
  2861. /* If it's a general router not listed in the consensus, then don't
  2862. * consider replacing the latest router with it. */
  2863. if (!from_cache && should_cache_old_descriptors())
  2864. signed_desc_append_to_journal(&router->cache_info,
  2865. &routerlist->desc_store);
  2866. routerlist_insert_old(routerlist, router);
  2867. *msg = "Skipping router descriptor: not in consensus.";
  2868. return ROUTER_NOT_IN_CONSENSUS;
  2869. }
  2870. /* If we're reading a bridge descriptor from our cache, and we don't
  2871. * recognize it as one of our currently configured bridges, drop the
  2872. * descriptor. Otherwise we could end up using it as one of our entry
  2873. * guards even if it isn't in our Bridge config lines. */
  2874. if (router->purpose == ROUTER_PURPOSE_BRIDGE && from_cache &&
  2875. !authdir_mode_bridge(options) &&
  2876. !routerinfo_is_a_configured_bridge(router)) {
  2877. log_info(LD_DIR, "Dropping bridge descriptor for %s because we have "
  2878. "no bridge configured at that address.",
  2879. safe_str_client(router_describe(router)));
  2880. *msg = "Router descriptor was not a configured bridge.";
  2881. routerinfo_free(router);
  2882. return ROUTER_WAS_NOT_WANTED;
  2883. }
  2884. /* If we have a router with the same identity key, choose the newer one. */
  2885. if (old_router) {
  2886. if (!in_consensus && (router->cache_info.published_on <=
  2887. old_router->cache_info.published_on)) {
  2888. /* Same key, but old. This one is not listed in the consensus. */
  2889. log_debug(LD_DIR, "Not-new descriptor for router %s",
  2890. router_describe(router));
  2891. /* Only journal this desc if we'll be serving it. */
  2892. if (!from_cache && should_cache_old_descriptors())
  2893. signed_desc_append_to_journal(&router->cache_info,
  2894. &routerlist->desc_store);
  2895. routerlist_insert_old(routerlist, router);
  2896. *msg = "Router descriptor was not new.";
  2897. return ROUTER_IS_ALREADY_KNOWN;
  2898. } else {
  2899. /* Same key, and either new, or listed in the consensus. */
  2900. log_debug(LD_DIR, "Replacing entry for router %s",
  2901. router_describe(router));
  2902. routerlist_replace(routerlist, old_router, router);
  2903. if (!from_cache) {
  2904. signed_desc_append_to_journal(&router->cache_info,
  2905. &routerlist->desc_store);
  2906. }
  2907. *msg = authdir_believes_valid ? "Valid server updated" :
  2908. ("Invalid server updated. (This dirserver is marking your "
  2909. "server as unapproved.)");
  2910. return ROUTER_ADDED_SUCCESSFULLY;
  2911. }
  2912. }
  2913. if (!in_consensus && from_cache &&
  2914. router_descriptor_is_older_than(router, OLD_ROUTER_DESC_MAX_AGE)) {
  2915. *msg = "Router descriptor was really old.";
  2916. routerinfo_free(router);
  2917. return ROUTER_WAS_TOO_OLD;
  2918. }
  2919. /* We haven't seen a router with this identity before. Add it to the end of
  2920. * the list. */
  2921. routerlist_insert(routerlist, router);
  2922. if (!from_cache) {
  2923. signed_desc_append_to_journal(&router->cache_info,
  2924. &routerlist->desc_store);
  2925. }
  2926. return ROUTER_ADDED_SUCCESSFULLY;
  2927. }
  2928. /** Insert <b>ei</b> into the routerlist, or free it. Other arguments are
  2929. * as for router_add_to_routerlist(). Return ROUTER_ADDED_SUCCESSFULLY iff
  2930. * we actually inserted it, ROUTER_BAD_EI otherwise.
  2931. */
  2932. was_router_added_t
  2933. router_add_extrainfo_to_routerlist(extrainfo_t *ei, const char **msg,
  2934. int from_cache, int from_fetch)
  2935. {
  2936. was_router_added_t inserted;
  2937. (void)from_fetch;
  2938. if (msg) *msg = NULL;
  2939. /*XXXX023 Do something with msg */
  2940. inserted = extrainfo_insert(router_get_routerlist(), ei);
  2941. if (WRA_WAS_ADDED(inserted) && !from_cache)
  2942. signed_desc_append_to_journal(&ei->cache_info,
  2943. &routerlist->extrainfo_store);
  2944. return inserted;
  2945. }
  2946. /** Sorting helper: return &lt;0, 0, or &gt;0 depending on whether the
  2947. * signed_descriptor_t* in *<b>a</b> has an identity digest preceding, equal
  2948. * to, or later than that of *<b>b</b>. */
  2949. static int
  2950. compare_old_routers_by_identity_(const void **_a, const void **_b)
  2951. {
  2952. int i;
  2953. const signed_descriptor_t *r1 = *_a, *r2 = *_b;
  2954. if ((i = fast_memcmp(r1->identity_digest, r2->identity_digest, DIGEST_LEN)))
  2955. return i;
  2956. return (int)(r1->published_on - r2->published_on);
  2957. }
  2958. /** Internal type used to represent how long an old descriptor was valid,
  2959. * where it appeared in the list of old descriptors, and whether it's extra
  2960. * old. Used only by routerlist_remove_old_cached_routers_with_id(). */
  2961. struct duration_idx_t {
  2962. int duration;
  2963. int idx;
  2964. int old;
  2965. };
  2966. /** Sorting helper: compare two duration_idx_t by their duration. */
  2967. static int
  2968. compare_duration_idx_(const void *_d1, const void *_d2)
  2969. {
  2970. const struct duration_idx_t *d1 = _d1;
  2971. const struct duration_idx_t *d2 = _d2;
  2972. return d1->duration - d2->duration;
  2973. }
  2974. /** The range <b>lo</b> through <b>hi</b> inclusive of routerlist->old_routers
  2975. * must contain routerinfo_t with the same identity and with publication time
  2976. * in ascending order. Remove members from this range until there are no more
  2977. * than max_descriptors_per_router() remaining. Start by removing the oldest
  2978. * members from before <b>cutoff</b>, then remove members which were current
  2979. * for the lowest amount of time. The order of members of old_routers at
  2980. * indices <b>lo</b> or higher may be changed.
  2981. */
  2982. static void
  2983. routerlist_remove_old_cached_routers_with_id(time_t now,
  2984. time_t cutoff, int lo, int hi,
  2985. digestset_t *retain)
  2986. {
  2987. int i, n = hi-lo+1;
  2988. unsigned n_extra, n_rmv = 0;
  2989. struct duration_idx_t *lifespans;
  2990. uint8_t *rmv, *must_keep;
  2991. smartlist_t *lst = routerlist->old_routers;
  2992. #if 1
  2993. const char *ident;
  2994. tor_assert(hi < smartlist_len(lst));
  2995. tor_assert(lo <= hi);
  2996. ident = ((signed_descriptor_t*)smartlist_get(lst, lo))->identity_digest;
  2997. for (i = lo+1; i <= hi; ++i) {
  2998. signed_descriptor_t *r = smartlist_get(lst, i);
  2999. tor_assert(tor_memeq(ident, r->identity_digest, DIGEST_LEN));
  3000. }
  3001. #endif
  3002. /* Check whether we need to do anything at all. */
  3003. {
  3004. int mdpr = directory_caches_dir_info(get_options()) ? 2 : 1;
  3005. if (n <= mdpr)
  3006. return;
  3007. n_extra = n - mdpr;
  3008. }
  3009. lifespans = tor_calloc(n, sizeof(struct duration_idx_t));
  3010. rmv = tor_calloc(n, sizeof(uint8_t));
  3011. must_keep = tor_calloc(n, sizeof(uint8_t));
  3012. /* Set lifespans to contain the lifespan and index of each server. */
  3013. /* Set rmv[i-lo]=1 if we're going to remove a server for being too old. */
  3014. for (i = lo; i <= hi; ++i) {
  3015. signed_descriptor_t *r = smartlist_get(lst, i);
  3016. signed_descriptor_t *r_next;
  3017. lifespans[i-lo].idx = i;
  3018. if (r->last_listed_as_valid_until >= now ||
  3019. (retain && digestset_contains(retain, r->signed_descriptor_digest))) {
  3020. must_keep[i-lo] = 1;
  3021. }
  3022. if (i < hi) {
  3023. r_next = smartlist_get(lst, i+1);
  3024. tor_assert(r->published_on <= r_next->published_on);
  3025. lifespans[i-lo].duration = (int)(r_next->published_on - r->published_on);
  3026. } else {
  3027. r_next = NULL;
  3028. lifespans[i-lo].duration = INT_MAX;
  3029. }
  3030. if (!must_keep[i-lo] && r->published_on < cutoff && n_rmv < n_extra) {
  3031. ++n_rmv;
  3032. lifespans[i-lo].old = 1;
  3033. rmv[i-lo] = 1;
  3034. }
  3035. }
  3036. if (n_rmv < n_extra) {
  3037. /**
  3038. * We aren't removing enough servers for being old. Sort lifespans by
  3039. * the duration of liveness, and remove the ones we're not already going to
  3040. * remove based on how long they were alive.
  3041. **/
  3042. qsort(lifespans, n, sizeof(struct duration_idx_t), compare_duration_idx_);
  3043. for (i = 0; i < n && n_rmv < n_extra; ++i) {
  3044. if (!must_keep[lifespans[i].idx-lo] && !lifespans[i].old) {
  3045. rmv[lifespans[i].idx-lo] = 1;
  3046. ++n_rmv;
  3047. }
  3048. }
  3049. }
  3050. i = hi;
  3051. do {
  3052. if (rmv[i-lo])
  3053. routerlist_remove_old(routerlist, smartlist_get(lst, i), i);
  3054. } while (--i >= lo);
  3055. tor_free(must_keep);
  3056. tor_free(rmv);
  3057. tor_free(lifespans);
  3058. }
  3059. /** Deactivate any routers from the routerlist that are more than
  3060. * ROUTER_MAX_AGE seconds old and not recommended by any networkstatuses;
  3061. * remove old routers from the list of cached routers if we have too many.
  3062. */
  3063. void
  3064. routerlist_remove_old_routers(void)
  3065. {
  3066. int i, hi=-1;
  3067. const char *cur_id = NULL;
  3068. time_t now = time(NULL);
  3069. time_t cutoff;
  3070. routerinfo_t *router;
  3071. signed_descriptor_t *sd;
  3072. digestset_t *retain;
  3073. const networkstatus_t *consensus = networkstatus_get_latest_consensus();
  3074. trusted_dirs_remove_old_certs();
  3075. if (!routerlist || !consensus)
  3076. return;
  3077. // routerlist_assert_ok(routerlist);
  3078. /* We need to guess how many router descriptors we will wind up wanting to
  3079. retain, so that we can be sure to allocate a large enough Bloom filter
  3080. to hold the digest set. Overestimating is fine; underestimating is bad.
  3081. */
  3082. {
  3083. /* We'll probably retain everything in the consensus. */
  3084. int n_max_retain = smartlist_len(consensus->routerstatus_list);
  3085. retain = digestset_new(n_max_retain);
  3086. }
  3087. cutoff = now - OLD_ROUTER_DESC_MAX_AGE;
  3088. /* Retain anything listed in the consensus. */
  3089. if (consensus) {
  3090. SMARTLIST_FOREACH(consensus->routerstatus_list, routerstatus_t *, rs,
  3091. if (rs->published_on >= cutoff)
  3092. digestset_add(retain, rs->descriptor_digest));
  3093. }
  3094. /* If we have a consensus, we should consider pruning current routers that
  3095. * are too old and that nobody recommends. (If we don't have a consensus,
  3096. * then we should get one before we decide to kill routers.) */
  3097. if (consensus) {
  3098. cutoff = now - ROUTER_MAX_AGE;
  3099. /* Remove too-old unrecommended members of routerlist->routers. */
  3100. for (i = 0; i < smartlist_len(routerlist->routers); ++i) {
  3101. router = smartlist_get(routerlist->routers, i);
  3102. if (router->cache_info.published_on <= cutoff &&
  3103. router->cache_info.last_listed_as_valid_until < now &&
  3104. !digestset_contains(retain,
  3105. router->cache_info.signed_descriptor_digest)) {
  3106. /* Too old: remove it. (If we're a cache, just move it into
  3107. * old_routers.) */
  3108. log_info(LD_DIR,
  3109. "Forgetting obsolete (too old) routerinfo for router %s",
  3110. router_describe(router));
  3111. routerlist_remove(routerlist, router, 1, now);
  3112. i--;
  3113. }
  3114. }
  3115. }
  3116. //routerlist_assert_ok(routerlist);
  3117. /* Remove far-too-old members of routerlist->old_routers. */
  3118. cutoff = now - OLD_ROUTER_DESC_MAX_AGE;
  3119. for (i = 0; i < smartlist_len(routerlist->old_routers); ++i) {
  3120. sd = smartlist_get(routerlist->old_routers, i);
  3121. if (sd->published_on <= cutoff &&
  3122. sd->last_listed_as_valid_until < now &&
  3123. !digestset_contains(retain, sd->signed_descriptor_digest)) {
  3124. /* Too old. Remove it. */
  3125. routerlist_remove_old(routerlist, sd, i--);
  3126. }
  3127. }
  3128. //routerlist_assert_ok(routerlist);
  3129. log_info(LD_DIR, "We have %d live routers and %d old router descriptors.",
  3130. smartlist_len(routerlist->routers),
  3131. smartlist_len(routerlist->old_routers));
  3132. /* Now we might have to look at routerlist->old_routers for extraneous
  3133. * members. (We'd keep all the members if we could, but we need to save
  3134. * space.) First, check whether we have too many router descriptors, total.
  3135. * We're okay with having too many for some given router, so long as the
  3136. * total number doesn't approach max_descriptors_per_router()*len(router).
  3137. */
  3138. if (smartlist_len(routerlist->old_routers) <
  3139. smartlist_len(routerlist->routers))
  3140. goto done;
  3141. /* Sort by identity, then fix indices. */
  3142. smartlist_sort(routerlist->old_routers, compare_old_routers_by_identity_);
  3143. /* Fix indices. */
  3144. for (i = 0; i < smartlist_len(routerlist->old_routers); ++i) {
  3145. signed_descriptor_t *r = smartlist_get(routerlist->old_routers, i);
  3146. r->routerlist_index = i;
  3147. }
  3148. /* Iterate through the list from back to front, so when we remove descriptors
  3149. * we don't mess up groups we haven't gotten to. */
  3150. for (i = smartlist_len(routerlist->old_routers)-1; i >= 0; --i) {
  3151. signed_descriptor_t *r = smartlist_get(routerlist->old_routers, i);
  3152. if (!cur_id) {
  3153. cur_id = r->identity_digest;
  3154. hi = i;
  3155. }
  3156. if (tor_memneq(cur_id, r->identity_digest, DIGEST_LEN)) {
  3157. routerlist_remove_old_cached_routers_with_id(now,
  3158. cutoff, i+1, hi, retain);
  3159. cur_id = r->identity_digest;
  3160. hi = i;
  3161. }
  3162. }
  3163. if (hi>=0)
  3164. routerlist_remove_old_cached_routers_with_id(now, cutoff, 0, hi, retain);
  3165. //routerlist_assert_ok(routerlist);
  3166. done:
  3167. digestset_free(retain);
  3168. router_rebuild_store(RRS_DONT_REMOVE_OLD, &routerlist->desc_store);
  3169. router_rebuild_store(RRS_DONT_REMOVE_OLD,&routerlist->extrainfo_store);
  3170. }
  3171. /** We just added a new set of descriptors. Take whatever extra steps
  3172. * we need. */
  3173. void
  3174. routerlist_descriptors_added(smartlist_t *sl, int from_cache)
  3175. {
  3176. tor_assert(sl);
  3177. control_event_descriptors_changed(sl);
  3178. SMARTLIST_FOREACH_BEGIN(sl, routerinfo_t *, ri) {
  3179. if (ri->purpose == ROUTER_PURPOSE_BRIDGE)
  3180. learned_bridge_descriptor(ri, from_cache);
  3181. if (ri->needs_retest_if_added) {
  3182. ri->needs_retest_if_added = 0;
  3183. dirserv_single_reachability_test(approx_time(), ri);
  3184. }
  3185. } SMARTLIST_FOREACH_END(ri);
  3186. }
  3187. /**
  3188. * Code to parse a single router descriptor and insert it into the
  3189. * routerlist. Return -1 if the descriptor was ill-formed; 0 if the
  3190. * descriptor was well-formed but could not be added; and 1 if the
  3191. * descriptor was added.
  3192. *
  3193. * If we don't add it and <b>msg</b> is not NULL, then assign to
  3194. * *<b>msg</b> a static string describing the reason for refusing the
  3195. * descriptor.
  3196. *
  3197. * This is used only by the controller.
  3198. */
  3199. int
  3200. router_load_single_router(const char *s, uint8_t purpose, int cache,
  3201. const char **msg)
  3202. {
  3203. routerinfo_t *ri;
  3204. was_router_added_t r;
  3205. smartlist_t *lst;
  3206. char annotation_buf[ROUTER_ANNOTATION_BUF_LEN];
  3207. tor_assert(msg);
  3208. *msg = NULL;
  3209. tor_snprintf(annotation_buf, sizeof(annotation_buf),
  3210. "@source controller\n"
  3211. "@purpose %s\n", router_purpose_to_string(purpose));
  3212. if (!(ri = router_parse_entry_from_string(s, NULL, 1, 0,
  3213. annotation_buf, NULL))) {
  3214. log_warn(LD_DIR, "Error parsing router descriptor; dropping.");
  3215. *msg = "Couldn't parse router descriptor.";
  3216. return -1;
  3217. }
  3218. tor_assert(ri->purpose == purpose);
  3219. if (router_is_me(ri)) {
  3220. log_warn(LD_DIR, "Router's identity key matches mine; dropping.");
  3221. *msg = "Router's identity key matches mine.";
  3222. routerinfo_free(ri);
  3223. return 0;
  3224. }
  3225. if (!cache) /* obey the preference of the controller */
  3226. ri->cache_info.do_not_cache = 1;
  3227. lst = smartlist_new();
  3228. smartlist_add(lst, ri);
  3229. routers_update_status_from_consensus_networkstatus(lst, 0);
  3230. r = router_add_to_routerlist(ri, msg, 0, 0);
  3231. if (!WRA_WAS_ADDED(r)) {
  3232. /* we've already assigned to *msg now, and ri is already freed */
  3233. tor_assert(*msg);
  3234. if (r == ROUTER_AUTHDIR_REJECTS)
  3235. log_warn(LD_DIR, "Couldn't add router to list: %s Dropping.", *msg);
  3236. smartlist_free(lst);
  3237. return 0;
  3238. } else {
  3239. routerlist_descriptors_added(lst, 0);
  3240. smartlist_free(lst);
  3241. log_debug(LD_DIR, "Added router to list");
  3242. return 1;
  3243. }
  3244. }
  3245. /** Given a string <b>s</b> containing some routerdescs, parse it and put the
  3246. * routers into our directory. If saved_location is SAVED_NOWHERE, the routers
  3247. * are in response to a query to the network: cache them by adding them to
  3248. * the journal.
  3249. *
  3250. * Return the number of routers actually added.
  3251. *
  3252. * If <b>requested_fingerprints</b> is provided, it must contain a list of
  3253. * uppercased fingerprints. Do not update any router whose
  3254. * fingerprint is not on the list; after updating a router, remove its
  3255. * fingerprint from the list.
  3256. *
  3257. * If <b>descriptor_digests</b> is non-zero, then the requested_fingerprints
  3258. * are descriptor digests. Otherwise they are identity digests.
  3259. */
  3260. int
  3261. router_load_routers_from_string(const char *s, const char *eos,
  3262. saved_location_t saved_location,
  3263. smartlist_t *requested_fingerprints,
  3264. int descriptor_digests,
  3265. const char *prepend_annotations)
  3266. {
  3267. smartlist_t *routers = smartlist_new(), *changed = smartlist_new();
  3268. char fp[HEX_DIGEST_LEN+1];
  3269. const char *msg;
  3270. int from_cache = (saved_location != SAVED_NOWHERE);
  3271. int allow_annotations = (saved_location != SAVED_NOWHERE);
  3272. int any_changed = 0;
  3273. smartlist_t *invalid_digests = smartlist_new();
  3274. router_parse_list_from_string(&s, eos, routers, saved_location, 0,
  3275. allow_annotations, prepend_annotations,
  3276. invalid_digests);
  3277. routers_update_status_from_consensus_networkstatus(routers, !from_cache);
  3278. log_info(LD_DIR, "%d elements to add", smartlist_len(routers));
  3279. SMARTLIST_FOREACH_BEGIN(routers, routerinfo_t *, ri) {
  3280. was_router_added_t r;
  3281. char d[DIGEST_LEN];
  3282. if (requested_fingerprints) {
  3283. base16_encode(fp, sizeof(fp), descriptor_digests ?
  3284. ri->cache_info.signed_descriptor_digest :
  3285. ri->cache_info.identity_digest,
  3286. DIGEST_LEN);
  3287. if (smartlist_contains_string(requested_fingerprints, fp)) {
  3288. smartlist_string_remove(requested_fingerprints, fp);
  3289. } else {
  3290. char *requested =
  3291. smartlist_join_strings(requested_fingerprints," ",0,NULL);
  3292. log_warn(LD_DIR,
  3293. "We received a router descriptor with a fingerprint (%s) "
  3294. "that we never requested. (We asked for: %s.) Dropping.",
  3295. fp, requested);
  3296. tor_free(requested);
  3297. routerinfo_free(ri);
  3298. continue;
  3299. }
  3300. }
  3301. memcpy(d, ri->cache_info.signed_descriptor_digest, DIGEST_LEN);
  3302. r = router_add_to_routerlist(ri, &msg, from_cache, !from_cache);
  3303. if (WRA_WAS_ADDED(r)) {
  3304. any_changed++;
  3305. smartlist_add(changed, ri);
  3306. routerlist_descriptors_added(changed, from_cache);
  3307. smartlist_clear(changed);
  3308. } else if (WRA_NEVER_DOWNLOADABLE(r)) {
  3309. download_status_t *dl_status;
  3310. dl_status = router_get_dl_status_by_descriptor_digest(d);
  3311. if (dl_status) {
  3312. log_info(LD_GENERAL, "Marking router %s as never downloadable",
  3313. hex_str(d, DIGEST_LEN));
  3314. download_status_mark_impossible(dl_status);
  3315. }
  3316. }
  3317. } SMARTLIST_FOREACH_END(ri);
  3318. SMARTLIST_FOREACH_BEGIN(invalid_digests, const uint8_t *, bad_digest) {
  3319. /* This digest is never going to be parseable. */
  3320. base16_encode(fp, sizeof(fp), (char*)bad_digest, DIGEST_LEN);
  3321. if (requested_fingerprints && descriptor_digests) {
  3322. if (! smartlist_contains_string(requested_fingerprints, fp)) {
  3323. /* But we didn't ask for it, so we should assume shennanegans. */
  3324. continue;
  3325. }
  3326. smartlist_string_remove(requested_fingerprints, fp);
  3327. }
  3328. download_status_t *dls;
  3329. dls = router_get_dl_status_by_descriptor_digest((char*)bad_digest);
  3330. if (dls) {
  3331. log_info(LD_GENERAL, "Marking router with descriptor %s as unparseable, "
  3332. "and therefore undownloadable", fp);
  3333. download_status_mark_impossible(dls);
  3334. }
  3335. } SMARTLIST_FOREACH_END(bad_digest);
  3336. SMARTLIST_FOREACH(invalid_digests, uint8_t *, d, tor_free(d));
  3337. smartlist_free(invalid_digests);
  3338. routerlist_assert_ok(routerlist);
  3339. if (any_changed)
  3340. router_rebuild_store(0, &routerlist->desc_store);
  3341. smartlist_free(routers);
  3342. smartlist_free(changed);
  3343. return any_changed;
  3344. }
  3345. /** Parse one or more extrainfos from <b>s</b> (ending immediately before
  3346. * <b>eos</b> if <b>eos</b> is present). Other arguments are as for
  3347. * router_load_routers_from_string(). */
  3348. void
  3349. router_load_extrainfo_from_string(const char *s, const char *eos,
  3350. saved_location_t saved_location,
  3351. smartlist_t *requested_fingerprints,
  3352. int descriptor_digests)
  3353. {
  3354. smartlist_t *extrainfo_list = smartlist_new();
  3355. const char *msg;
  3356. int from_cache = (saved_location != SAVED_NOWHERE);
  3357. smartlist_t *invalid_digests = smartlist_new();
  3358. router_parse_list_from_string(&s, eos, extrainfo_list, saved_location, 1, 0,
  3359. NULL, invalid_digests);
  3360. log_info(LD_DIR, "%d elements to add", smartlist_len(extrainfo_list));
  3361. SMARTLIST_FOREACH_BEGIN(extrainfo_list, extrainfo_t *, ei) {
  3362. uint8_t d[DIGEST_LEN];
  3363. memcpy(d, ei->cache_info.signed_descriptor_digest, DIGEST_LEN);
  3364. was_router_added_t added =
  3365. router_add_extrainfo_to_routerlist(ei, &msg, from_cache, !from_cache);
  3366. if (WRA_WAS_ADDED(added) && requested_fingerprints) {
  3367. char fp[HEX_DIGEST_LEN+1];
  3368. base16_encode(fp, sizeof(fp), descriptor_digests ?
  3369. ei->cache_info.signed_descriptor_digest :
  3370. ei->cache_info.identity_digest,
  3371. DIGEST_LEN);
  3372. smartlist_string_remove(requested_fingerprints, fp);
  3373. /* We silently let people stuff us with extrainfos we didn't ask for,
  3374. * so long as we would have wanted them anyway. Since we always fetch
  3375. * all the extrainfos we want, and we never actually act on them
  3376. * inside Tor, this should be harmless. */
  3377. } else if (WRA_NEVER_DOWNLOADABLE(added)) {
  3378. signed_descriptor_t *sd = router_get_by_extrainfo_digest((char*)d);
  3379. if (sd) {
  3380. log_info(LD_GENERAL, "Marking extrainfo with descriptor %s as "
  3381. "unparseable, and therefore undownloadable",
  3382. hex_str((char*)d,DIGEST_LEN));
  3383. download_status_mark_impossible(&sd->ei_dl_status);
  3384. }
  3385. }
  3386. } SMARTLIST_FOREACH_END(ei);
  3387. SMARTLIST_FOREACH_BEGIN(invalid_digests, const uint8_t *, bad_digest) {
  3388. /* This digest is never going to be parseable. */
  3389. char fp[HEX_DIGEST_LEN+1];
  3390. base16_encode(fp, sizeof(fp), (char*)bad_digest, DIGEST_LEN);
  3391. if (requested_fingerprints) {
  3392. if (! smartlist_contains_string(requested_fingerprints, fp)) {
  3393. /* But we didn't ask for it, so we should assume shennanegans. */
  3394. continue;
  3395. }
  3396. smartlist_string_remove(requested_fingerprints, fp);
  3397. }
  3398. signed_descriptor_t *sd =
  3399. router_get_by_extrainfo_digest((char*)bad_digest);
  3400. if (sd) {
  3401. log_info(LD_GENERAL, "Marking extrainfo with descriptor %s as "
  3402. "unparseable, and therefore undownloadable", fp);
  3403. download_status_mark_impossible(&sd->ei_dl_status);
  3404. }
  3405. } SMARTLIST_FOREACH_END(bad_digest);
  3406. SMARTLIST_FOREACH(invalid_digests, uint8_t *, d, tor_free(d));
  3407. smartlist_free(invalid_digests);
  3408. routerlist_assert_ok(routerlist);
  3409. router_rebuild_store(0, &router_get_routerlist()->extrainfo_store);
  3410. smartlist_free(extrainfo_list);
  3411. }
  3412. /** Return true iff any networkstatus includes a descriptor whose digest
  3413. * is that of <b>desc</b>. */
  3414. static int
  3415. signed_desc_digest_is_recognized(signed_descriptor_t *desc)
  3416. {
  3417. const routerstatus_t *rs;
  3418. networkstatus_t *consensus = networkstatus_get_latest_consensus();
  3419. if (consensus) {
  3420. rs = networkstatus_vote_find_entry(consensus, desc->identity_digest);
  3421. if (rs && tor_memeq(rs->descriptor_digest,
  3422. desc->signed_descriptor_digest, DIGEST_LEN))
  3423. return 1;
  3424. }
  3425. return 0;
  3426. }
  3427. /** Update downloads for router descriptors and/or microdescriptors as
  3428. * appropriate. */
  3429. void
  3430. update_all_descriptor_downloads(time_t now)
  3431. {
  3432. if (get_options()->DisableNetwork)
  3433. return;
  3434. update_router_descriptor_downloads(now);
  3435. update_microdesc_downloads(now);
  3436. launch_dummy_descriptor_download_as_needed(now, get_options());
  3437. }
  3438. /** Clear all our timeouts for fetching v3 directory stuff, and then
  3439. * give it all a try again. */
  3440. void
  3441. routerlist_retry_directory_downloads(time_t now)
  3442. {
  3443. router_reset_status_download_failures();
  3444. router_reset_descriptor_download_failures();
  3445. if (get_options()->DisableNetwork)
  3446. return;
  3447. update_networkstatus_downloads(now);
  3448. update_all_descriptor_downloads(now);
  3449. }
  3450. /** Return true iff <b>router</b> does not permit exit streams.
  3451. */
  3452. int
  3453. router_exit_policy_rejects_all(const routerinfo_t *router)
  3454. {
  3455. return router->policy_is_reject_star;
  3456. }
  3457. /** Create an directory server at <b>address</b>:<b>port</b>, with OR identity
  3458. * key <b>digest</b>. If <b>address</b> is NULL, add ourself. If
  3459. * <b>is_authority</b>, this is a directory authority. Return the new
  3460. * directory server entry on success or NULL on failure. */
  3461. static dir_server_t *
  3462. dir_server_new(int is_authority,
  3463. const char *nickname,
  3464. const tor_addr_t *addr,
  3465. const char *hostname,
  3466. uint16_t dir_port, uint16_t or_port,
  3467. const char *digest, const char *v3_auth_digest,
  3468. dirinfo_type_t type,
  3469. double weight)
  3470. {
  3471. dir_server_t *ent;
  3472. uint32_t a;
  3473. char *hostname_ = NULL;
  3474. if (weight < 0)
  3475. return NULL;
  3476. if (tor_addr_family(addr) == AF_INET)
  3477. a = tor_addr_to_ipv4h(addr);
  3478. else
  3479. return NULL; /*XXXX Support IPv6 */
  3480. if (!hostname)
  3481. hostname_ = tor_dup_addr(addr);
  3482. else
  3483. hostname_ = tor_strdup(hostname);
  3484. ent = tor_malloc_zero(sizeof(dir_server_t));
  3485. ent->nickname = nickname ? tor_strdup(nickname) : NULL;
  3486. ent->address = hostname_;
  3487. ent->addr = a;
  3488. ent->dir_port = dir_port;
  3489. ent->or_port = or_port;
  3490. ent->is_running = 1;
  3491. ent->is_authority = is_authority;
  3492. ent->type = type;
  3493. ent->weight = weight;
  3494. memcpy(ent->digest, digest, DIGEST_LEN);
  3495. if (v3_auth_digest && (type & V3_DIRINFO))
  3496. memcpy(ent->v3_identity_digest, v3_auth_digest, DIGEST_LEN);
  3497. if (nickname)
  3498. tor_asprintf(&ent->description, "directory server \"%s\" at %s:%d",
  3499. nickname, hostname, (int)dir_port);
  3500. else
  3501. tor_asprintf(&ent->description, "directory server at %s:%d",
  3502. hostname, (int)dir_port);
  3503. ent->fake_status.addr = ent->addr;
  3504. memcpy(ent->fake_status.identity_digest, digest, DIGEST_LEN);
  3505. if (nickname)
  3506. strlcpy(ent->fake_status.nickname, nickname,
  3507. sizeof(ent->fake_status.nickname));
  3508. else
  3509. ent->fake_status.nickname[0] = '\0';
  3510. ent->fake_status.dir_port = ent->dir_port;
  3511. ent->fake_status.or_port = ent->or_port;
  3512. return ent;
  3513. }
  3514. /** Create an authoritative directory server at
  3515. * <b>address</b>:<b>port</b>, with identity key <b>digest</b>. If
  3516. * <b>address</b> is NULL, add ourself. Return the new trusted directory
  3517. * server entry on success or NULL if we couldn't add it. */
  3518. dir_server_t *
  3519. trusted_dir_server_new(const char *nickname, const char *address,
  3520. uint16_t dir_port, uint16_t or_port,
  3521. const char *digest, const char *v3_auth_digest,
  3522. dirinfo_type_t type, double weight)
  3523. {
  3524. uint32_t a;
  3525. tor_addr_t addr;
  3526. char *hostname=NULL;
  3527. dir_server_t *result;
  3528. if (!address) { /* The address is us; we should guess. */
  3529. if (resolve_my_address(LOG_WARN, get_options(),
  3530. &a, NULL, &hostname) < 0) {
  3531. log_warn(LD_CONFIG,
  3532. "Couldn't find a suitable address when adding ourself as a "
  3533. "trusted directory server.");
  3534. return NULL;
  3535. }
  3536. if (!hostname)
  3537. hostname = tor_dup_ip(a);
  3538. } else {
  3539. if (tor_lookup_hostname(address, &a)) {
  3540. log_warn(LD_CONFIG,
  3541. "Unable to lookup address for directory server at '%s'",
  3542. address);
  3543. return NULL;
  3544. }
  3545. hostname = tor_strdup(address);
  3546. }
  3547. tor_addr_from_ipv4h(&addr, a);
  3548. result = dir_server_new(1, nickname, &addr, hostname,
  3549. dir_port, or_port, digest,
  3550. v3_auth_digest, type, weight);
  3551. tor_free(hostname);
  3552. return result;
  3553. }
  3554. /** Return a new dir_server_t for a fallback directory server at
  3555. * <b>addr</b>:<b>or_port</b>/<b>dir_port</b>, with identity key digest
  3556. * <b>id_digest</b> */
  3557. dir_server_t *
  3558. fallback_dir_server_new(const tor_addr_t *addr,
  3559. uint16_t dir_port, uint16_t or_port,
  3560. const char *id_digest, double weight)
  3561. {
  3562. return dir_server_new(0, NULL, addr, NULL, dir_port, or_port, id_digest,
  3563. NULL, ALL_DIRINFO, weight);
  3564. }
  3565. /** Add a directory server to the global list(s). */
  3566. void
  3567. dir_server_add(dir_server_t *ent)
  3568. {
  3569. if (!trusted_dir_servers)
  3570. trusted_dir_servers = smartlist_new();
  3571. if (!fallback_dir_servers)
  3572. fallback_dir_servers = smartlist_new();
  3573. if (ent->is_authority)
  3574. smartlist_add(trusted_dir_servers, ent);
  3575. smartlist_add(fallback_dir_servers, ent);
  3576. router_dir_info_changed();
  3577. }
  3578. /** Free storage held in <b>cert</b>. */
  3579. void
  3580. authority_cert_free(authority_cert_t *cert)
  3581. {
  3582. if (!cert)
  3583. return;
  3584. tor_free(cert->cache_info.signed_descriptor_body);
  3585. crypto_pk_free(cert->signing_key);
  3586. crypto_pk_free(cert->identity_key);
  3587. tor_free(cert);
  3588. }
  3589. /** Free storage held in <b>ds</b>. */
  3590. static void
  3591. dir_server_free(dir_server_t *ds)
  3592. {
  3593. if (!ds)
  3594. return;
  3595. tor_free(ds->nickname);
  3596. tor_free(ds->description);
  3597. tor_free(ds->address);
  3598. tor_free(ds);
  3599. }
  3600. /** Remove all members from the list of dir servers. */
  3601. void
  3602. clear_dir_servers(void)
  3603. {
  3604. if (fallback_dir_servers) {
  3605. SMARTLIST_FOREACH(fallback_dir_servers, dir_server_t *, ent,
  3606. dir_server_free(ent));
  3607. smartlist_clear(fallback_dir_servers);
  3608. } else {
  3609. fallback_dir_servers = smartlist_new();
  3610. }
  3611. if (trusted_dir_servers) {
  3612. smartlist_clear(trusted_dir_servers);
  3613. } else {
  3614. trusted_dir_servers = smartlist_new();
  3615. }
  3616. router_dir_info_changed();
  3617. }
  3618. /** For every current directory connection whose purpose is <b>purpose</b>,
  3619. * and where the resource being downloaded begins with <b>prefix</b>, split
  3620. * rest of the resource into base16 fingerprints (or base64 fingerprints if
  3621. * purpose==DIR_PURPPOSE_FETCH_MICRODESC), decode them, and set the
  3622. * corresponding elements of <b>result</b> to a nonzero value.
  3623. */
  3624. static void
  3625. list_pending_downloads(digestmap_t *result, digest256map_t *result256,
  3626. int purpose, const char *prefix)
  3627. {
  3628. const size_t p_len = strlen(prefix);
  3629. smartlist_t *tmp = smartlist_new();
  3630. smartlist_t *conns = get_connection_array();
  3631. int flags = DSR_HEX;
  3632. if (purpose == DIR_PURPOSE_FETCH_MICRODESC)
  3633. flags = DSR_DIGEST256|DSR_BASE64;
  3634. tor_assert(result || result256);
  3635. SMARTLIST_FOREACH_BEGIN(conns, connection_t *, conn) {
  3636. if (conn->type == CONN_TYPE_DIR &&
  3637. conn->purpose == purpose &&
  3638. !conn->marked_for_close) {
  3639. const char *resource = TO_DIR_CONN(conn)->requested_resource;
  3640. if (!strcmpstart(resource, prefix))
  3641. dir_split_resource_into_fingerprints(resource + p_len,
  3642. tmp, NULL, flags);
  3643. }
  3644. } SMARTLIST_FOREACH_END(conn);
  3645. if (result) {
  3646. SMARTLIST_FOREACH(tmp, char *, d,
  3647. {
  3648. digestmap_set(result, d, (void*)1);
  3649. tor_free(d);
  3650. });
  3651. } else if (result256) {
  3652. SMARTLIST_FOREACH(tmp, uint8_t *, d,
  3653. {
  3654. digest256map_set(result256, d, (void*)1);
  3655. tor_free(d);
  3656. });
  3657. }
  3658. smartlist_free(tmp);
  3659. }
  3660. /** For every router descriptor (or extra-info document if <b>extrainfo</b> is
  3661. * true) we are currently downloading by descriptor digest, set result[d] to
  3662. * (void*)1. */
  3663. static void
  3664. list_pending_descriptor_downloads(digestmap_t *result, int extrainfo)
  3665. {
  3666. int purpose =
  3667. extrainfo ? DIR_PURPOSE_FETCH_EXTRAINFO : DIR_PURPOSE_FETCH_SERVERDESC;
  3668. list_pending_downloads(result, NULL, purpose, "d/");
  3669. }
  3670. /** For every microdescriptor we are currently downloading by descriptor
  3671. * digest, set result[d] to (void*)1.
  3672. */
  3673. void
  3674. list_pending_microdesc_downloads(digest256map_t *result)
  3675. {
  3676. list_pending_downloads(NULL, result, DIR_PURPOSE_FETCH_MICRODESC, "d/");
  3677. }
  3678. /** For every certificate we are currently downloading by (identity digest,
  3679. * signing key digest) pair, set result[fp_pair] to (void *1).
  3680. */
  3681. static void
  3682. list_pending_fpsk_downloads(fp_pair_map_t *result)
  3683. {
  3684. const char *pfx = "fp-sk/";
  3685. smartlist_t *tmp;
  3686. smartlist_t *conns;
  3687. const char *resource;
  3688. tor_assert(result);
  3689. tmp = smartlist_new();
  3690. conns = get_connection_array();
  3691. SMARTLIST_FOREACH_BEGIN(conns, connection_t *, conn) {
  3692. if (conn->type == CONN_TYPE_DIR &&
  3693. conn->purpose == DIR_PURPOSE_FETCH_CERTIFICATE &&
  3694. !conn->marked_for_close) {
  3695. resource = TO_DIR_CONN(conn)->requested_resource;
  3696. if (!strcmpstart(resource, pfx))
  3697. dir_split_resource_into_fingerprint_pairs(resource + strlen(pfx),
  3698. tmp);
  3699. }
  3700. } SMARTLIST_FOREACH_END(conn);
  3701. SMARTLIST_FOREACH_BEGIN(tmp, fp_pair_t *, fp) {
  3702. fp_pair_map_set(result, fp, (void*)1);
  3703. tor_free(fp);
  3704. } SMARTLIST_FOREACH_END(fp);
  3705. smartlist_free(tmp);
  3706. }
  3707. /** Launch downloads for all the descriptors whose digests or digests256
  3708. * are listed as digests[i] for lo <= i < hi. (Lo and hi may be out of
  3709. * range.) If <b>source</b> is given, download from <b>source</b>;
  3710. * otherwise, download from an appropriate random directory server.
  3711. */
  3712. static void
  3713. initiate_descriptor_downloads(const routerstatus_t *source,
  3714. int purpose,
  3715. smartlist_t *digests,
  3716. int lo, int hi, int pds_flags)
  3717. {
  3718. int i, n = hi-lo;
  3719. char *resource, *cp;
  3720. size_t r_len;
  3721. int digest_len = DIGEST_LEN, enc_digest_len = HEX_DIGEST_LEN;
  3722. char sep = '+';
  3723. int b64_256 = 0;
  3724. if (purpose == DIR_PURPOSE_FETCH_MICRODESC) {
  3725. /* Microdescriptors are downloaded by "-"-separated base64-encoded
  3726. * 256-bit digests. */
  3727. digest_len = DIGEST256_LEN;
  3728. enc_digest_len = BASE64_DIGEST256_LEN;
  3729. sep = '-';
  3730. b64_256 = 1;
  3731. }
  3732. if (n <= 0)
  3733. return;
  3734. if (lo < 0)
  3735. lo = 0;
  3736. if (hi > smartlist_len(digests))
  3737. hi = smartlist_len(digests);
  3738. r_len = 8 + (enc_digest_len+1)*n;
  3739. cp = resource = tor_malloc(r_len);
  3740. memcpy(cp, "d/", 2);
  3741. cp += 2;
  3742. for (i = lo; i < hi; ++i) {
  3743. if (b64_256) {
  3744. digest256_to_base64(cp, smartlist_get(digests, i));
  3745. } else {
  3746. base16_encode(cp, r_len-(cp-resource),
  3747. smartlist_get(digests,i), digest_len);
  3748. }
  3749. cp += enc_digest_len;
  3750. *cp++ = sep;
  3751. }
  3752. memcpy(cp-1, ".z", 3);
  3753. if (source) {
  3754. /* We know which authority we want. */
  3755. directory_initiate_command_routerstatus(source, purpose,
  3756. ROUTER_PURPOSE_GENERAL,
  3757. DIRIND_ONEHOP,
  3758. resource, NULL, 0, 0);
  3759. } else {
  3760. directory_get_from_dirserver(purpose, ROUTER_PURPOSE_GENERAL, resource,
  3761. pds_flags);
  3762. }
  3763. tor_free(resource);
  3764. }
  3765. /** Max amount of hashes to download per request.
  3766. * Since squid does not like URLs >= 4096 bytes we limit it to 96.
  3767. * 4096 - strlen(http://255.255.255.255/tor/server/d/.z) == 4058
  3768. * 4058/41 (40 for the hash and 1 for the + that separates them) => 98
  3769. * So use 96 because it's a nice number.
  3770. */
  3771. #define MAX_DL_PER_REQUEST 96
  3772. #define MAX_MICRODESC_DL_PER_REQUEST 92
  3773. /** Don't split our requests so finely that we are requesting fewer than
  3774. * this number per server. */
  3775. #define MIN_DL_PER_REQUEST 4
  3776. /** To prevent a single screwy cache from confusing us by selective reply,
  3777. * try to split our requests into at least this many requests. */
  3778. #define MIN_REQUESTS 3
  3779. /** If we want fewer than this many descriptors, wait until we
  3780. * want more, or until TestingClientMaxIntervalWithoutRequest has passed. */
  3781. #define MAX_DL_TO_DELAY 16
  3782. /** Given a <b>purpose</b> (FETCH_MICRODESC or FETCH_SERVERDESC) and a list of
  3783. * router descriptor digests or microdescriptor digest256s in
  3784. * <b>downloadable</b>, decide whether to delay fetching until we have more.
  3785. * If we don't want to delay, launch one or more requests to the appropriate
  3786. * directory authorities.
  3787. */
  3788. void
  3789. launch_descriptor_downloads(int purpose,
  3790. smartlist_t *downloadable,
  3791. const routerstatus_t *source, time_t now)
  3792. {
  3793. int should_delay = 0, n_downloadable;
  3794. const or_options_t *options = get_options();
  3795. const char *descname;
  3796. tor_assert(purpose == DIR_PURPOSE_FETCH_SERVERDESC ||
  3797. purpose == DIR_PURPOSE_FETCH_MICRODESC);
  3798. descname = (purpose == DIR_PURPOSE_FETCH_SERVERDESC) ?
  3799. "routerdesc" : "microdesc";
  3800. n_downloadable = smartlist_len(downloadable);
  3801. if (!directory_fetches_dir_info_early(options)) {
  3802. if (n_downloadable >= MAX_DL_TO_DELAY) {
  3803. log_debug(LD_DIR,
  3804. "There are enough downloadable %ss to launch requests.",
  3805. descname);
  3806. should_delay = 0;
  3807. } else {
  3808. should_delay = (last_descriptor_download_attempted +
  3809. options->TestingClientMaxIntervalWithoutRequest) > now;
  3810. if (!should_delay && n_downloadable) {
  3811. if (last_descriptor_download_attempted) {
  3812. log_info(LD_DIR,
  3813. "There are not many downloadable %ss, but we've "
  3814. "been waiting long enough (%d seconds). Downloading.",
  3815. descname,
  3816. (int)(now-last_descriptor_download_attempted));
  3817. } else {
  3818. log_info(LD_DIR,
  3819. "There are not many downloadable %ss, but we haven't "
  3820. "tried downloading descriptors recently. Downloading.",
  3821. descname);
  3822. }
  3823. }
  3824. }
  3825. }
  3826. if (! should_delay && n_downloadable) {
  3827. int i, n_per_request;
  3828. const char *req_plural = "", *rtr_plural = "";
  3829. int pds_flags = PDS_RETRY_IF_NO_SERVERS;
  3830. if (! authdir_mode_any_nonhidserv(options)) {
  3831. /* If we wind up going to the authorities, we want to only open one
  3832. * connection to each authority at a time, so that we don't overload
  3833. * them. We do this by setting PDS_NO_EXISTING_SERVERDESC_FETCH
  3834. * regardless of whether we're a cache or not; it gets ignored if we're
  3835. * not calling router_pick_trusteddirserver.
  3836. *
  3837. * Setting this flag can make initiate_descriptor_downloads() ignore
  3838. * requests. We need to make sure that we do in fact call
  3839. * update_router_descriptor_downloads() later on, once the connections
  3840. * have succeeded or failed.
  3841. */
  3842. pds_flags |= (purpose == DIR_PURPOSE_FETCH_MICRODESC) ?
  3843. PDS_NO_EXISTING_MICRODESC_FETCH :
  3844. PDS_NO_EXISTING_SERVERDESC_FETCH;
  3845. }
  3846. n_per_request = CEIL_DIV(n_downloadable, MIN_REQUESTS);
  3847. if (purpose == DIR_PURPOSE_FETCH_MICRODESC) {
  3848. if (n_per_request > MAX_MICRODESC_DL_PER_REQUEST)
  3849. n_per_request = MAX_MICRODESC_DL_PER_REQUEST;
  3850. } else {
  3851. if (n_per_request > MAX_DL_PER_REQUEST)
  3852. n_per_request = MAX_DL_PER_REQUEST;
  3853. }
  3854. if (n_per_request < MIN_DL_PER_REQUEST)
  3855. n_per_request = MIN_DL_PER_REQUEST;
  3856. if (n_downloadable > n_per_request)
  3857. req_plural = rtr_plural = "s";
  3858. else if (n_downloadable > 1)
  3859. rtr_plural = "s";
  3860. log_info(LD_DIR,
  3861. "Launching %d request%s for %d %s%s, %d at a time",
  3862. CEIL_DIV(n_downloadable, n_per_request), req_plural,
  3863. n_downloadable, descname, rtr_plural, n_per_request);
  3864. smartlist_sort_digests(downloadable);
  3865. for (i=0; i < n_downloadable; i += n_per_request) {
  3866. initiate_descriptor_downloads(source, purpose,
  3867. downloadable, i, i+n_per_request,
  3868. pds_flags);
  3869. }
  3870. last_descriptor_download_attempted = now;
  3871. }
  3872. }
  3873. /** For any descriptor that we want that's currently listed in
  3874. * <b>consensus</b>, download it as appropriate. */
  3875. void
  3876. update_consensus_router_descriptor_downloads(time_t now, int is_vote,
  3877. networkstatus_t *consensus)
  3878. {
  3879. const or_options_t *options = get_options();
  3880. digestmap_t *map = NULL;
  3881. smartlist_t *no_longer_old = smartlist_new();
  3882. smartlist_t *downloadable = smartlist_new();
  3883. routerstatus_t *source = NULL;
  3884. int authdir = authdir_mode(options);
  3885. int n_delayed=0, n_have=0, n_would_reject=0, n_wouldnt_use=0,
  3886. n_inprogress=0, n_in_oldrouters=0;
  3887. if (directory_too_idle_to_fetch_descriptors(options, now))
  3888. goto done;
  3889. if (!consensus)
  3890. goto done;
  3891. if (is_vote) {
  3892. /* where's it from, so we know whom to ask for descriptors */
  3893. dir_server_t *ds;
  3894. networkstatus_voter_info_t *voter = smartlist_get(consensus->voters, 0);
  3895. tor_assert(voter);
  3896. ds = trusteddirserver_get_by_v3_auth_digest(voter->identity_digest);
  3897. if (ds)
  3898. source = &(ds->fake_status);
  3899. else
  3900. log_warn(LD_DIR, "couldn't lookup source from vote?");
  3901. }
  3902. map = digestmap_new();
  3903. list_pending_descriptor_downloads(map, 0);
  3904. SMARTLIST_FOREACH_BEGIN(consensus->routerstatus_list, void *, rsp) {
  3905. routerstatus_t *rs =
  3906. is_vote ? &(((vote_routerstatus_t *)rsp)->status) : rsp;
  3907. signed_descriptor_t *sd;
  3908. if ((sd = router_get_by_descriptor_digest(rs->descriptor_digest))) {
  3909. const routerinfo_t *ri;
  3910. ++n_have;
  3911. if (!(ri = router_get_by_id_digest(rs->identity_digest)) ||
  3912. tor_memneq(ri->cache_info.signed_descriptor_digest,
  3913. sd->signed_descriptor_digest, DIGEST_LEN)) {
  3914. /* We have a descriptor with this digest, but either there is no
  3915. * entry in routerlist with the same ID (!ri), or there is one,
  3916. * but the identity digest differs (memneq).
  3917. */
  3918. smartlist_add(no_longer_old, sd);
  3919. ++n_in_oldrouters; /* We have it in old_routers. */
  3920. }
  3921. continue; /* We have it already. */
  3922. }
  3923. if (digestmap_get(map, rs->descriptor_digest)) {
  3924. ++n_inprogress;
  3925. continue; /* We have an in-progress download. */
  3926. }
  3927. if (!download_status_is_ready(&rs->dl_status, now,
  3928. options->TestingDescriptorMaxDownloadTries)) {
  3929. ++n_delayed; /* Not ready for retry. */
  3930. continue;
  3931. }
  3932. if (authdir && dirserv_would_reject_router(rs)) {
  3933. ++n_would_reject;
  3934. continue; /* We would throw it out immediately. */
  3935. }
  3936. if (!directory_caches_dir_info(options) &&
  3937. !client_would_use_router(rs, now, options)) {
  3938. ++n_wouldnt_use;
  3939. continue; /* We would never use it ourself. */
  3940. }
  3941. if (is_vote && source) {
  3942. char time_bufnew[ISO_TIME_LEN+1];
  3943. char time_bufold[ISO_TIME_LEN+1];
  3944. const routerinfo_t *oldrouter;
  3945. oldrouter = router_get_by_id_digest(rs->identity_digest);
  3946. format_iso_time(time_bufnew, rs->published_on);
  3947. if (oldrouter)
  3948. format_iso_time(time_bufold, oldrouter->cache_info.published_on);
  3949. log_info(LD_DIR, "Learned about %s (%s vs %s) from %s's vote (%s)",
  3950. routerstatus_describe(rs),
  3951. time_bufnew,
  3952. oldrouter ? time_bufold : "none",
  3953. source->nickname, oldrouter ? "known" : "unknown");
  3954. }
  3955. smartlist_add(downloadable, rs->descriptor_digest);
  3956. } SMARTLIST_FOREACH_END(rsp);
  3957. if (!authdir_mode_handles_descs(options, ROUTER_PURPOSE_GENERAL)
  3958. && smartlist_len(no_longer_old)) {
  3959. routerlist_t *rl = router_get_routerlist();
  3960. log_info(LD_DIR, "%d router descriptors listed in consensus are "
  3961. "currently in old_routers; making them current.",
  3962. smartlist_len(no_longer_old));
  3963. SMARTLIST_FOREACH_BEGIN(no_longer_old, signed_descriptor_t *, sd) {
  3964. const char *msg;
  3965. was_router_added_t r;
  3966. routerinfo_t *ri = routerlist_reparse_old(rl, sd);
  3967. if (!ri) {
  3968. log_warn(LD_BUG, "Failed to re-parse a router.");
  3969. continue;
  3970. }
  3971. r = router_add_to_routerlist(ri, &msg, 1, 0);
  3972. if (WRA_WAS_OUTDATED(r)) {
  3973. log_warn(LD_DIR, "Couldn't add re-parsed router: %s",
  3974. msg?msg:"???");
  3975. }
  3976. } SMARTLIST_FOREACH_END(sd);
  3977. routerlist_assert_ok(rl);
  3978. }
  3979. log_info(LD_DIR,
  3980. "%d router descriptors downloadable. %d delayed; %d present "
  3981. "(%d of those were in old_routers); %d would_reject; "
  3982. "%d wouldnt_use; %d in progress.",
  3983. smartlist_len(downloadable), n_delayed, n_have, n_in_oldrouters,
  3984. n_would_reject, n_wouldnt_use, n_inprogress);
  3985. launch_descriptor_downloads(DIR_PURPOSE_FETCH_SERVERDESC,
  3986. downloadable, source, now);
  3987. digestmap_free(map, NULL);
  3988. done:
  3989. smartlist_free(downloadable);
  3990. smartlist_free(no_longer_old);
  3991. }
  3992. /** How often should we launch a server/authority request to be sure of getting
  3993. * a guess for our IP? */
  3994. /*XXXX024 this info should come from netinfo cells or something, or we should
  3995. * do this only when we aren't seeing incoming data. see bug 652. */
  3996. #define DUMMY_DOWNLOAD_INTERVAL (20*60)
  3997. /** As needed, launch a dummy router descriptor fetch to see if our
  3998. * address has changed. */
  3999. static void
  4000. launch_dummy_descriptor_download_as_needed(time_t now,
  4001. const or_options_t *options)
  4002. {
  4003. static time_t last_dummy_download = 0;
  4004. /* XXXX024 we could be smarter here; see notes on bug 652. */
  4005. /* If we're a server that doesn't have a configured address, we rely on
  4006. * directory fetches to learn when our address changes. So if we haven't
  4007. * tried to get any routerdescs in a long time, try a dummy fetch now. */
  4008. if (!options->Address &&
  4009. server_mode(options) &&
  4010. last_descriptor_download_attempted + DUMMY_DOWNLOAD_INTERVAL < now &&
  4011. last_dummy_download + DUMMY_DOWNLOAD_INTERVAL < now) {
  4012. last_dummy_download = now;
  4013. directory_get_from_dirserver(DIR_PURPOSE_FETCH_SERVERDESC,
  4014. ROUTER_PURPOSE_GENERAL, "authority.z",
  4015. PDS_RETRY_IF_NO_SERVERS);
  4016. }
  4017. }
  4018. /** Launch downloads for router status as needed. */
  4019. void
  4020. update_router_descriptor_downloads(time_t now)
  4021. {
  4022. const or_options_t *options = get_options();
  4023. if (should_delay_dir_fetches(options, NULL))
  4024. return;
  4025. if (!we_fetch_router_descriptors(options))
  4026. return;
  4027. update_consensus_router_descriptor_downloads(now, 0,
  4028. networkstatus_get_reasonably_live_consensus(now, FLAV_NS));
  4029. }
  4030. /** Launch extrainfo downloads as needed. */
  4031. void
  4032. update_extrainfo_downloads(time_t now)
  4033. {
  4034. const or_options_t *options = get_options();
  4035. routerlist_t *rl;
  4036. smartlist_t *wanted;
  4037. digestmap_t *pending;
  4038. int old_routers, i;
  4039. int n_no_ei = 0, n_pending = 0, n_have = 0, n_delay = 0;
  4040. if (! options->DownloadExtraInfo)
  4041. return;
  4042. if (should_delay_dir_fetches(options, NULL))
  4043. return;
  4044. if (!router_have_minimum_dir_info())
  4045. return;
  4046. pending = digestmap_new();
  4047. list_pending_descriptor_downloads(pending, 1);
  4048. rl = router_get_routerlist();
  4049. wanted = smartlist_new();
  4050. for (old_routers = 0; old_routers < 2; ++old_routers) {
  4051. smartlist_t *lst = old_routers ? rl->old_routers : rl->routers;
  4052. for (i = 0; i < smartlist_len(lst); ++i) {
  4053. signed_descriptor_t *sd;
  4054. char *d;
  4055. if (old_routers)
  4056. sd = smartlist_get(lst, i);
  4057. else
  4058. sd = &((routerinfo_t*)smartlist_get(lst, i))->cache_info;
  4059. if (sd->is_extrainfo)
  4060. continue; /* This should never happen. */
  4061. if (old_routers && !router_get_by_id_digest(sd->identity_digest))
  4062. continue; /* Couldn't check the signature if we got it. */
  4063. if (sd->extrainfo_is_bogus)
  4064. continue;
  4065. d = sd->extra_info_digest;
  4066. if (tor_digest_is_zero(d)) {
  4067. ++n_no_ei;
  4068. continue;
  4069. }
  4070. if (eimap_get(rl->extra_info_map, d)) {
  4071. ++n_have;
  4072. continue;
  4073. }
  4074. if (!download_status_is_ready(&sd->ei_dl_status, now,
  4075. options->TestingDescriptorMaxDownloadTries)) {
  4076. ++n_delay;
  4077. continue;
  4078. }
  4079. if (digestmap_get(pending, d)) {
  4080. ++n_pending;
  4081. continue;
  4082. }
  4083. smartlist_add(wanted, d);
  4084. }
  4085. }
  4086. digestmap_free(pending, NULL);
  4087. log_info(LD_DIR, "Extrainfo download status: %d router with no ei, %d "
  4088. "with present ei, %d delaying, %d pending, %d downloadable.",
  4089. n_no_ei, n_have, n_delay, n_pending, smartlist_len(wanted));
  4090. smartlist_shuffle(wanted);
  4091. for (i = 0; i < smartlist_len(wanted); i += MAX_DL_PER_REQUEST) {
  4092. initiate_descriptor_downloads(NULL, DIR_PURPOSE_FETCH_EXTRAINFO,
  4093. wanted, i, i + MAX_DL_PER_REQUEST,
  4094. PDS_RETRY_IF_NO_SERVERS|PDS_NO_EXISTING_SERVERDESC_FETCH);
  4095. }
  4096. smartlist_free(wanted);
  4097. }
  4098. /** Reset the descriptor download failure count on all routers, so that we
  4099. * can retry any long-failed routers immediately.
  4100. */
  4101. void
  4102. router_reset_descriptor_download_failures(void)
  4103. {
  4104. networkstatus_reset_download_failures();
  4105. last_descriptor_download_attempted = 0;
  4106. if (!routerlist)
  4107. return;
  4108. SMARTLIST_FOREACH(routerlist->routers, routerinfo_t *, ri,
  4109. {
  4110. download_status_reset(&ri->cache_info.ei_dl_status);
  4111. });
  4112. SMARTLIST_FOREACH(routerlist->old_routers, signed_descriptor_t *, sd,
  4113. {
  4114. download_status_reset(&sd->ei_dl_status);
  4115. });
  4116. }
  4117. /** Any changes in a router descriptor's publication time larger than this are
  4118. * automatically non-cosmetic. */
  4119. #define ROUTER_MAX_COSMETIC_TIME_DIFFERENCE (2*60*60)
  4120. /** We allow uptime to vary from how much it ought to be by this much. */
  4121. #define ROUTER_ALLOW_UPTIME_DRIFT (6*60*60)
  4122. /** Return true iff the only differences between r1 and r2 are such that
  4123. * would not cause a recent (post 0.1.1.6) dirserver to republish.
  4124. */
  4125. int
  4126. router_differences_are_cosmetic(const routerinfo_t *r1, const routerinfo_t *r2)
  4127. {
  4128. time_t r1pub, r2pub;
  4129. long time_difference;
  4130. tor_assert(r1 && r2);
  4131. /* r1 should be the one that was published first. */
  4132. if (r1->cache_info.published_on > r2->cache_info.published_on) {
  4133. const routerinfo_t *ri_tmp = r2;
  4134. r2 = r1;
  4135. r1 = ri_tmp;
  4136. }
  4137. /* If any key fields differ, they're different. */
  4138. if (r1->addr != r2->addr ||
  4139. strcasecmp(r1->nickname, r2->nickname) ||
  4140. r1->or_port != r2->or_port ||
  4141. !tor_addr_eq(&r1->ipv6_addr, &r2->ipv6_addr) ||
  4142. r1->ipv6_orport != r2->ipv6_orport ||
  4143. r1->dir_port != r2->dir_port ||
  4144. r1->purpose != r2->purpose ||
  4145. !crypto_pk_eq_keys(r1->onion_pkey, r2->onion_pkey) ||
  4146. !crypto_pk_eq_keys(r1->identity_pkey, r2->identity_pkey) ||
  4147. strcasecmp(r1->platform, r2->platform) ||
  4148. (r1->contact_info && !r2->contact_info) || /* contact_info is optional */
  4149. (!r1->contact_info && r2->contact_info) ||
  4150. (r1->contact_info && r2->contact_info &&
  4151. strcasecmp(r1->contact_info, r2->contact_info)) ||
  4152. r1->is_hibernating != r2->is_hibernating ||
  4153. cmp_addr_policies(r1->exit_policy, r2->exit_policy))
  4154. return 0;
  4155. if ((r1->declared_family == NULL) != (r2->declared_family == NULL))
  4156. return 0;
  4157. if (r1->declared_family && r2->declared_family) {
  4158. int i, n;
  4159. if (smartlist_len(r1->declared_family)!=smartlist_len(r2->declared_family))
  4160. return 0;
  4161. n = smartlist_len(r1->declared_family);
  4162. for (i=0; i < n; ++i) {
  4163. if (strcasecmp(smartlist_get(r1->declared_family, i),
  4164. smartlist_get(r2->declared_family, i)))
  4165. return 0;
  4166. }
  4167. }
  4168. /* Did bandwidth change a lot? */
  4169. if ((r1->bandwidthcapacity < r2->bandwidthcapacity/2) ||
  4170. (r2->bandwidthcapacity < r1->bandwidthcapacity/2))
  4171. return 0;
  4172. /* Did the bandwidthrate or bandwidthburst change? */
  4173. if ((r1->bandwidthrate != r2->bandwidthrate) ||
  4174. (r1->bandwidthburst != r2->bandwidthburst))
  4175. return 0;
  4176. /* Did more than 12 hours pass? */
  4177. if (r1->cache_info.published_on + ROUTER_MAX_COSMETIC_TIME_DIFFERENCE
  4178. < r2->cache_info.published_on)
  4179. return 0;
  4180. /* Did uptime fail to increase by approximately the amount we would think,
  4181. * give or take some slop? */
  4182. r1pub = r1->cache_info.published_on;
  4183. r2pub = r2->cache_info.published_on;
  4184. time_difference = labs(r2->uptime - (r1->uptime + (r2pub - r1pub)));
  4185. if (time_difference > ROUTER_ALLOW_UPTIME_DRIFT &&
  4186. time_difference > r1->uptime * .05 &&
  4187. time_difference > r2->uptime * .05)
  4188. return 0;
  4189. /* Otherwise, the difference is cosmetic. */
  4190. return 1;
  4191. }
  4192. /** Check whether <b>ri</b> (a.k.a. sd) is a router compatible with the
  4193. * extrainfo document
  4194. * <b>ei</b>. If no router is compatible with <b>ei</b>, <b>ei</b> should be
  4195. * dropped. Return 0 for "compatible", return 1 for "reject, and inform
  4196. * whoever uploaded <b>ei</b>, and return -1 for "reject silently.". If
  4197. * <b>msg</b> is present, set *<b>msg</b> to a description of the
  4198. * incompatibility (if any).
  4199. **/
  4200. int
  4201. routerinfo_incompatible_with_extrainfo(const routerinfo_t *ri,
  4202. extrainfo_t *ei,
  4203. signed_descriptor_t *sd,
  4204. const char **msg)
  4205. {
  4206. int digest_matches, r=1;
  4207. tor_assert(ri);
  4208. tor_assert(ei);
  4209. if (!sd)
  4210. sd = (signed_descriptor_t*)&ri->cache_info;
  4211. if (ei->bad_sig) {
  4212. if (msg) *msg = "Extrainfo signature was bad, or signed with wrong key.";
  4213. return 1;
  4214. }
  4215. digest_matches = tor_memeq(ei->cache_info.signed_descriptor_digest,
  4216. sd->extra_info_digest, DIGEST_LEN);
  4217. /* The identity must match exactly to have been generated at the same time
  4218. * by the same router. */
  4219. if (tor_memneq(ri->cache_info.identity_digest,
  4220. ei->cache_info.identity_digest,
  4221. DIGEST_LEN)) {
  4222. if (msg) *msg = "Extrainfo nickname or identity did not match routerinfo";
  4223. goto err; /* different servers */
  4224. }
  4225. if (ei->pending_sig) {
  4226. char signed_digest[128];
  4227. if (crypto_pk_public_checksig(ri->identity_pkey,
  4228. signed_digest, sizeof(signed_digest),
  4229. ei->pending_sig, ei->pending_sig_len) != DIGEST_LEN ||
  4230. tor_memneq(signed_digest, ei->cache_info.signed_descriptor_digest,
  4231. DIGEST_LEN)) {
  4232. ei->bad_sig = 1;
  4233. tor_free(ei->pending_sig);
  4234. if (msg) *msg = "Extrainfo signature bad, or signed with wrong key";
  4235. goto err; /* Bad signature, or no match. */
  4236. }
  4237. ei->cache_info.send_unencrypted = ri->cache_info.send_unencrypted;
  4238. tor_free(ei->pending_sig);
  4239. }
  4240. if (ei->cache_info.published_on < sd->published_on) {
  4241. if (msg) *msg = "Extrainfo published time did not match routerdesc";
  4242. goto err;
  4243. } else if (ei->cache_info.published_on > sd->published_on) {
  4244. if (msg) *msg = "Extrainfo published time did not match routerdesc";
  4245. r = -1;
  4246. goto err;
  4247. }
  4248. if (!digest_matches) {
  4249. if (msg) *msg = "Extrainfo digest did not match value from routerdesc";
  4250. goto err; /* Digest doesn't match declared value. */
  4251. }
  4252. return 0;
  4253. err:
  4254. if (digest_matches) {
  4255. /* This signature was okay, and the digest was right: This is indeed the
  4256. * corresponding extrainfo. But insanely, it doesn't match the routerinfo
  4257. * that lists it. Don't try to fetch this one again. */
  4258. sd->extrainfo_is_bogus = 1;
  4259. }
  4260. return r;
  4261. }
  4262. /** Assert that the internal representation of <b>rl</b> is
  4263. * self-consistent. */
  4264. void
  4265. routerlist_assert_ok(const routerlist_t *rl)
  4266. {
  4267. routerinfo_t *r2;
  4268. signed_descriptor_t *sd2;
  4269. if (!rl)
  4270. return;
  4271. SMARTLIST_FOREACH_BEGIN(rl->routers, routerinfo_t *, r) {
  4272. r2 = rimap_get(rl->identity_map, r->cache_info.identity_digest);
  4273. tor_assert(r == r2);
  4274. sd2 = sdmap_get(rl->desc_digest_map,
  4275. r->cache_info.signed_descriptor_digest);
  4276. tor_assert(&(r->cache_info) == sd2);
  4277. tor_assert(r->cache_info.routerlist_index == r_sl_idx);
  4278. /* XXXX
  4279. *
  4280. * Hoo boy. We need to fix this one, and the fix is a bit tricky, so
  4281. * commenting this out is just a band-aid.
  4282. *
  4283. * The problem is that, although well-behaved router descriptors
  4284. * should never have the same value for their extra_info_digest, it's
  4285. * possible for ill-behaved routers to claim whatever they like there.
  4286. *
  4287. * The real answer is to trash desc_by_eid_map and instead have
  4288. * something that indicates for a given extra-info digest we want,
  4289. * what its download status is. We'll do that as a part of routerlist
  4290. * refactoring once consensus directories are in. For now,
  4291. * this rep violation is probably harmless: an adversary can make us
  4292. * reset our retry count for an extrainfo, but that's not the end
  4293. * of the world. Changing the representation in 0.2.0.x would just
  4294. * destabilize the codebase.
  4295. if (!tor_digest_is_zero(r->cache_info.extra_info_digest)) {
  4296. signed_descriptor_t *sd3 =
  4297. sdmap_get(rl->desc_by_eid_map, r->cache_info.extra_info_digest);
  4298. tor_assert(sd3 == &(r->cache_info));
  4299. }
  4300. */
  4301. } SMARTLIST_FOREACH_END(r);
  4302. SMARTLIST_FOREACH_BEGIN(rl->old_routers, signed_descriptor_t *, sd) {
  4303. r2 = rimap_get(rl->identity_map, sd->identity_digest);
  4304. tor_assert(!r2 || sd != &(r2->cache_info));
  4305. sd2 = sdmap_get(rl->desc_digest_map, sd->signed_descriptor_digest);
  4306. tor_assert(sd == sd2);
  4307. tor_assert(sd->routerlist_index == sd_sl_idx);
  4308. /* XXXX see above.
  4309. if (!tor_digest_is_zero(sd->extra_info_digest)) {
  4310. signed_descriptor_t *sd3 =
  4311. sdmap_get(rl->desc_by_eid_map, sd->extra_info_digest);
  4312. tor_assert(sd3 == sd);
  4313. }
  4314. */
  4315. } SMARTLIST_FOREACH_END(sd);
  4316. RIMAP_FOREACH(rl->identity_map, d, r) {
  4317. tor_assert(tor_memeq(r->cache_info.identity_digest, d, DIGEST_LEN));
  4318. } DIGESTMAP_FOREACH_END;
  4319. SDMAP_FOREACH(rl->desc_digest_map, d, sd) {
  4320. tor_assert(tor_memeq(sd->signed_descriptor_digest, d, DIGEST_LEN));
  4321. } DIGESTMAP_FOREACH_END;
  4322. SDMAP_FOREACH(rl->desc_by_eid_map, d, sd) {
  4323. tor_assert(!tor_digest_is_zero(d));
  4324. tor_assert(sd);
  4325. tor_assert(tor_memeq(sd->extra_info_digest, d, DIGEST_LEN));
  4326. } DIGESTMAP_FOREACH_END;
  4327. EIMAP_FOREACH(rl->extra_info_map, d, ei) {
  4328. signed_descriptor_t *sd;
  4329. tor_assert(tor_memeq(ei->cache_info.signed_descriptor_digest,
  4330. d, DIGEST_LEN));
  4331. sd = sdmap_get(rl->desc_by_eid_map,
  4332. ei->cache_info.signed_descriptor_digest);
  4333. // tor_assert(sd); // XXXX see above
  4334. if (sd) {
  4335. tor_assert(tor_memeq(ei->cache_info.signed_descriptor_digest,
  4336. sd->extra_info_digest, DIGEST_LEN));
  4337. }
  4338. } DIGESTMAP_FOREACH_END;
  4339. }
  4340. /** Allocate and return a new string representing the contact info
  4341. * and platform string for <b>router</b>,
  4342. * surrounded by quotes and using standard C escapes.
  4343. *
  4344. * THIS FUNCTION IS NOT REENTRANT. Don't call it from outside the main
  4345. * thread. Also, each call invalidates the last-returned value, so don't
  4346. * try log_warn(LD_GENERAL, "%s %s", esc_router_info(a), esc_router_info(b));
  4347. *
  4348. * If <b>router</b> is NULL, it just frees its internal memory and returns.
  4349. */
  4350. const char *
  4351. esc_router_info(const routerinfo_t *router)
  4352. {
  4353. static char *info=NULL;
  4354. char *esc_contact, *esc_platform;
  4355. tor_free(info);
  4356. if (!router)
  4357. return NULL; /* we're exiting; just free the memory we use */
  4358. esc_contact = esc_for_log(router->contact_info);
  4359. esc_platform = esc_for_log(router->platform);
  4360. tor_asprintf(&info, "Contact %s, Platform %s", esc_contact, esc_platform);
  4361. tor_free(esc_contact);
  4362. tor_free(esc_platform);
  4363. return info;
  4364. }
  4365. /** Helper for sorting: compare two routerinfos by their identity
  4366. * digest. */
  4367. static int
  4368. compare_routerinfo_by_id_digest_(const void **a, const void **b)
  4369. {
  4370. routerinfo_t *first = *(routerinfo_t **)a, *second = *(routerinfo_t **)b;
  4371. return fast_memcmp(first->cache_info.identity_digest,
  4372. second->cache_info.identity_digest,
  4373. DIGEST_LEN);
  4374. }
  4375. /** Sort a list of routerinfo_t in ascending order of identity digest. */
  4376. void
  4377. routers_sort_by_identity(smartlist_t *routers)
  4378. {
  4379. smartlist_sort(routers, compare_routerinfo_by_id_digest_);
  4380. }
  4381. /** Called when we change a node set, or when we reload the geoip IPv4 list:
  4382. * recompute all country info in all configuration node sets and in the
  4383. * routerlist. */
  4384. void
  4385. refresh_all_country_info(void)
  4386. {
  4387. const or_options_t *options = get_options();
  4388. if (options->EntryNodes)
  4389. routerset_refresh_countries(options->EntryNodes);
  4390. if (options->ExitNodes)
  4391. routerset_refresh_countries(options->ExitNodes);
  4392. if (options->ExcludeNodes)
  4393. routerset_refresh_countries(options->ExcludeNodes);
  4394. if (options->ExcludeExitNodes)
  4395. routerset_refresh_countries(options->ExcludeExitNodes);
  4396. if (options->ExcludeExitNodesUnion_)
  4397. routerset_refresh_countries(options->ExcludeExitNodesUnion_);
  4398. nodelist_refresh_countries();
  4399. }
  4400. /** Determine the routers that are responsible for <b>id</b> (binary) and
  4401. * add pointers to those routers' routerstatus_t to <b>responsible_dirs</b>.
  4402. * Return -1 if we're returning an empty smartlist, else return 0.
  4403. */
  4404. int
  4405. hid_serv_get_responsible_directories(smartlist_t *responsible_dirs,
  4406. const char *id)
  4407. {
  4408. int start, found, n_added = 0, i;
  4409. networkstatus_t *c = networkstatus_get_latest_consensus();
  4410. if (!c || !smartlist_len(c->routerstatus_list)) {
  4411. log_warn(LD_REND, "We don't have a consensus, so we can't perform v2 "
  4412. "rendezvous operations.");
  4413. return -1;
  4414. }
  4415. tor_assert(id);
  4416. start = networkstatus_vote_find_entry_idx(c, id, &found);
  4417. if (start == smartlist_len(c->routerstatus_list)) start = 0;
  4418. i = start;
  4419. do {
  4420. routerstatus_t *r = smartlist_get(c->routerstatus_list, i);
  4421. if (r->is_hs_dir) {
  4422. smartlist_add(responsible_dirs, r);
  4423. if (++n_added == REND_NUMBER_OF_CONSECUTIVE_REPLICAS)
  4424. return 0;
  4425. }
  4426. if (++i == smartlist_len(c->routerstatus_list))
  4427. i = 0;
  4428. } while (i != start);
  4429. /* Even though we don't have the desired number of hidden service
  4430. * directories, be happy if we got any. */
  4431. return smartlist_len(responsible_dirs) ? 0 : -1;
  4432. }
  4433. /** Return true if this node is currently acting as hidden service
  4434. * directory, false otherwise. */
  4435. int
  4436. hid_serv_acting_as_directory(void)
  4437. {
  4438. const routerinfo_t *me = router_get_my_routerinfo();
  4439. if (!me)
  4440. return 0;
  4441. if (!get_options()->HidServDirectoryV2) {
  4442. log_info(LD_REND, "We are not acting as hidden service directory, "
  4443. "because we have not been configured as such.");
  4444. return 0;
  4445. }
  4446. return 1;
  4447. }
  4448. /** Return true if this node is responsible for storing the descriptor ID
  4449. * in <b>query</b> and false otherwise. */
  4450. int
  4451. hid_serv_responsible_for_desc_id(const char *query)
  4452. {
  4453. const routerinfo_t *me;
  4454. routerstatus_t *last_rs;
  4455. const char *my_id, *last_id;
  4456. int result;
  4457. smartlist_t *responsible;
  4458. if (!hid_serv_acting_as_directory())
  4459. return 0;
  4460. if (!(me = router_get_my_routerinfo()))
  4461. return 0; /* This is redundant, but let's be paranoid. */
  4462. my_id = me->cache_info.identity_digest;
  4463. responsible = smartlist_new();
  4464. if (hid_serv_get_responsible_directories(responsible, query) < 0) {
  4465. smartlist_free(responsible);
  4466. return 0;
  4467. }
  4468. last_rs = smartlist_get(responsible, smartlist_len(responsible)-1);
  4469. last_id = last_rs->identity_digest;
  4470. result = rend_id_is_in_interval(my_id, query, last_id);
  4471. smartlist_free(responsible);
  4472. return result;
  4473. }