routerlist.c 176 KB

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