routerlist.c 177 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226
  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 "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 fallback ones
  1155. * (including authorities) 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 a fallback directory mirror if any non-fallback is viable;
  1164. * (the fallback directory mirrors include the authorities)
  1165. * try to avoid using servers that have returned 503 recently.
  1166. */
  1167. const routerstatus_t *
  1168. router_pick_directory_server(dirinfo_type_t type, int flags)
  1169. {
  1170. int busy = 0;
  1171. const routerstatus_t *choice;
  1172. if (!routerlist)
  1173. return NULL;
  1174. choice = router_pick_directory_server_impl(type, flags, &busy);
  1175. if (choice || !(flags & PDS_RETRY_IF_NO_SERVERS))
  1176. return choice;
  1177. if (busy) {
  1178. /* If the reason that we got no server is that servers are "busy",
  1179. * we must be excluding good servers because we already have serverdesc
  1180. * fetches with them. Do not mark down servers up because of this. */
  1181. tor_assert((flags & (PDS_NO_EXISTING_SERVERDESC_FETCH|
  1182. PDS_NO_EXISTING_MICRODESC_FETCH)));
  1183. return NULL;
  1184. }
  1185. log_info(LD_DIR,
  1186. "No reachable router entries for dirservers. "
  1187. "Trying them all again.");
  1188. /* mark all fallback directory mirrors as up again */
  1189. mark_all_dirservers_up(fallback_dir_servers);
  1190. /* try again */
  1191. choice = router_pick_directory_server_impl(type, flags, NULL);
  1192. return choice;
  1193. }
  1194. /** Return the dir_server_t for the directory authority whose identity
  1195. * key hashes to <b>digest</b>, or NULL if no such authority is known.
  1196. */
  1197. dir_server_t *
  1198. router_get_trusteddirserver_by_digest(const char *digest)
  1199. {
  1200. if (!trusted_dir_servers)
  1201. return NULL;
  1202. SMARTLIST_FOREACH(trusted_dir_servers, dir_server_t *, ds,
  1203. {
  1204. if (tor_memeq(ds->digest, digest, DIGEST_LEN))
  1205. return ds;
  1206. });
  1207. return NULL;
  1208. }
  1209. /** Return the dir_server_t for the fallback dirserver whose identity
  1210. * key hashes to <b>digest</b>, or NULL if no such authority is known.
  1211. */
  1212. dir_server_t *
  1213. router_get_fallback_dirserver_by_digest(const char *digest)
  1214. {
  1215. if (!fallback_dir_servers)
  1216. return NULL;
  1217. SMARTLIST_FOREACH(fallback_dir_servers, dir_server_t *, ds,
  1218. {
  1219. if (tor_memeq(ds->digest, digest, DIGEST_LEN))
  1220. return ds;
  1221. });
  1222. return NULL;
  1223. }
  1224. /** Return the dir_server_t for the directory authority whose
  1225. * v3 identity key hashes to <b>digest</b>, or NULL if no such authority
  1226. * is known.
  1227. */
  1228. dir_server_t *
  1229. trusteddirserver_get_by_v3_auth_digest(const char *digest)
  1230. {
  1231. if (!trusted_dir_servers)
  1232. return NULL;
  1233. SMARTLIST_FOREACH(trusted_dir_servers, dir_server_t *, ds,
  1234. {
  1235. if (tor_memeq(ds->v3_identity_digest, digest, DIGEST_LEN) &&
  1236. (ds->type & V3_DIRINFO))
  1237. return ds;
  1238. });
  1239. return NULL;
  1240. }
  1241. /** Try to find a running directory authority. Flags are as for
  1242. * router_pick_directory_server.
  1243. */
  1244. const routerstatus_t *
  1245. router_pick_trusteddirserver(dirinfo_type_t type, int flags)
  1246. {
  1247. return router_pick_dirserver_generic(trusted_dir_servers, type, flags);
  1248. }
  1249. /** Try to find a running fallback directory. Flags are as for
  1250. * router_pick_directory_server.
  1251. */
  1252. const routerstatus_t *
  1253. router_pick_fallback_dirserver(dirinfo_type_t type, int flags)
  1254. {
  1255. return router_pick_dirserver_generic(fallback_dir_servers, type, flags);
  1256. }
  1257. /** Try to find a running fallback directory. Flags are as for
  1258. * router_pick_directory_server.
  1259. */
  1260. static const routerstatus_t *
  1261. router_pick_dirserver_generic(smartlist_t *sourcelist,
  1262. dirinfo_type_t type, int flags)
  1263. {
  1264. const routerstatus_t *choice;
  1265. int busy = 0;
  1266. choice = router_pick_trusteddirserver_impl(sourcelist, type, flags, &busy);
  1267. if (choice || !(flags & PDS_RETRY_IF_NO_SERVERS))
  1268. return choice;
  1269. if (busy) {
  1270. /* If the reason that we got no server is that servers are "busy",
  1271. * we must be excluding good servers because we already have serverdesc
  1272. * fetches with them. Do not mark down servers up because of this. */
  1273. tor_assert((flags & (PDS_NO_EXISTING_SERVERDESC_FETCH|
  1274. PDS_NO_EXISTING_MICRODESC_FETCH)));
  1275. return NULL;
  1276. }
  1277. log_info(LD_DIR,
  1278. "No dirservers are reachable. Trying them all again.");
  1279. mark_all_dirservers_up(sourcelist);
  1280. return router_pick_trusteddirserver_impl(sourcelist, type, flags, NULL);
  1281. }
  1282. /** How long do we avoid using a directory server after it's given us a 503? */
  1283. #define DIR_503_TIMEOUT (60*60)
  1284. /** Pick a random running valid directory server/mirror from our
  1285. * routerlist. Arguments are as for router_pick_directory_server(), except:
  1286. *
  1287. * If <b>n_busy_out</b> is provided, set *<b>n_busy_out</b> to the number of
  1288. * directories that we excluded for no other reason than
  1289. * PDS_NO_EXISTING_SERVERDESC_FETCH or PDS_NO_EXISTING_MICRODESC_FETCH.
  1290. */
  1291. static const routerstatus_t *
  1292. router_pick_directory_server_impl(dirinfo_type_t type, int flags,
  1293. int *n_busy_out)
  1294. {
  1295. const or_options_t *options = get_options();
  1296. const node_t *result;
  1297. smartlist_t *direct, *tunnel;
  1298. smartlist_t *trusted_direct, *trusted_tunnel;
  1299. smartlist_t *overloaded_direct, *overloaded_tunnel;
  1300. time_t now = time(NULL);
  1301. const networkstatus_t *consensus = networkstatus_get_latest_consensus();
  1302. const int requireother = ! (flags & PDS_ALLOW_SELF);
  1303. const int fascistfirewall = ! (flags & PDS_IGNORE_FASCISTFIREWALL);
  1304. const int no_serverdesc_fetching =(flags & PDS_NO_EXISTING_SERVERDESC_FETCH);
  1305. const int no_microdesc_fetching = (flags & PDS_NO_EXISTING_MICRODESC_FETCH);
  1306. const int for_guard = (flags & PDS_FOR_GUARD);
  1307. int try_excluding = 1, n_excluded = 0, n_busy = 0;
  1308. if (!consensus)
  1309. return NULL;
  1310. retry_without_exclude:
  1311. direct = smartlist_new();
  1312. tunnel = smartlist_new();
  1313. trusted_direct = smartlist_new();
  1314. trusted_tunnel = smartlist_new();
  1315. overloaded_direct = smartlist_new();
  1316. overloaded_tunnel = smartlist_new();
  1317. /* Find all the running dirservers we know about. */
  1318. SMARTLIST_FOREACH_BEGIN(nodelist_get_list(), const node_t *, node) {
  1319. int is_trusted, is_trusted_extrainfo;
  1320. int is_overloaded;
  1321. tor_addr_t addr;
  1322. const routerstatus_t *status = node->rs;
  1323. const country_t country = node->country;
  1324. if (!status)
  1325. continue;
  1326. if (!node->is_running || !status->dir_port || !node->is_valid)
  1327. continue;
  1328. if (requireother && router_digest_is_me(node->identity))
  1329. continue;
  1330. is_trusted = router_digest_is_trusted_dir(node->identity);
  1331. is_trusted_extrainfo = router_digest_is_trusted_dir_type(
  1332. node->identity, EXTRAINFO_DIRINFO);
  1333. if ((type & EXTRAINFO_DIRINFO) &&
  1334. !router_supports_extrainfo(node->identity, is_trusted_extrainfo))
  1335. continue;
  1336. /* Don't make the same node a guard twice */
  1337. if (for_guard && node->using_as_guard) {
  1338. continue;
  1339. }
  1340. /* Ensure that a directory guard is actually a guard node. */
  1341. if (for_guard && !node->is_possible_guard) {
  1342. continue;
  1343. }
  1344. if (try_excluding &&
  1345. routerset_contains_routerstatus(options->ExcludeNodes, status,
  1346. country)) {
  1347. ++n_excluded;
  1348. continue;
  1349. }
  1350. /* XXXX IP6 proposal 118 */
  1351. tor_addr_from_ipv4h(&addr, status->addr);
  1352. if (no_serverdesc_fetching && (
  1353. connection_get_by_type_addr_port_purpose(
  1354. CONN_TYPE_DIR, &addr, status->dir_port, DIR_PURPOSE_FETCH_SERVERDESC)
  1355. || connection_get_by_type_addr_port_purpose(
  1356. CONN_TYPE_DIR, &addr, status->dir_port, DIR_PURPOSE_FETCH_EXTRAINFO)
  1357. )) {
  1358. ++n_busy;
  1359. continue;
  1360. }
  1361. if (no_microdesc_fetching && connection_get_by_type_addr_port_purpose(
  1362. CONN_TYPE_DIR, &addr, status->dir_port, DIR_PURPOSE_FETCH_MICRODESC)
  1363. ) {
  1364. ++n_busy;
  1365. continue;
  1366. }
  1367. is_overloaded = status->last_dir_503_at + DIR_503_TIMEOUT > now;
  1368. if ((!fascistfirewall ||
  1369. fascist_firewall_allows_address_or(&addr, status->or_port)))
  1370. smartlist_add(is_trusted ? trusted_tunnel :
  1371. is_overloaded ? overloaded_tunnel : tunnel, (void*)node);
  1372. else if (!fascistfirewall ||
  1373. fascist_firewall_allows_address_dir(&addr, status->dir_port))
  1374. smartlist_add(is_trusted ? trusted_direct :
  1375. is_overloaded ? overloaded_direct : direct, (void*)node);
  1376. } SMARTLIST_FOREACH_END(node);
  1377. if (smartlist_len(tunnel)) {
  1378. result = node_sl_choose_by_bandwidth(tunnel, WEIGHT_FOR_DIR);
  1379. } else if (smartlist_len(overloaded_tunnel)) {
  1380. result = node_sl_choose_by_bandwidth(overloaded_tunnel,
  1381. WEIGHT_FOR_DIR);
  1382. } else if (smartlist_len(trusted_tunnel)) {
  1383. /* FFFF We don't distinguish between trusteds and overloaded trusteds
  1384. * yet. Maybe one day we should. */
  1385. /* FFFF We also don't load balance over authorities yet. I think this
  1386. * is a feature, but it could easily be a bug. -RD */
  1387. result = smartlist_choose(trusted_tunnel);
  1388. } else if (smartlist_len(direct)) {
  1389. result = node_sl_choose_by_bandwidth(direct, WEIGHT_FOR_DIR);
  1390. } else if (smartlist_len(overloaded_direct)) {
  1391. result = node_sl_choose_by_bandwidth(overloaded_direct,
  1392. WEIGHT_FOR_DIR);
  1393. } else {
  1394. result = smartlist_choose(trusted_direct);
  1395. }
  1396. smartlist_free(direct);
  1397. smartlist_free(tunnel);
  1398. smartlist_free(trusted_direct);
  1399. smartlist_free(trusted_tunnel);
  1400. smartlist_free(overloaded_direct);
  1401. smartlist_free(overloaded_tunnel);
  1402. if (result == NULL && try_excluding && !options->StrictNodes && n_excluded
  1403. && !n_busy) {
  1404. /* If we got no result, and we are excluding nodes, and StrictNodes is
  1405. * not set, try again without excluding nodes. */
  1406. try_excluding = 0;
  1407. n_excluded = 0;
  1408. n_busy = 0;
  1409. goto retry_without_exclude;
  1410. }
  1411. if (n_busy_out)
  1412. *n_busy_out = n_busy;
  1413. return result ? result->rs : NULL;
  1414. }
  1415. /** Pick a random element from a list of dir_server_t, weighting by their
  1416. * <b>weight</b> field. */
  1417. static const dir_server_t *
  1418. dirserver_choose_by_weight(const smartlist_t *servers, double authority_weight)
  1419. {
  1420. int n = smartlist_len(servers);
  1421. int i;
  1422. u64_dbl_t *weights;
  1423. const dir_server_t *ds;
  1424. weights = tor_calloc(n, sizeof(u64_dbl_t));
  1425. for (i = 0; i < n; ++i) {
  1426. ds = smartlist_get(servers, i);
  1427. weights[i].dbl = ds->weight;
  1428. if (ds->is_authority)
  1429. weights[i].dbl *= authority_weight;
  1430. }
  1431. scale_array_elements_to_u64(weights, n, NULL);
  1432. i = choose_array_element_by_weight(weights, n);
  1433. tor_free(weights);
  1434. return (i < 0) ? NULL : smartlist_get(servers, i);
  1435. }
  1436. /** Choose randomly from among the dir_server_ts in sourcelist that
  1437. * are up. Flags are as for router_pick_directory_server_impl().
  1438. */
  1439. static const routerstatus_t *
  1440. router_pick_trusteddirserver_impl(const smartlist_t *sourcelist,
  1441. dirinfo_type_t type, int flags,
  1442. int *n_busy_out)
  1443. {
  1444. const or_options_t *options = get_options();
  1445. smartlist_t *direct, *tunnel;
  1446. smartlist_t *overloaded_direct, *overloaded_tunnel;
  1447. const routerinfo_t *me = router_get_my_routerinfo();
  1448. const routerstatus_t *result = NULL;
  1449. time_t now = time(NULL);
  1450. const int requireother = ! (flags & PDS_ALLOW_SELF);
  1451. const int fascistfirewall = ! (flags & PDS_IGNORE_FASCISTFIREWALL);
  1452. const int no_serverdesc_fetching =(flags & PDS_NO_EXISTING_SERVERDESC_FETCH);
  1453. const int no_microdesc_fetching =(flags & PDS_NO_EXISTING_MICRODESC_FETCH);
  1454. const double auth_weight = (sourcelist == fallback_dir_servers) ?
  1455. options->DirAuthorityFallbackRate : 1.0;
  1456. smartlist_t *pick_from;
  1457. int n_busy = 0;
  1458. int try_excluding = 1, n_excluded = 0;
  1459. if (!sourcelist)
  1460. return NULL;
  1461. retry_without_exclude:
  1462. direct = smartlist_new();
  1463. tunnel = smartlist_new();
  1464. overloaded_direct = smartlist_new();
  1465. overloaded_tunnel = smartlist_new();
  1466. SMARTLIST_FOREACH_BEGIN(sourcelist, const dir_server_t *, d)
  1467. {
  1468. int is_overloaded =
  1469. d->fake_status.last_dir_503_at + DIR_503_TIMEOUT > now;
  1470. tor_addr_t addr;
  1471. if (!d->is_running) continue;
  1472. if ((type & d->type) == 0)
  1473. continue;
  1474. if ((type & EXTRAINFO_DIRINFO) &&
  1475. !router_supports_extrainfo(d->digest, 1))
  1476. continue;
  1477. if (requireother && me && router_digest_is_me(d->digest))
  1478. continue;
  1479. if (try_excluding &&
  1480. routerset_contains_routerstatus(options->ExcludeNodes,
  1481. &d->fake_status, -1)) {
  1482. ++n_excluded;
  1483. continue;
  1484. }
  1485. /* XXXX IP6 proposal 118 */
  1486. tor_addr_from_ipv4h(&addr, d->addr);
  1487. if (no_serverdesc_fetching) {
  1488. if (connection_get_by_type_addr_port_purpose(
  1489. CONN_TYPE_DIR, &addr, d->dir_port, DIR_PURPOSE_FETCH_SERVERDESC)
  1490. || connection_get_by_type_addr_port_purpose(
  1491. CONN_TYPE_DIR, &addr, d->dir_port, DIR_PURPOSE_FETCH_EXTRAINFO)) {
  1492. //log_debug(LD_DIR, "We have an existing connection to fetch "
  1493. // "descriptor from %s; delaying",d->description);
  1494. ++n_busy;
  1495. continue;
  1496. }
  1497. }
  1498. if (no_microdesc_fetching) {
  1499. if (connection_get_by_type_addr_port_purpose(
  1500. CONN_TYPE_DIR, &addr, d->dir_port, DIR_PURPOSE_FETCH_MICRODESC)) {
  1501. ++n_busy;
  1502. continue;
  1503. }
  1504. }
  1505. if (d->or_port &&
  1506. (!fascistfirewall ||
  1507. fascist_firewall_allows_address_or(&addr, d->or_port)))
  1508. smartlist_add(is_overloaded ? overloaded_tunnel : tunnel, (void*)d);
  1509. else if (!fascistfirewall ||
  1510. fascist_firewall_allows_address_dir(&addr, d->dir_port))
  1511. smartlist_add(is_overloaded ? overloaded_direct : direct, (void*)d);
  1512. }
  1513. SMARTLIST_FOREACH_END(d);
  1514. if (smartlist_len(tunnel)) {
  1515. pick_from = tunnel;
  1516. } else if (smartlist_len(overloaded_tunnel)) {
  1517. pick_from = overloaded_tunnel;
  1518. } else if (smartlist_len(direct)) {
  1519. pick_from = direct;
  1520. } else {
  1521. pick_from = overloaded_direct;
  1522. }
  1523. {
  1524. const dir_server_t *selection =
  1525. dirserver_choose_by_weight(pick_from, auth_weight);
  1526. if (selection)
  1527. result = &selection->fake_status;
  1528. }
  1529. if (n_busy_out)
  1530. *n_busy_out = n_busy;
  1531. smartlist_free(direct);
  1532. smartlist_free(tunnel);
  1533. smartlist_free(overloaded_direct);
  1534. smartlist_free(overloaded_tunnel);
  1535. if (result == NULL && try_excluding && !options->StrictNodes && n_excluded) {
  1536. /* If we got no result, and we are excluding nodes, and StrictNodes is
  1537. * not set, try again without excluding nodes. */
  1538. try_excluding = 0;
  1539. n_excluded = 0;
  1540. goto retry_without_exclude;
  1541. }
  1542. return result;
  1543. }
  1544. /** Mark as running every dir_server_t in <b>server_list</b>. */
  1545. static void
  1546. mark_all_dirservers_up(smartlist_t *server_list)
  1547. {
  1548. if (server_list) {
  1549. SMARTLIST_FOREACH_BEGIN(server_list, dir_server_t *, dir) {
  1550. routerstatus_t *rs;
  1551. node_t *node;
  1552. dir->is_running = 1;
  1553. node = node_get_mutable_by_id(dir->digest);
  1554. if (node)
  1555. node->is_running = 1;
  1556. rs = router_get_mutable_consensus_status_by_id(dir->digest);
  1557. if (rs) {
  1558. rs->last_dir_503_at = 0;
  1559. control_event_networkstatus_changed_single(rs);
  1560. }
  1561. } SMARTLIST_FOREACH_END(dir);
  1562. }
  1563. router_dir_info_changed();
  1564. }
  1565. /** Return true iff r1 and r2 have the same address and OR port. */
  1566. int
  1567. routers_have_same_or_addrs(const routerinfo_t *r1, const routerinfo_t *r2)
  1568. {
  1569. return r1->addr == r2->addr && r1->or_port == r2->or_port &&
  1570. tor_addr_eq(&r1->ipv6_addr, &r2->ipv6_addr) &&
  1571. r1->ipv6_orport == r2->ipv6_orport;
  1572. }
  1573. /** Reset all internal variables used to count failed downloads of network
  1574. * status objects. */
  1575. void
  1576. router_reset_status_download_failures(void)
  1577. {
  1578. mark_all_dirservers_up(fallback_dir_servers);
  1579. }
  1580. /** Given a <b>router</b>, add every node_t in its family (including the
  1581. * node itself!) to <b>sl</b>.
  1582. *
  1583. * Note the type mismatch: This function takes a routerinfo, but adds nodes
  1584. * to the smartlist!
  1585. */
  1586. static void
  1587. routerlist_add_node_and_family(smartlist_t *sl, const routerinfo_t *router)
  1588. {
  1589. /* XXXX MOVE ? */
  1590. node_t fake_node;
  1591. const node_t *node = node_get_by_id(router->cache_info.identity_digest);;
  1592. if (node == NULL) {
  1593. memset(&fake_node, 0, sizeof(fake_node));
  1594. fake_node.ri = (routerinfo_t *)router;
  1595. memcpy(fake_node.identity, router->cache_info.identity_digest, DIGEST_LEN);
  1596. node = &fake_node;
  1597. }
  1598. nodelist_add_node_and_family(sl, node);
  1599. }
  1600. /** Add every suitable node from our nodelist to <b>sl</b>, so that
  1601. * we can pick a node for a circuit.
  1602. */
  1603. void
  1604. router_add_running_nodes_to_smartlist(smartlist_t *sl, int allow_invalid,
  1605. int need_uptime, int need_capacity,
  1606. int need_guard, int need_desc)
  1607. { /* XXXX MOVE */
  1608. SMARTLIST_FOREACH_BEGIN(nodelist_get_list(), const node_t *, node) {
  1609. if (!node->is_running ||
  1610. (!node->is_valid && !allow_invalid))
  1611. continue;
  1612. if (need_desc && !(node->ri || (node->rs && node->md)))
  1613. continue;
  1614. if (node->ri && node->ri->purpose != ROUTER_PURPOSE_GENERAL)
  1615. continue;
  1616. if (node_is_unreliable(node, need_uptime, need_capacity, need_guard))
  1617. continue;
  1618. smartlist_add(sl, (void *)node);
  1619. } SMARTLIST_FOREACH_END(node);
  1620. }
  1621. /** Look through the routerlist until we find a router that has my key.
  1622. Return it. */
  1623. const routerinfo_t *
  1624. routerlist_find_my_routerinfo(void)
  1625. {
  1626. if (!routerlist)
  1627. return NULL;
  1628. SMARTLIST_FOREACH(routerlist->routers, routerinfo_t *, router,
  1629. {
  1630. if (router_is_me(router))
  1631. return router;
  1632. });
  1633. return NULL;
  1634. }
  1635. /** Return the smaller of the router's configured BandwidthRate
  1636. * and its advertised capacity. */
  1637. uint32_t
  1638. router_get_advertised_bandwidth(const routerinfo_t *router)
  1639. {
  1640. if (router->bandwidthcapacity < router->bandwidthrate)
  1641. return router->bandwidthcapacity;
  1642. return router->bandwidthrate;
  1643. }
  1644. /** Do not weight any declared bandwidth more than this much when picking
  1645. * routers by bandwidth. */
  1646. #define DEFAULT_MAX_BELIEVABLE_BANDWIDTH 10000000 /* 10 MB/sec */
  1647. /** Return the smaller of the router's configured BandwidthRate
  1648. * and its advertised capacity, capped by max-believe-bw. */
  1649. uint32_t
  1650. router_get_advertised_bandwidth_capped(const routerinfo_t *router)
  1651. {
  1652. uint32_t result = router->bandwidthcapacity;
  1653. if (result > router->bandwidthrate)
  1654. result = router->bandwidthrate;
  1655. if (result > DEFAULT_MAX_BELIEVABLE_BANDWIDTH)
  1656. result = DEFAULT_MAX_BELIEVABLE_BANDWIDTH;
  1657. return result;
  1658. }
  1659. /** Given an array of double/uint64_t unions that are currently being used as
  1660. * doubles, convert them to uint64_t, and try to scale them linearly so as to
  1661. * much of the range of uint64_t. If <b>total_out</b> is provided, set it to
  1662. * the sum of all elements in the array _before_ scaling. */
  1663. STATIC void
  1664. scale_array_elements_to_u64(u64_dbl_t *entries, int n_entries,
  1665. uint64_t *total_out)
  1666. {
  1667. double total = 0.0;
  1668. double scale_factor = 0.0;
  1669. int i;
  1670. /* big, but far away from overflowing an int64_t */
  1671. #define SCALE_TO_U64_MAX ((int64_t) (INT64_MAX / 4))
  1672. for (i = 0; i < n_entries; ++i)
  1673. total += entries[i].dbl;
  1674. if (total > 0.0)
  1675. scale_factor = SCALE_TO_U64_MAX / total;
  1676. for (i = 0; i < n_entries; ++i)
  1677. entries[i].u64 = tor_llround(entries[i].dbl * scale_factor);
  1678. if (total_out)
  1679. *total_out = (uint64_t) total;
  1680. #undef SCALE_TO_U64_MAX
  1681. }
  1682. /** Time-invariant 64-bit greater-than; works on two integers in the range
  1683. * (0,INT64_MAX). */
  1684. #if SIZEOF_VOID_P == 8
  1685. #define gt_i64_timei(a,b) ((a) > (b))
  1686. #else
  1687. static INLINE int
  1688. gt_i64_timei(uint64_t a, uint64_t b)
  1689. {
  1690. int64_t diff = (int64_t) (b - a);
  1691. int res = diff >> 63;
  1692. return res & 1;
  1693. }
  1694. #endif
  1695. /** Pick a random element of <b>n_entries</b>-element array <b>entries</b>,
  1696. * choosing each element with a probability proportional to its (uint64_t)
  1697. * value, and return the index of that element. If all elements are 0, choose
  1698. * an index at random. Return -1 on error.
  1699. */
  1700. STATIC int
  1701. choose_array_element_by_weight(const u64_dbl_t *entries, int n_entries)
  1702. {
  1703. int i, i_chosen=-1, n_chosen=0;
  1704. uint64_t total_so_far = 0;
  1705. uint64_t rand_val;
  1706. uint64_t total = 0;
  1707. for (i = 0; i < n_entries; ++i)
  1708. total += entries[i].u64;
  1709. if (n_entries < 1)
  1710. return -1;
  1711. if (total == 0)
  1712. return crypto_rand_int(n_entries);
  1713. tor_assert(total < INT64_MAX);
  1714. rand_val = crypto_rand_uint64(total);
  1715. for (i = 0; i < n_entries; ++i) {
  1716. total_so_far += entries[i].u64;
  1717. if (gt_i64_timei(total_so_far, rand_val)) {
  1718. i_chosen = i;
  1719. n_chosen++;
  1720. /* Set rand_val to INT64_MAX rather than stopping the loop. This way,
  1721. * the time we spend in the loop does not leak which element we chose. */
  1722. rand_val = INT64_MAX;
  1723. }
  1724. }
  1725. tor_assert(total_so_far == total);
  1726. tor_assert(n_chosen == 1);
  1727. tor_assert(i_chosen >= 0);
  1728. tor_assert(i_chosen < n_entries);
  1729. return i_chosen;
  1730. }
  1731. /** When weighting bridges, enforce these values as lower and upper
  1732. * bound for believable bandwidth, because there is no way for us
  1733. * to verify a bridge's bandwidth currently. */
  1734. #define BRIDGE_MIN_BELIEVABLE_BANDWIDTH 20000 /* 20 kB/sec */
  1735. #define BRIDGE_MAX_BELIEVABLE_BANDWIDTH 100000 /* 100 kB/sec */
  1736. /** Return the smaller of the router's configured BandwidthRate
  1737. * and its advertised capacity, making sure to stay within the
  1738. * interval between bridge-min-believe-bw and
  1739. * bridge-max-believe-bw. */
  1740. static uint32_t
  1741. bridge_get_advertised_bandwidth_bounded(routerinfo_t *router)
  1742. {
  1743. uint32_t result = router->bandwidthcapacity;
  1744. if (result > router->bandwidthrate)
  1745. result = router->bandwidthrate;
  1746. if (result > BRIDGE_MAX_BELIEVABLE_BANDWIDTH)
  1747. result = BRIDGE_MAX_BELIEVABLE_BANDWIDTH;
  1748. else if (result < BRIDGE_MIN_BELIEVABLE_BANDWIDTH)
  1749. result = BRIDGE_MIN_BELIEVABLE_BANDWIDTH;
  1750. return result;
  1751. }
  1752. /** Return bw*1000, unless bw*1000 would overflow, in which case return
  1753. * INT32_MAX. */
  1754. static INLINE int32_t
  1755. kb_to_bytes(uint32_t bw)
  1756. {
  1757. return (bw > (INT32_MAX/1000)) ? INT32_MAX : bw*1000;
  1758. }
  1759. /** Helper function:
  1760. * choose a random element of smartlist <b>sl</b> of nodes, weighted by
  1761. * the advertised bandwidth of each element using the consensus
  1762. * bandwidth weights.
  1763. *
  1764. * If <b>rule</b>==WEIGHT_FOR_EXIT. we're picking an exit node: consider all
  1765. * nodes' bandwidth equally regardless of their Exit status, since there may
  1766. * be some in the list because they exit to obscure ports. If
  1767. * <b>rule</b>==NO_WEIGHTING, we're picking a non-exit node: weight
  1768. * exit-node's bandwidth less depending on the smallness of the fraction of
  1769. * Exit-to-total bandwidth. If <b>rule</b>==WEIGHT_FOR_GUARD, we're picking a
  1770. * guard node: consider all guard's bandwidth equally. Otherwise, weight
  1771. * guards proportionally less.
  1772. */
  1773. static const node_t *
  1774. smartlist_choose_node_by_bandwidth_weights(const smartlist_t *sl,
  1775. bandwidth_weight_rule_t rule)
  1776. {
  1777. u64_dbl_t *bandwidths=NULL;
  1778. if (compute_weighted_bandwidths(sl, rule, &bandwidths) < 0)
  1779. return NULL;
  1780. scale_array_elements_to_u64(bandwidths, smartlist_len(sl), NULL);
  1781. {
  1782. int idx = choose_array_element_by_weight(bandwidths,
  1783. smartlist_len(sl));
  1784. tor_free(bandwidths);
  1785. return idx < 0 ? NULL : smartlist_get(sl, idx);
  1786. }
  1787. }
  1788. /** Given a list of routers and a weighting rule as in
  1789. * smartlist_choose_node_by_bandwidth_weights, compute weighted bandwidth
  1790. * values for each node and store them in a freshly allocated
  1791. * *<b>bandwidths_out</b> of the same length as <b>sl</b>, and holding results
  1792. * as doubles. Return 0 on success, -1 on failure. */
  1793. static int
  1794. compute_weighted_bandwidths(const smartlist_t *sl,
  1795. bandwidth_weight_rule_t rule,
  1796. u64_dbl_t **bandwidths_out)
  1797. {
  1798. int64_t weight_scale;
  1799. double Wg = -1, Wm = -1, We = -1, Wd = -1;
  1800. double Wgb = -1, Wmb = -1, Web = -1, Wdb = -1;
  1801. uint64_t weighted_bw = 0;
  1802. guardfraction_bandwidth_t guardfraction_bw;
  1803. u64_dbl_t *bandwidths;
  1804. /* Can't choose exit and guard at same time */
  1805. tor_assert(rule == NO_WEIGHTING ||
  1806. rule == WEIGHT_FOR_EXIT ||
  1807. rule == WEIGHT_FOR_GUARD ||
  1808. rule == WEIGHT_FOR_MID ||
  1809. rule == WEIGHT_FOR_DIR);
  1810. if (smartlist_len(sl) == 0) {
  1811. log_info(LD_CIRC,
  1812. "Empty routerlist passed in to consensus weight node "
  1813. "selection for rule %s",
  1814. bandwidth_weight_rule_to_string(rule));
  1815. return -1;
  1816. }
  1817. weight_scale = networkstatus_get_weight_scale_param(NULL);
  1818. if (rule == WEIGHT_FOR_GUARD) {
  1819. Wg = networkstatus_get_bw_weight(NULL, "Wgg", -1);
  1820. Wm = networkstatus_get_bw_weight(NULL, "Wgm", -1); /* Bridges */
  1821. We = 0;
  1822. Wd = networkstatus_get_bw_weight(NULL, "Wgd", -1);
  1823. Wgb = networkstatus_get_bw_weight(NULL, "Wgb", -1);
  1824. Wmb = networkstatus_get_bw_weight(NULL, "Wmb", -1);
  1825. Web = networkstatus_get_bw_weight(NULL, "Web", -1);
  1826. Wdb = networkstatus_get_bw_weight(NULL, "Wdb", -1);
  1827. } else if (rule == WEIGHT_FOR_MID) {
  1828. Wg = networkstatus_get_bw_weight(NULL, "Wmg", -1);
  1829. Wm = networkstatus_get_bw_weight(NULL, "Wmm", -1);
  1830. We = networkstatus_get_bw_weight(NULL, "Wme", -1);
  1831. Wd = networkstatus_get_bw_weight(NULL, "Wmd", -1);
  1832. Wgb = networkstatus_get_bw_weight(NULL, "Wgb", -1);
  1833. Wmb = networkstatus_get_bw_weight(NULL, "Wmb", -1);
  1834. Web = networkstatus_get_bw_weight(NULL, "Web", -1);
  1835. Wdb = networkstatus_get_bw_weight(NULL, "Wdb", -1);
  1836. } else if (rule == WEIGHT_FOR_EXIT) {
  1837. // Guards CAN be exits if they have weird exit policies
  1838. // They are d then I guess...
  1839. We = networkstatus_get_bw_weight(NULL, "Wee", -1);
  1840. Wm = networkstatus_get_bw_weight(NULL, "Wem", -1); /* Odd exit policies */
  1841. Wd = networkstatus_get_bw_weight(NULL, "Wed", -1);
  1842. Wg = networkstatus_get_bw_weight(NULL, "Weg", -1); /* Odd exit policies */
  1843. Wgb = networkstatus_get_bw_weight(NULL, "Wgb", -1);
  1844. Wmb = networkstatus_get_bw_weight(NULL, "Wmb", -1);
  1845. Web = networkstatus_get_bw_weight(NULL, "Web", -1);
  1846. Wdb = networkstatus_get_bw_weight(NULL, "Wdb", -1);
  1847. } else if (rule == WEIGHT_FOR_DIR) {
  1848. We = networkstatus_get_bw_weight(NULL, "Wbe", -1);
  1849. Wm = networkstatus_get_bw_weight(NULL, "Wbm", -1);
  1850. Wd = networkstatus_get_bw_weight(NULL, "Wbd", -1);
  1851. Wg = networkstatus_get_bw_weight(NULL, "Wbg", -1);
  1852. Wgb = Wmb = Web = Wdb = weight_scale;
  1853. } else if (rule == NO_WEIGHTING) {
  1854. Wg = Wm = We = Wd = weight_scale;
  1855. Wgb = Wmb = Web = Wdb = weight_scale;
  1856. }
  1857. if (Wg < 0 || Wm < 0 || We < 0 || Wd < 0 || Wgb < 0 || Wmb < 0 || Wdb < 0
  1858. || Web < 0) {
  1859. log_debug(LD_CIRC,
  1860. "Got negative bandwidth weights. Defaulting to naive selection"
  1861. " algorithm.");
  1862. Wg = Wm = We = Wd = weight_scale;
  1863. Wgb = Wmb = Web = Wdb = weight_scale;
  1864. }
  1865. Wg /= weight_scale;
  1866. Wm /= weight_scale;
  1867. We /= weight_scale;
  1868. Wd /= weight_scale;
  1869. Wgb /= weight_scale;
  1870. Wmb /= weight_scale;
  1871. Web /= weight_scale;
  1872. Wdb /= weight_scale;
  1873. bandwidths = tor_calloc(smartlist_len(sl), sizeof(u64_dbl_t));
  1874. // Cycle through smartlist and total the bandwidth.
  1875. static int warned_missing_bw = 0;
  1876. SMARTLIST_FOREACH_BEGIN(sl, const node_t *, node) {
  1877. int is_exit = 0, is_guard = 0, is_dir = 0, this_bw = 0;
  1878. double weight = 1;
  1879. double weight_without_guard_flag = 0; /* Used for guardfraction */
  1880. double final_weight = 0;
  1881. is_exit = node->is_exit && ! node->is_bad_exit;
  1882. is_guard = node->is_possible_guard;
  1883. is_dir = node_is_dir(node);
  1884. if (node->rs) {
  1885. if (!node->rs->has_bandwidth) {
  1886. /* This should never happen, unless all the authorites downgrade
  1887. * to 0.2.0 or rogue routerstatuses get inserted into our consensus. */
  1888. if (! warned_missing_bw) {
  1889. log_warn(LD_BUG,
  1890. "Consensus is missing some bandwidths. Using a naive "
  1891. "router selection algorithm");
  1892. warned_missing_bw = 1;
  1893. }
  1894. this_bw = 30000; /* Chosen arbitrarily */
  1895. } else {
  1896. this_bw = kb_to_bytes(node->rs->bandwidth_kb);
  1897. }
  1898. } else if (node->ri) {
  1899. /* bridge or other descriptor not in our consensus */
  1900. this_bw = bridge_get_advertised_bandwidth_bounded(node->ri);
  1901. } else {
  1902. /* We can't use this one. */
  1903. continue;
  1904. }
  1905. if (is_guard && is_exit) {
  1906. weight = (is_dir ? Wdb*Wd : Wd);
  1907. weight_without_guard_flag = (is_dir ? Web*We : We);
  1908. } else if (is_guard) {
  1909. weight = (is_dir ? Wgb*Wg : Wg);
  1910. weight_without_guard_flag = (is_dir ? Wmb*Wm : Wm);
  1911. } else if (is_exit) {
  1912. weight = (is_dir ? Web*We : We);
  1913. } else { // middle
  1914. weight = (is_dir ? Wmb*Wm : Wm);
  1915. }
  1916. /* These should be impossible; but overflows here would be bad, so let's
  1917. * make sure. */
  1918. if (this_bw < 0)
  1919. this_bw = 0;
  1920. if (weight < 0.0)
  1921. weight = 0.0;
  1922. if (weight_without_guard_flag < 0.0)
  1923. weight_without_guard_flag = 0.0;
  1924. /* If guardfraction information is available in the consensus, we
  1925. * want to calculate this router's bandwidth according to its
  1926. * guardfraction. Quoting from proposal236:
  1927. *
  1928. * Let Wpf denote the weight from the 'bandwidth-weights' line a
  1929. * client would apply to N for position p if it had the guard
  1930. * flag, Wpn the weight if it did not have the guard flag, and B the
  1931. * measured bandwidth of N in the consensus. Then instead of choosing
  1932. * N for position p proportionally to Wpf*B or Wpn*B, clients should
  1933. * choose N proportionally to F*Wpf*B + (1-F)*Wpn*B.
  1934. */
  1935. if (node->rs && node->rs->has_guardfraction && rule != WEIGHT_FOR_GUARD) {
  1936. /* XXX The assert should actually check for is_guard. However,
  1937. * that crashes dirauths because of #13297. This should be
  1938. * equivalent: */
  1939. tor_assert(node->rs->is_possible_guard);
  1940. guard_get_guardfraction_bandwidth(&guardfraction_bw,
  1941. this_bw,
  1942. node->rs->guardfraction_percentage);
  1943. /* Calculate final_weight = F*Wpf*B + (1-F)*Wpn*B */
  1944. final_weight =
  1945. guardfraction_bw.guard_bw * weight +
  1946. guardfraction_bw.non_guard_bw * weight_without_guard_flag;
  1947. log_debug(LD_GENERAL, "%s: Guardfraction weight %f instead of %f (%s)",
  1948. node->rs->nickname, final_weight, weight*this_bw,
  1949. bandwidth_weight_rule_to_string(rule));
  1950. } else { /* no guardfraction information. calculate the weight normally. */
  1951. final_weight = weight*this_bw;
  1952. }
  1953. bandwidths[node_sl_idx].dbl = final_weight + 0.5;
  1954. } SMARTLIST_FOREACH_END(node);
  1955. log_debug(LD_CIRC, "Generated weighted bandwidths for rule %s based "
  1956. "on weights "
  1957. "Wg=%f Wm=%f We=%f Wd=%f with total bw "U64_FORMAT,
  1958. bandwidth_weight_rule_to_string(rule),
  1959. Wg, Wm, We, Wd, U64_PRINTF_ARG(weighted_bw));
  1960. *bandwidths_out = bandwidths;
  1961. return 0;
  1962. }
  1963. /** For all nodes in <b>sl</b>, return the fraction of those nodes, weighted
  1964. * by their weighted bandwidths with rule <b>rule</b>, for which we have
  1965. * descriptors. */
  1966. double
  1967. frac_nodes_with_descriptors(const smartlist_t *sl,
  1968. bandwidth_weight_rule_t rule)
  1969. {
  1970. u64_dbl_t *bandwidths = NULL;
  1971. double total, present;
  1972. if (smartlist_len(sl) == 0)
  1973. return 0.0;
  1974. if (compute_weighted_bandwidths(sl, rule, &bandwidths) < 0) {
  1975. int n_with_descs = 0;
  1976. SMARTLIST_FOREACH(sl, const node_t *, node, {
  1977. if (node_has_descriptor(node))
  1978. n_with_descs++;
  1979. });
  1980. return ((double)n_with_descs) / (double)smartlist_len(sl);
  1981. }
  1982. total = present = 0.0;
  1983. SMARTLIST_FOREACH_BEGIN(sl, const node_t *, node) {
  1984. const double bw = bandwidths[node_sl_idx].dbl;
  1985. total += bw;
  1986. if (node_has_descriptor(node))
  1987. present += bw;
  1988. } SMARTLIST_FOREACH_END(node);
  1989. tor_free(bandwidths);
  1990. if (total < 1.0)
  1991. return 0;
  1992. return present / total;
  1993. }
  1994. /** Choose a random element of status list <b>sl</b>, weighted by
  1995. * the advertised bandwidth of each node */
  1996. const node_t *
  1997. node_sl_choose_by_bandwidth(const smartlist_t *sl,
  1998. bandwidth_weight_rule_t rule)
  1999. { /*XXXX MOVE */
  2000. return smartlist_choose_node_by_bandwidth_weights(sl, rule);
  2001. }
  2002. /** Return a random running node from the nodelist. Never
  2003. * pick a node that is in
  2004. * <b>excludedsmartlist</b>, or which matches <b>excludedset</b>,
  2005. * even if they are the only nodes available.
  2006. * If <b>CRN_NEED_UPTIME</b> is set in flags and any router has more than
  2007. * a minimum uptime, return one of those.
  2008. * If <b>CRN_NEED_CAPACITY</b> is set in flags, weight your choice by the
  2009. * advertised capacity of each router.
  2010. * If <b>CRN_ALLOW_INVALID</b> is not set in flags, consider only Valid
  2011. * routers.
  2012. * If <b>CRN_NEED_GUARD</b> is set in flags, consider only Guard routers.
  2013. * If <b>CRN_WEIGHT_AS_EXIT</b> is set in flags, we weight bandwidths as if
  2014. * picking an exit node, otherwise we weight bandwidths for picking a relay
  2015. * node (that is, possibly discounting exit nodes).
  2016. * If <b>CRN_NEED_DESC</b> is set in flags, we only consider nodes that
  2017. * have a routerinfo or microdescriptor -- that is, enough info to be
  2018. * used to build a circuit.
  2019. */
  2020. const node_t *
  2021. router_choose_random_node(smartlist_t *excludedsmartlist,
  2022. routerset_t *excludedset,
  2023. router_crn_flags_t flags)
  2024. { /* XXXX MOVE */
  2025. const int need_uptime = (flags & CRN_NEED_UPTIME) != 0;
  2026. const int need_capacity = (flags & CRN_NEED_CAPACITY) != 0;
  2027. const int need_guard = (flags & CRN_NEED_GUARD) != 0;
  2028. const int allow_invalid = (flags & CRN_ALLOW_INVALID) != 0;
  2029. const int weight_for_exit = (flags & CRN_WEIGHT_AS_EXIT) != 0;
  2030. const int need_desc = (flags & CRN_NEED_DESC) != 0;
  2031. smartlist_t *sl=smartlist_new(),
  2032. *excludednodes=smartlist_new();
  2033. const node_t *choice = NULL;
  2034. const routerinfo_t *r;
  2035. bandwidth_weight_rule_t rule;
  2036. tor_assert(!(weight_for_exit && need_guard));
  2037. rule = weight_for_exit ? WEIGHT_FOR_EXIT :
  2038. (need_guard ? WEIGHT_FOR_GUARD : WEIGHT_FOR_MID);
  2039. /* Exclude relays that allow single hop exit circuits, if the user
  2040. * wants to (such relays might be risky) */
  2041. if (get_options()->ExcludeSingleHopRelays) {
  2042. SMARTLIST_FOREACH(nodelist_get_list(), node_t *, node,
  2043. if (node_allows_single_hop_exits(node)) {
  2044. smartlist_add(excludednodes, node);
  2045. });
  2046. }
  2047. if ((r = routerlist_find_my_routerinfo()))
  2048. routerlist_add_node_and_family(excludednodes, r);
  2049. router_add_running_nodes_to_smartlist(sl, allow_invalid,
  2050. need_uptime, need_capacity,
  2051. need_guard, need_desc);
  2052. log_debug(LD_CIRC,
  2053. "We found %d running nodes.",
  2054. smartlist_len(sl));
  2055. smartlist_subtract(sl,excludednodes);
  2056. log_debug(LD_CIRC,
  2057. "We removed %d excludednodes, leaving %d nodes.",
  2058. smartlist_len(excludednodes),
  2059. smartlist_len(sl));
  2060. if (excludedsmartlist) {
  2061. smartlist_subtract(sl,excludedsmartlist);
  2062. log_debug(LD_CIRC,
  2063. "We removed %d excludedsmartlist, leaving %d nodes.",
  2064. smartlist_len(excludedsmartlist),
  2065. smartlist_len(sl));
  2066. }
  2067. if (excludedset) {
  2068. routerset_subtract_nodes(sl,excludedset);
  2069. log_debug(LD_CIRC,
  2070. "We removed excludedset, leaving %d nodes.",
  2071. smartlist_len(sl));
  2072. }
  2073. // Always weight by bandwidth
  2074. choice = node_sl_choose_by_bandwidth(sl, rule);
  2075. smartlist_free(sl);
  2076. if (!choice && (need_uptime || need_capacity || need_guard)) {
  2077. /* try once more -- recurse but with fewer restrictions. */
  2078. log_info(LD_CIRC,
  2079. "We couldn't find any live%s%s%s routers; falling back "
  2080. "to list of all routers.",
  2081. need_capacity?", fast":"",
  2082. need_uptime?", stable":"",
  2083. need_guard?", guard":"");
  2084. flags &= ~ (CRN_NEED_UPTIME|CRN_NEED_CAPACITY|CRN_NEED_GUARD);
  2085. choice = router_choose_random_node(
  2086. excludedsmartlist, excludedset, flags);
  2087. }
  2088. smartlist_free(excludednodes);
  2089. if (!choice) {
  2090. log_warn(LD_CIRC,
  2091. "No available nodes when trying to choose node. Failing.");
  2092. }
  2093. return choice;
  2094. }
  2095. /** Helper: given an extended nickname in <b>hexdigest</b> try to decode it.
  2096. * Return 0 on success, -1 on failure. Store the result into the
  2097. * DIGEST_LEN-byte buffer at <b>digest_out</b>, the single character at
  2098. * <b>nickname_qualifier_char_out</b>, and the MAXNICKNAME_LEN+1-byte buffer
  2099. * at <b>nickname_out</b>.
  2100. *
  2101. * The recognized format is:
  2102. * HexName = Dollar? HexDigest NamePart?
  2103. * Dollar = '?'
  2104. * HexDigest = HexChar*20
  2105. * HexChar = 'a'..'f' | 'A'..'F' | '0'..'9'
  2106. * NamePart = QualChar Name
  2107. * QualChar = '=' | '~'
  2108. * Name = NameChar*(1..MAX_NICKNAME_LEN)
  2109. * NameChar = Any ASCII alphanumeric character
  2110. */
  2111. int
  2112. hex_digest_nickname_decode(const char *hexdigest,
  2113. char *digest_out,
  2114. char *nickname_qualifier_char_out,
  2115. char *nickname_out)
  2116. {
  2117. size_t len;
  2118. tor_assert(hexdigest);
  2119. if (hexdigest[0] == '$')
  2120. ++hexdigest;
  2121. len = strlen(hexdigest);
  2122. if (len < HEX_DIGEST_LEN) {
  2123. return -1;
  2124. } else if (len > HEX_DIGEST_LEN && (hexdigest[HEX_DIGEST_LEN] == '=' ||
  2125. hexdigest[HEX_DIGEST_LEN] == '~') &&
  2126. len <= HEX_DIGEST_LEN+1+MAX_NICKNAME_LEN) {
  2127. *nickname_qualifier_char_out = hexdigest[HEX_DIGEST_LEN];
  2128. strlcpy(nickname_out, hexdigest+HEX_DIGEST_LEN+1 , MAX_NICKNAME_LEN+1);
  2129. } else if (len == HEX_DIGEST_LEN) {
  2130. ;
  2131. } else {
  2132. return -1;
  2133. }
  2134. if (base16_decode(digest_out, DIGEST_LEN, hexdigest, HEX_DIGEST_LEN)<0)
  2135. return -1;
  2136. return 0;
  2137. }
  2138. /** Helper: Return true iff the <b>identity_digest</b> and <b>nickname</b>
  2139. * combination of a router, encoded in hexadecimal, matches <b>hexdigest</b>
  2140. * (which is optionally prefixed with a single dollar sign). Return false if
  2141. * <b>hexdigest</b> is malformed, or it doesn't match. */
  2142. int
  2143. hex_digest_nickname_matches(const char *hexdigest, const char *identity_digest,
  2144. const char *nickname, int is_named)
  2145. {
  2146. char digest[DIGEST_LEN];
  2147. char nn_char='\0';
  2148. char nn_buf[MAX_NICKNAME_LEN+1];
  2149. if (hex_digest_nickname_decode(hexdigest, digest, &nn_char, nn_buf) == -1)
  2150. return 0;
  2151. if (nn_char == '=' || nn_char == '~') {
  2152. if (!nickname)
  2153. return 0;
  2154. if (strcasecmp(nn_buf, nickname))
  2155. return 0;
  2156. if (nn_char == '=' && !is_named)
  2157. return 0;
  2158. }
  2159. return tor_memeq(digest, identity_digest, DIGEST_LEN);
  2160. }
  2161. /** Return true iff <b>router</b> is listed as named in the current
  2162. * consensus. */
  2163. int
  2164. router_is_named(const routerinfo_t *router)
  2165. {
  2166. const char *digest =
  2167. networkstatus_get_router_digest_by_nickname(router->nickname);
  2168. return (digest &&
  2169. tor_memeq(digest, router->cache_info.identity_digest, DIGEST_LEN));
  2170. }
  2171. /** Return true iff <b>digest</b> is the digest of the identity key of a
  2172. * trusted directory matching at least one bit of <b>type</b>. If <b>type</b>
  2173. * is zero (NO_DIRINFO), or ALL_DIRINFO, any authority is okay. */
  2174. int
  2175. router_digest_is_trusted_dir_type(const char *digest, dirinfo_type_t type)
  2176. {
  2177. if (!trusted_dir_servers)
  2178. return 0;
  2179. if (authdir_mode(get_options()) && router_digest_is_me(digest))
  2180. return 1;
  2181. SMARTLIST_FOREACH(trusted_dir_servers, dir_server_t *, ent,
  2182. if (tor_memeq(digest, ent->digest, DIGEST_LEN)) {
  2183. return (!type) || ((type & ent->type) != 0);
  2184. });
  2185. return 0;
  2186. }
  2187. /** Return true iff <b>addr</b> is the address of one of our trusted
  2188. * directory authorities. */
  2189. int
  2190. router_addr_is_trusted_dir(uint32_t addr)
  2191. {
  2192. if (!trusted_dir_servers)
  2193. return 0;
  2194. SMARTLIST_FOREACH(trusted_dir_servers, dir_server_t *, ent,
  2195. if (ent->addr == addr)
  2196. return 1;
  2197. );
  2198. return 0;
  2199. }
  2200. /** If hexdigest is correctly formed, base16_decode it into
  2201. * digest, which must have DIGEST_LEN space in it.
  2202. * Return 0 on success, -1 on failure.
  2203. */
  2204. int
  2205. hexdigest_to_digest(const char *hexdigest, char *digest)
  2206. {
  2207. if (hexdigest[0]=='$')
  2208. ++hexdigest;
  2209. if (strlen(hexdigest) < HEX_DIGEST_LEN ||
  2210. base16_decode(digest,DIGEST_LEN,hexdigest,HEX_DIGEST_LEN) < 0)
  2211. return -1;
  2212. return 0;
  2213. }
  2214. /** As router_get_by_id_digest,but return a pointer that you're allowed to
  2215. * modify */
  2216. routerinfo_t *
  2217. router_get_mutable_by_digest(const char *digest)
  2218. {
  2219. tor_assert(digest);
  2220. if (!routerlist) return NULL;
  2221. // routerlist_assert_ok(routerlist);
  2222. return rimap_get(routerlist->identity_map, digest);
  2223. }
  2224. /** Return the router in our routerlist whose 20-byte key digest
  2225. * is <b>digest</b>. Return NULL if no such router is known. */
  2226. const routerinfo_t *
  2227. router_get_by_id_digest(const char *digest)
  2228. {
  2229. return router_get_mutable_by_digest(digest);
  2230. }
  2231. /** Return the router in our routerlist whose 20-byte descriptor
  2232. * is <b>digest</b>. Return NULL if no such router is known. */
  2233. signed_descriptor_t *
  2234. router_get_by_descriptor_digest(const char *digest)
  2235. {
  2236. tor_assert(digest);
  2237. if (!routerlist) return NULL;
  2238. return sdmap_get(routerlist->desc_digest_map, digest);
  2239. }
  2240. /** Return the signed descriptor for the router in our routerlist whose
  2241. * 20-byte extra-info digest is <b>digest</b>. Return NULL if no such router
  2242. * is known. */
  2243. MOCK_IMPL(signed_descriptor_t *,
  2244. router_get_by_extrainfo_digest,(const char *digest))
  2245. {
  2246. tor_assert(digest);
  2247. if (!routerlist) return NULL;
  2248. return sdmap_get(routerlist->desc_by_eid_map, digest);
  2249. }
  2250. /** Return the signed descriptor for the extrainfo_t in our routerlist whose
  2251. * extra-info-digest is <b>digest</b>. Return NULL if no such extra-info
  2252. * document is known. */
  2253. signed_descriptor_t *
  2254. extrainfo_get_by_descriptor_digest(const char *digest)
  2255. {
  2256. extrainfo_t *ei;
  2257. tor_assert(digest);
  2258. if (!routerlist) return NULL;
  2259. ei = eimap_get(routerlist->extra_info_map, digest);
  2260. return ei ? &ei->cache_info : NULL;
  2261. }
  2262. /** Return a pointer to the signed textual representation of a descriptor.
  2263. * The returned string is not guaranteed to be NUL-terminated: the string's
  2264. * length will be in desc-\>signed_descriptor_len.
  2265. *
  2266. * If <b>with_annotations</b> is set, the returned string will include
  2267. * the annotations
  2268. * (if any) preceding the descriptor. This will increase the length of the
  2269. * string by desc-\>annotations_len.
  2270. *
  2271. * The caller must not free the string returned.
  2272. */
  2273. static const char *
  2274. signed_descriptor_get_body_impl(const signed_descriptor_t *desc,
  2275. int with_annotations)
  2276. {
  2277. const char *r = NULL;
  2278. size_t len = desc->signed_descriptor_len;
  2279. off_t offset = desc->saved_offset;
  2280. if (with_annotations)
  2281. len += desc->annotations_len;
  2282. else
  2283. offset += desc->annotations_len;
  2284. tor_assert(len > 32);
  2285. if (desc->saved_location == SAVED_IN_CACHE && routerlist) {
  2286. desc_store_t *store = desc_get_store(router_get_routerlist(), desc);
  2287. if (store && store->mmap) {
  2288. tor_assert(desc->saved_offset + len <= store->mmap->size);
  2289. r = store->mmap->data + offset;
  2290. } else if (store) {
  2291. log_err(LD_DIR, "We couldn't read a descriptor that is supposedly "
  2292. "mmaped in our cache. Is another process running in our data "
  2293. "directory? Exiting.");
  2294. exit(1);
  2295. }
  2296. }
  2297. if (!r) /* no mmap, or not in cache. */
  2298. r = desc->signed_descriptor_body +
  2299. (with_annotations ? 0 : desc->annotations_len);
  2300. tor_assert(r);
  2301. if (!with_annotations) {
  2302. if (fast_memcmp("router ", r, 7) && fast_memcmp("extra-info ", r, 11)) {
  2303. char *cp = tor_strndup(r, 64);
  2304. log_err(LD_DIR, "descriptor at %p begins with unexpected string %s. "
  2305. "Is another process running in our data directory? Exiting.",
  2306. desc, escaped(cp));
  2307. exit(1);
  2308. }
  2309. }
  2310. return r;
  2311. }
  2312. /** Return a pointer to the signed textual representation of a descriptor.
  2313. * The returned string is not guaranteed to be NUL-terminated: the string's
  2314. * length will be in desc-\>signed_descriptor_len.
  2315. *
  2316. * The caller must not free the string returned.
  2317. */
  2318. const char *
  2319. signed_descriptor_get_body(const signed_descriptor_t *desc)
  2320. {
  2321. return signed_descriptor_get_body_impl(desc, 0);
  2322. }
  2323. /** As signed_descriptor_get_body(), but points to the beginning of the
  2324. * annotations section rather than the beginning of the descriptor. */
  2325. const char *
  2326. signed_descriptor_get_annotations(const signed_descriptor_t *desc)
  2327. {
  2328. return signed_descriptor_get_body_impl(desc, 1);
  2329. }
  2330. /** Return the current list of all known routers. */
  2331. routerlist_t *
  2332. router_get_routerlist(void)
  2333. {
  2334. if (PREDICT_UNLIKELY(!routerlist)) {
  2335. routerlist = tor_malloc_zero(sizeof(routerlist_t));
  2336. routerlist->routers = smartlist_new();
  2337. routerlist->old_routers = smartlist_new();
  2338. routerlist->identity_map = rimap_new();
  2339. routerlist->desc_digest_map = sdmap_new();
  2340. routerlist->desc_by_eid_map = sdmap_new();
  2341. routerlist->extra_info_map = eimap_new();
  2342. routerlist->desc_store.fname_base = "cached-descriptors";
  2343. routerlist->extrainfo_store.fname_base = "cached-extrainfo";
  2344. routerlist->desc_store.type = ROUTER_STORE;
  2345. routerlist->extrainfo_store.type = EXTRAINFO_STORE;
  2346. routerlist->desc_store.description = "router descriptors";
  2347. routerlist->extrainfo_store.description = "extra-info documents";
  2348. }
  2349. return routerlist;
  2350. }
  2351. /** Free all storage held by <b>router</b>. */
  2352. void
  2353. routerinfo_free(routerinfo_t *router)
  2354. {
  2355. if (!router)
  2356. return;
  2357. tor_free(router->cache_info.signed_descriptor_body);
  2358. tor_free(router->nickname);
  2359. tor_free(router->platform);
  2360. tor_free(router->contact_info);
  2361. if (router->onion_pkey)
  2362. crypto_pk_free(router->onion_pkey);
  2363. tor_free(router->onion_curve25519_pkey);
  2364. if (router->identity_pkey)
  2365. crypto_pk_free(router->identity_pkey);
  2366. tor_cert_free(router->signing_key_cert);
  2367. if (router->declared_family) {
  2368. SMARTLIST_FOREACH(router->declared_family, char *, s, tor_free(s));
  2369. smartlist_free(router->declared_family);
  2370. }
  2371. addr_policy_list_free(router->exit_policy);
  2372. short_policy_free(router->ipv6_exit_policy);
  2373. memset(router, 77, sizeof(routerinfo_t));
  2374. tor_free(router);
  2375. }
  2376. /** Release all storage held by <b>extrainfo</b> */
  2377. void
  2378. extrainfo_free(extrainfo_t *extrainfo)
  2379. {
  2380. if (!extrainfo)
  2381. return;
  2382. tor_cert_free(extrainfo->signing_key_cert);
  2383. tor_free(extrainfo->cache_info.signed_descriptor_body);
  2384. tor_free(extrainfo->pending_sig);
  2385. memset(extrainfo, 88, sizeof(extrainfo_t)); /* debug bad memory usage */
  2386. tor_free(extrainfo);
  2387. }
  2388. /** Release storage held by <b>sd</b>. */
  2389. static void
  2390. signed_descriptor_free(signed_descriptor_t *sd)
  2391. {
  2392. if (!sd)
  2393. return;
  2394. tor_free(sd->signed_descriptor_body);
  2395. memset(sd, 99, sizeof(signed_descriptor_t)); /* Debug bad mem usage */
  2396. tor_free(sd);
  2397. }
  2398. /** Extract a signed_descriptor_t from a general routerinfo, and free the
  2399. * routerinfo.
  2400. */
  2401. static signed_descriptor_t *
  2402. signed_descriptor_from_routerinfo(routerinfo_t *ri)
  2403. {
  2404. signed_descriptor_t *sd;
  2405. tor_assert(ri->purpose == ROUTER_PURPOSE_GENERAL);
  2406. sd = tor_malloc_zero(sizeof(signed_descriptor_t));
  2407. memcpy(sd, &(ri->cache_info), sizeof(signed_descriptor_t));
  2408. sd->routerlist_index = -1;
  2409. ri->cache_info.signed_descriptor_body = NULL;
  2410. routerinfo_free(ri);
  2411. return sd;
  2412. }
  2413. /** Helper: free the storage held by the extrainfo_t in <b>e</b>. */
  2414. static void
  2415. extrainfo_free_(void *e)
  2416. {
  2417. extrainfo_free(e);
  2418. }
  2419. /** Free all storage held by a routerlist <b>rl</b>. */
  2420. void
  2421. routerlist_free(routerlist_t *rl)
  2422. {
  2423. if (!rl)
  2424. return;
  2425. rimap_free(rl->identity_map, NULL);
  2426. sdmap_free(rl->desc_digest_map, NULL);
  2427. sdmap_free(rl->desc_by_eid_map, NULL);
  2428. eimap_free(rl->extra_info_map, extrainfo_free_);
  2429. SMARTLIST_FOREACH(rl->routers, routerinfo_t *, r,
  2430. routerinfo_free(r));
  2431. SMARTLIST_FOREACH(rl->old_routers, signed_descriptor_t *, sd,
  2432. signed_descriptor_free(sd));
  2433. smartlist_free(rl->routers);
  2434. smartlist_free(rl->old_routers);
  2435. if (rl->desc_store.mmap) {
  2436. int res = tor_munmap_file(routerlist->desc_store.mmap);
  2437. if (res != 0) {
  2438. log_warn(LD_FS, "Failed to munmap routerlist->desc_store.mmap");
  2439. }
  2440. }
  2441. if (rl->extrainfo_store.mmap) {
  2442. int res = tor_munmap_file(routerlist->extrainfo_store.mmap);
  2443. if (res != 0) {
  2444. log_warn(LD_FS, "Failed to munmap routerlist->extrainfo_store.mmap");
  2445. }
  2446. }
  2447. tor_free(rl);
  2448. router_dir_info_changed();
  2449. }
  2450. /** Log information about how much memory is being used for routerlist,
  2451. * at log level <b>severity</b>. */
  2452. void
  2453. dump_routerlist_mem_usage(int severity)
  2454. {
  2455. uint64_t livedescs = 0;
  2456. uint64_t olddescs = 0;
  2457. if (!routerlist)
  2458. return;
  2459. SMARTLIST_FOREACH(routerlist->routers, routerinfo_t *, r,
  2460. livedescs += r->cache_info.signed_descriptor_len);
  2461. SMARTLIST_FOREACH(routerlist->old_routers, signed_descriptor_t *, sd,
  2462. olddescs += sd->signed_descriptor_len);
  2463. tor_log(severity, LD_DIR,
  2464. "In %d live descriptors: "U64_FORMAT" bytes. "
  2465. "In %d old descriptors: "U64_FORMAT" bytes.",
  2466. smartlist_len(routerlist->routers), U64_PRINTF_ARG(livedescs),
  2467. smartlist_len(routerlist->old_routers), U64_PRINTF_ARG(olddescs));
  2468. }
  2469. /** Debugging helper: If <b>idx</b> is nonnegative, assert that <b>ri</b> is
  2470. * in <b>sl</b> at position <b>idx</b>. Otherwise, search <b>sl</b> for
  2471. * <b>ri</b>. Return the index of <b>ri</b> in <b>sl</b>, or -1 if <b>ri</b>
  2472. * is not in <b>sl</b>. */
  2473. static INLINE int
  2474. routerlist_find_elt_(smartlist_t *sl, void *ri, int idx)
  2475. {
  2476. if (idx < 0) {
  2477. idx = -1;
  2478. SMARTLIST_FOREACH(sl, routerinfo_t *, r,
  2479. if (r == ri) {
  2480. idx = r_sl_idx;
  2481. break;
  2482. });
  2483. } else {
  2484. tor_assert(idx < smartlist_len(sl));
  2485. tor_assert(smartlist_get(sl, idx) == ri);
  2486. };
  2487. return idx;
  2488. }
  2489. /** Insert an item <b>ri</b> into the routerlist <b>rl</b>, updating indices
  2490. * as needed. There must be no previous member of <b>rl</b> with the same
  2491. * identity digest as <b>ri</b>: If there is, call routerlist_replace
  2492. * instead.
  2493. */
  2494. static void
  2495. routerlist_insert(routerlist_t *rl, routerinfo_t *ri)
  2496. {
  2497. routerinfo_t *ri_old;
  2498. signed_descriptor_t *sd_old;
  2499. {
  2500. const routerinfo_t *ri_generated = router_get_my_routerinfo();
  2501. tor_assert(ri_generated != ri);
  2502. }
  2503. tor_assert(ri->cache_info.routerlist_index == -1);
  2504. ri_old = rimap_set(rl->identity_map, ri->cache_info.identity_digest, ri);
  2505. tor_assert(!ri_old);
  2506. sd_old = sdmap_set(rl->desc_digest_map,
  2507. ri->cache_info.signed_descriptor_digest,
  2508. &(ri->cache_info));
  2509. if (sd_old) {
  2510. int idx = sd_old->routerlist_index;
  2511. sd_old->routerlist_index = -1;
  2512. smartlist_del(rl->old_routers, idx);
  2513. if (idx < smartlist_len(rl->old_routers)) {
  2514. signed_descriptor_t *d = smartlist_get(rl->old_routers, idx);
  2515. d->routerlist_index = idx;
  2516. }
  2517. rl->desc_store.bytes_dropped += sd_old->signed_descriptor_len;
  2518. sdmap_remove(rl->desc_by_eid_map, sd_old->extra_info_digest);
  2519. signed_descriptor_free(sd_old);
  2520. }
  2521. if (!tor_digest_is_zero(ri->cache_info.extra_info_digest))
  2522. sdmap_set(rl->desc_by_eid_map, ri->cache_info.extra_info_digest,
  2523. &ri->cache_info);
  2524. smartlist_add(rl->routers, ri);
  2525. ri->cache_info.routerlist_index = smartlist_len(rl->routers) - 1;
  2526. nodelist_set_routerinfo(ri, NULL);
  2527. router_dir_info_changed();
  2528. #ifdef DEBUG_ROUTERLIST
  2529. routerlist_assert_ok(rl);
  2530. #endif
  2531. }
  2532. /** Adds the extrainfo_t <b>ei</b> to the routerlist <b>rl</b>, if there is a
  2533. * corresponding router in rl-\>routers or rl-\>old_routers. Return the status
  2534. * of inserting <b>ei</b>. Free <b>ei</b> if it isn't inserted. */
  2535. MOCK_IMPL(STATIC was_router_added_t,
  2536. extrainfo_insert,(routerlist_t *rl, extrainfo_t *ei, int warn_if_incompatible))
  2537. {
  2538. was_router_added_t r;
  2539. const char *compatibility_error_msg;
  2540. routerinfo_t *ri = rimap_get(rl->identity_map,
  2541. ei->cache_info.identity_digest);
  2542. signed_descriptor_t *sd =
  2543. sdmap_get(rl->desc_by_eid_map, ei->cache_info.signed_descriptor_digest);
  2544. extrainfo_t *ei_tmp;
  2545. const int severity = warn_if_incompatible ? LOG_WARN : LOG_INFO;
  2546. {
  2547. extrainfo_t *ei_generated = router_get_my_extrainfo();
  2548. tor_assert(ei_generated != ei);
  2549. }
  2550. if (!ri) {
  2551. /* This router is unknown; we can't even verify the signature. Give up.*/
  2552. r = ROUTER_NOT_IN_CONSENSUS;
  2553. goto done;
  2554. }
  2555. if (! sd) {
  2556. /* The extrainfo router doesn't have a known routerdesc to attach it to.
  2557. * This just won't work. */;
  2558. static ratelim_t no_sd_ratelim = RATELIM_INIT(1800);
  2559. r = ROUTER_BAD_EI;
  2560. log_fn_ratelim(&no_sd_ratelim, severity, LD_BUG,
  2561. "No entry found in extrainfo map.");
  2562. goto done;
  2563. }
  2564. if (tor_memneq(ei->cache_info.signed_descriptor_digest,
  2565. sd->extra_info_digest, DIGEST_LEN)) {
  2566. static ratelim_t digest_mismatch_ratelim = RATELIM_INIT(1800);
  2567. /* The sd we got from the map doesn't match the digest we used to look
  2568. * it up. This makes no sense. */
  2569. r = ROUTER_BAD_EI;
  2570. log_fn_ratelim(&digest_mismatch_ratelim, severity, LD_BUG,
  2571. "Mismatch in digest in extrainfo map.");
  2572. goto done;
  2573. }
  2574. if (routerinfo_incompatible_with_extrainfo(ri, ei, sd,
  2575. &compatibility_error_msg)) {
  2576. char d1[HEX_DIGEST_LEN+1], d2[HEX_DIGEST_LEN+1];
  2577. r = (ri->cache_info.extrainfo_is_bogus) ?
  2578. ROUTER_BAD_EI : ROUTER_NOT_IN_CONSENSUS;
  2579. base16_encode(d1, sizeof(d1), ri->cache_info.identity_digest, DIGEST_LEN);
  2580. base16_encode(d2, sizeof(d2), ei->cache_info.identity_digest, DIGEST_LEN);
  2581. log_fn(severity,LD_DIR,
  2582. "router info incompatible with extra info (ri id: %s, ei id %s, "
  2583. "reason: %s)", d1, d2, compatibility_error_msg);
  2584. goto done;
  2585. }
  2586. /* Okay, if we make it here, we definitely have a router corresponding to
  2587. * this extrainfo. */
  2588. ei_tmp = eimap_set(rl->extra_info_map,
  2589. ei->cache_info.signed_descriptor_digest,
  2590. ei);
  2591. r = ROUTER_ADDED_SUCCESSFULLY;
  2592. if (ei_tmp) {
  2593. rl->extrainfo_store.bytes_dropped +=
  2594. ei_tmp->cache_info.signed_descriptor_len;
  2595. extrainfo_free(ei_tmp);
  2596. }
  2597. done:
  2598. if (r != ROUTER_ADDED_SUCCESSFULLY)
  2599. extrainfo_free(ei);
  2600. #ifdef DEBUG_ROUTERLIST
  2601. routerlist_assert_ok(rl);
  2602. #endif
  2603. return r;
  2604. }
  2605. #define should_cache_old_descriptors() \
  2606. directory_caches_dir_info(get_options())
  2607. /** If we're a directory cache and routerlist <b>rl</b> doesn't have
  2608. * a copy of router <b>ri</b> yet, add it to the list of old (not
  2609. * recommended but still served) descriptors. Else free it. */
  2610. static void
  2611. routerlist_insert_old(routerlist_t *rl, routerinfo_t *ri)
  2612. {
  2613. {
  2614. const routerinfo_t *ri_generated = router_get_my_routerinfo();
  2615. tor_assert(ri_generated != ri);
  2616. }
  2617. tor_assert(ri->cache_info.routerlist_index == -1);
  2618. if (should_cache_old_descriptors() &&
  2619. ri->purpose == ROUTER_PURPOSE_GENERAL &&
  2620. !sdmap_get(rl->desc_digest_map,
  2621. ri->cache_info.signed_descriptor_digest)) {
  2622. signed_descriptor_t *sd = signed_descriptor_from_routerinfo(ri);
  2623. sdmap_set(rl->desc_digest_map, sd->signed_descriptor_digest, sd);
  2624. smartlist_add(rl->old_routers, sd);
  2625. sd->routerlist_index = smartlist_len(rl->old_routers)-1;
  2626. if (!tor_digest_is_zero(sd->extra_info_digest))
  2627. sdmap_set(rl->desc_by_eid_map, sd->extra_info_digest, sd);
  2628. } else {
  2629. routerinfo_free(ri);
  2630. }
  2631. #ifdef DEBUG_ROUTERLIST
  2632. routerlist_assert_ok(rl);
  2633. #endif
  2634. }
  2635. /** Remove an item <b>ri</b> from the routerlist <b>rl</b>, updating indices
  2636. * as needed. If <b>idx</b> is nonnegative and smartlist_get(rl-&gt;routers,
  2637. * idx) == ri, we don't need to do a linear search over the list to decide
  2638. * which to remove. We fill the gap in rl-&gt;routers with a later element in
  2639. * the list, if any exists. <b>ri</b> is freed.
  2640. *
  2641. * If <b>make_old</b> is true, instead of deleting the router, we try adding
  2642. * it to rl-&gt;old_routers. */
  2643. void
  2644. routerlist_remove(routerlist_t *rl, routerinfo_t *ri, int make_old, time_t now)
  2645. {
  2646. routerinfo_t *ri_tmp;
  2647. extrainfo_t *ei_tmp;
  2648. int idx = ri->cache_info.routerlist_index;
  2649. tor_assert(0 <= idx && idx < smartlist_len(rl->routers));
  2650. tor_assert(smartlist_get(rl->routers, idx) == ri);
  2651. nodelist_remove_routerinfo(ri);
  2652. /* make sure the rephist module knows that it's not running */
  2653. rep_hist_note_router_unreachable(ri->cache_info.identity_digest, now);
  2654. ri->cache_info.routerlist_index = -1;
  2655. smartlist_del(rl->routers, idx);
  2656. if (idx < smartlist_len(rl->routers)) {
  2657. routerinfo_t *r = smartlist_get(rl->routers, idx);
  2658. r->cache_info.routerlist_index = idx;
  2659. }
  2660. ri_tmp = rimap_remove(rl->identity_map, ri->cache_info.identity_digest);
  2661. router_dir_info_changed();
  2662. tor_assert(ri_tmp == ri);
  2663. if (make_old && should_cache_old_descriptors() &&
  2664. ri->purpose == ROUTER_PURPOSE_GENERAL) {
  2665. signed_descriptor_t *sd;
  2666. sd = signed_descriptor_from_routerinfo(ri);
  2667. smartlist_add(rl->old_routers, sd);
  2668. sd->routerlist_index = smartlist_len(rl->old_routers)-1;
  2669. sdmap_set(rl->desc_digest_map, sd->signed_descriptor_digest, sd);
  2670. if (!tor_digest_is_zero(sd->extra_info_digest))
  2671. sdmap_set(rl->desc_by_eid_map, sd->extra_info_digest, sd);
  2672. } else {
  2673. signed_descriptor_t *sd_tmp;
  2674. sd_tmp = sdmap_remove(rl->desc_digest_map,
  2675. ri->cache_info.signed_descriptor_digest);
  2676. tor_assert(sd_tmp == &(ri->cache_info));
  2677. rl->desc_store.bytes_dropped += ri->cache_info.signed_descriptor_len;
  2678. ei_tmp = eimap_remove(rl->extra_info_map,
  2679. ri->cache_info.extra_info_digest);
  2680. if (ei_tmp) {
  2681. rl->extrainfo_store.bytes_dropped +=
  2682. ei_tmp->cache_info.signed_descriptor_len;
  2683. extrainfo_free(ei_tmp);
  2684. }
  2685. if (!tor_digest_is_zero(ri->cache_info.extra_info_digest))
  2686. sdmap_remove(rl->desc_by_eid_map, ri->cache_info.extra_info_digest);
  2687. routerinfo_free(ri);
  2688. }
  2689. #ifdef DEBUG_ROUTERLIST
  2690. routerlist_assert_ok(rl);
  2691. #endif
  2692. }
  2693. /** Remove a signed_descriptor_t <b>sd</b> from <b>rl</b>-\>old_routers, and
  2694. * adjust <b>rl</b> as appropriate. <b>idx</b> is -1, or the index of
  2695. * <b>sd</b>. */
  2696. static void
  2697. routerlist_remove_old(routerlist_t *rl, signed_descriptor_t *sd, int idx)
  2698. {
  2699. signed_descriptor_t *sd_tmp;
  2700. extrainfo_t *ei_tmp;
  2701. desc_store_t *store;
  2702. if (idx == -1) {
  2703. idx = sd->routerlist_index;
  2704. }
  2705. tor_assert(0 <= idx && idx < smartlist_len(rl->old_routers));
  2706. /* XXXX edmanm's bridge relay triggered the following assert while
  2707. * running 0.2.0.12-alpha. If anybody triggers this again, see if we
  2708. * can get a backtrace. */
  2709. tor_assert(smartlist_get(rl->old_routers, idx) == sd);
  2710. tor_assert(idx == sd->routerlist_index);
  2711. sd->routerlist_index = -1;
  2712. smartlist_del(rl->old_routers, idx);
  2713. if (idx < smartlist_len(rl->old_routers)) {
  2714. signed_descriptor_t *d = smartlist_get(rl->old_routers, idx);
  2715. d->routerlist_index = idx;
  2716. }
  2717. sd_tmp = sdmap_remove(rl->desc_digest_map,
  2718. sd->signed_descriptor_digest);
  2719. tor_assert(sd_tmp == sd);
  2720. store = desc_get_store(rl, sd);
  2721. if (store)
  2722. store->bytes_dropped += sd->signed_descriptor_len;
  2723. ei_tmp = eimap_remove(rl->extra_info_map,
  2724. sd->extra_info_digest);
  2725. if (ei_tmp) {
  2726. rl->extrainfo_store.bytes_dropped +=
  2727. ei_tmp->cache_info.signed_descriptor_len;
  2728. extrainfo_free(ei_tmp);
  2729. }
  2730. if (!tor_digest_is_zero(sd->extra_info_digest))
  2731. sdmap_remove(rl->desc_by_eid_map, sd->extra_info_digest);
  2732. signed_descriptor_free(sd);
  2733. #ifdef DEBUG_ROUTERLIST
  2734. routerlist_assert_ok(rl);
  2735. #endif
  2736. }
  2737. /** Remove <b>ri_old</b> from the routerlist <b>rl</b>, and replace it with
  2738. * <b>ri_new</b>, updating all index info. If <b>idx</b> is nonnegative and
  2739. * smartlist_get(rl-&gt;routers, idx) == ri, we don't need to do a linear
  2740. * search over the list to decide which to remove. We put ri_new in the same
  2741. * index as ri_old, if possible. ri is freed as appropriate.
  2742. *
  2743. * If should_cache_descriptors() is true, instead of deleting the router,
  2744. * we add it to rl-&gt;old_routers. */
  2745. static void
  2746. routerlist_replace(routerlist_t *rl, routerinfo_t *ri_old,
  2747. routerinfo_t *ri_new)
  2748. {
  2749. int idx;
  2750. int same_descriptors;
  2751. routerinfo_t *ri_tmp;
  2752. extrainfo_t *ei_tmp;
  2753. {
  2754. const routerinfo_t *ri_generated = router_get_my_routerinfo();
  2755. tor_assert(ri_generated != ri_new);
  2756. }
  2757. tor_assert(ri_old != ri_new);
  2758. tor_assert(ri_new->cache_info.routerlist_index == -1);
  2759. idx = ri_old->cache_info.routerlist_index;
  2760. tor_assert(0 <= idx && idx < smartlist_len(rl->routers));
  2761. tor_assert(smartlist_get(rl->routers, idx) == ri_old);
  2762. {
  2763. routerinfo_t *ri_old_tmp=NULL;
  2764. nodelist_set_routerinfo(ri_new, &ri_old_tmp);
  2765. tor_assert(ri_old == ri_old_tmp);
  2766. }
  2767. router_dir_info_changed();
  2768. if (idx >= 0) {
  2769. smartlist_set(rl->routers, idx, ri_new);
  2770. ri_old->cache_info.routerlist_index = -1;
  2771. ri_new->cache_info.routerlist_index = idx;
  2772. /* Check that ri_old is not in rl->routers anymore: */
  2773. tor_assert( routerlist_find_elt_(rl->routers, ri_old, -1) == -1 );
  2774. } else {
  2775. log_warn(LD_BUG, "Appending entry from routerlist_replace.");
  2776. routerlist_insert(rl, ri_new);
  2777. return;
  2778. }
  2779. if (tor_memneq(ri_old->cache_info.identity_digest,
  2780. ri_new->cache_info.identity_digest, DIGEST_LEN)) {
  2781. /* digests don't match; digestmap_set won't replace */
  2782. rimap_remove(rl->identity_map, ri_old->cache_info.identity_digest);
  2783. }
  2784. ri_tmp = rimap_set(rl->identity_map,
  2785. ri_new->cache_info.identity_digest, ri_new);
  2786. tor_assert(!ri_tmp || ri_tmp == ri_old);
  2787. sdmap_set(rl->desc_digest_map,
  2788. ri_new->cache_info.signed_descriptor_digest,
  2789. &(ri_new->cache_info));
  2790. if (!tor_digest_is_zero(ri_new->cache_info.extra_info_digest)) {
  2791. sdmap_set(rl->desc_by_eid_map, ri_new->cache_info.extra_info_digest,
  2792. &ri_new->cache_info);
  2793. }
  2794. same_descriptors = tor_memeq(ri_old->cache_info.signed_descriptor_digest,
  2795. ri_new->cache_info.signed_descriptor_digest,
  2796. DIGEST_LEN);
  2797. if (should_cache_old_descriptors() &&
  2798. ri_old->purpose == ROUTER_PURPOSE_GENERAL &&
  2799. !same_descriptors) {
  2800. /* ri_old is going to become a signed_descriptor_t and go into
  2801. * old_routers */
  2802. signed_descriptor_t *sd = signed_descriptor_from_routerinfo(ri_old);
  2803. smartlist_add(rl->old_routers, sd);
  2804. sd->routerlist_index = smartlist_len(rl->old_routers)-1;
  2805. sdmap_set(rl->desc_digest_map, sd->signed_descriptor_digest, sd);
  2806. if (!tor_digest_is_zero(sd->extra_info_digest))
  2807. sdmap_set(rl->desc_by_eid_map, sd->extra_info_digest, sd);
  2808. } else {
  2809. /* We're dropping ri_old. */
  2810. if (!same_descriptors) {
  2811. /* digests don't match; The sdmap_set above didn't replace */
  2812. sdmap_remove(rl->desc_digest_map,
  2813. ri_old->cache_info.signed_descriptor_digest);
  2814. if (tor_memneq(ri_old->cache_info.extra_info_digest,
  2815. ri_new->cache_info.extra_info_digest, DIGEST_LEN)) {
  2816. ei_tmp = eimap_remove(rl->extra_info_map,
  2817. ri_old->cache_info.extra_info_digest);
  2818. if (ei_tmp) {
  2819. rl->extrainfo_store.bytes_dropped +=
  2820. ei_tmp->cache_info.signed_descriptor_len;
  2821. extrainfo_free(ei_tmp);
  2822. }
  2823. }
  2824. if (!tor_digest_is_zero(ri_old->cache_info.extra_info_digest)) {
  2825. sdmap_remove(rl->desc_by_eid_map,
  2826. ri_old->cache_info.extra_info_digest);
  2827. }
  2828. }
  2829. rl->desc_store.bytes_dropped += ri_old->cache_info.signed_descriptor_len;
  2830. routerinfo_free(ri_old);
  2831. }
  2832. #ifdef DEBUG_ROUTERLIST
  2833. routerlist_assert_ok(rl);
  2834. #endif
  2835. }
  2836. /** Extract the descriptor <b>sd</b> from old_routerlist, and re-parse
  2837. * it as a fresh routerinfo_t. */
  2838. static routerinfo_t *
  2839. routerlist_reparse_old(routerlist_t *rl, signed_descriptor_t *sd)
  2840. {
  2841. routerinfo_t *ri;
  2842. const char *body;
  2843. body = signed_descriptor_get_annotations(sd);
  2844. ri = router_parse_entry_from_string(body,
  2845. body+sd->signed_descriptor_len+sd->annotations_len,
  2846. 0, 1, NULL, NULL);
  2847. if (!ri)
  2848. return NULL;
  2849. memcpy(&ri->cache_info, sd, sizeof(signed_descriptor_t));
  2850. sd->signed_descriptor_body = NULL; /* Steal reference. */
  2851. ri->cache_info.routerlist_index = -1;
  2852. routerlist_remove_old(rl, sd, -1);
  2853. return ri;
  2854. }
  2855. /** Free all memory held by the routerlist module. */
  2856. void
  2857. routerlist_free_all(void)
  2858. {
  2859. routerlist_free(routerlist);
  2860. routerlist = NULL;
  2861. if (warned_nicknames) {
  2862. SMARTLIST_FOREACH(warned_nicknames, char *, cp, tor_free(cp));
  2863. smartlist_free(warned_nicknames);
  2864. warned_nicknames = NULL;
  2865. }
  2866. clear_dir_servers();
  2867. smartlist_free(trusted_dir_servers);
  2868. smartlist_free(fallback_dir_servers);
  2869. trusted_dir_servers = fallback_dir_servers = NULL;
  2870. if (trusted_dir_certs) {
  2871. digestmap_free(trusted_dir_certs, cert_list_free_);
  2872. trusted_dir_certs = NULL;
  2873. }
  2874. }
  2875. /** Forget that we have issued any router-related warnings, so that we'll
  2876. * warn again if we see the same errors. */
  2877. void
  2878. routerlist_reset_warnings(void)
  2879. {
  2880. if (!warned_nicknames)
  2881. warned_nicknames = smartlist_new();
  2882. SMARTLIST_FOREACH(warned_nicknames, char *, cp, tor_free(cp));
  2883. smartlist_clear(warned_nicknames); /* now the list is empty. */
  2884. networkstatus_reset_warnings();
  2885. }
  2886. /** Return 1 if the signed descriptor of this router is older than
  2887. * <b>seconds</b> seconds. Otherwise return 0. */
  2888. MOCK_IMPL(int,
  2889. router_descriptor_is_older_than,(const routerinfo_t *router, int seconds))
  2890. {
  2891. return router->cache_info.published_on < approx_time() - seconds;
  2892. }
  2893. /** Add <b>router</b> to the routerlist, if we don't already have it. Replace
  2894. * older entries (if any) with the same key. Note: Callers should not hold
  2895. * their pointers to <b>router</b> if this function fails; <b>router</b>
  2896. * will either be inserted into the routerlist or freed. Similarly, even
  2897. * if this call succeeds, they should not hold their pointers to
  2898. * <b>router</b> after subsequent calls with other routerinfo's -- they
  2899. * might cause the original routerinfo to get freed.
  2900. *
  2901. * Returns the status for the operation. Might set *<b>msg</b> if it wants
  2902. * the poster of the router to know something.
  2903. *
  2904. * If <b>from_cache</b>, this descriptor came from our disk cache. If
  2905. * <b>from_fetch</b>, we received it in response to a request we made.
  2906. * (If both are false, that means it was uploaded to us as an auth dir
  2907. * server or via the controller.)
  2908. *
  2909. * This function should be called *after*
  2910. * routers_update_status_from_consensus_networkstatus; subsequently, you
  2911. * should call router_rebuild_store and routerlist_descriptors_added.
  2912. */
  2913. was_router_added_t
  2914. router_add_to_routerlist(routerinfo_t *router, const char **msg,
  2915. int from_cache, int from_fetch)
  2916. {
  2917. const char *id_digest;
  2918. const or_options_t *options = get_options();
  2919. int authdir = authdir_mode_handles_descs(options, router->purpose);
  2920. int authdir_believes_valid = 0;
  2921. routerinfo_t *old_router;
  2922. networkstatus_t *consensus =
  2923. networkstatus_get_latest_consensus_by_flavor(FLAV_NS);
  2924. int in_consensus = 0;
  2925. tor_assert(msg);
  2926. if (!routerlist)
  2927. router_get_routerlist();
  2928. id_digest = router->cache_info.identity_digest;
  2929. old_router = router_get_mutable_by_digest(id_digest);
  2930. /* Make sure that it isn't expired. */
  2931. if (router->cert_expiration_time < approx_time()) {
  2932. routerinfo_free(router);
  2933. *msg = "Some certs on this router are expired.";
  2934. return ROUTER_CERTS_EXPIRED;
  2935. }
  2936. /* Make sure that we haven't already got this exact descriptor. */
  2937. if (sdmap_get(routerlist->desc_digest_map,
  2938. router->cache_info.signed_descriptor_digest)) {
  2939. /* If we have this descriptor already and the new descriptor is a bridge
  2940. * descriptor, replace it. If we had a bridge descriptor before and the
  2941. * new one is not a bridge descriptor, don't replace it. */
  2942. /* Only members of routerlist->identity_map can be bridges; we don't
  2943. * put bridges in old_routers. */
  2944. const int was_bridge = old_router &&
  2945. old_router->purpose == ROUTER_PURPOSE_BRIDGE;
  2946. if (routerinfo_is_a_configured_bridge(router) &&
  2947. router->purpose == ROUTER_PURPOSE_BRIDGE &&
  2948. !was_bridge) {
  2949. log_info(LD_DIR, "Replacing non-bridge descriptor with bridge "
  2950. "descriptor for router %s",
  2951. router_describe(router));
  2952. } else {
  2953. log_info(LD_DIR,
  2954. "Dropping descriptor that we already have for router %s",
  2955. router_describe(router));
  2956. *msg = "Router descriptor was not new.";
  2957. routerinfo_free(router);
  2958. return ROUTER_IS_ALREADY_KNOWN;
  2959. }
  2960. }
  2961. if (authdir) {
  2962. if (authdir_wants_to_reject_router(router, msg,
  2963. !from_cache && !from_fetch,
  2964. &authdir_believes_valid)) {
  2965. tor_assert(*msg);
  2966. routerinfo_free(router);
  2967. return ROUTER_AUTHDIR_REJECTS;
  2968. }
  2969. } else if (from_fetch) {
  2970. /* Only check the descriptor digest against the network statuses when
  2971. * we are receiving in response to a fetch. */
  2972. if (!signed_desc_digest_is_recognized(&router->cache_info) &&
  2973. !routerinfo_is_a_configured_bridge(router)) {
  2974. /* We asked for it, so some networkstatus must have listed it when we
  2975. * did. Save it if we're a cache in case somebody else asks for it. */
  2976. log_info(LD_DIR,
  2977. "Received a no-longer-recognized descriptor for router %s",
  2978. router_describe(router));
  2979. *msg = "Router descriptor is not referenced by any network-status.";
  2980. /* Only journal this desc if we'll be serving it. */
  2981. if (!from_cache && should_cache_old_descriptors())
  2982. signed_desc_append_to_journal(&router->cache_info,
  2983. &routerlist->desc_store);
  2984. routerlist_insert_old(routerlist, router);
  2985. return ROUTER_NOT_IN_CONSENSUS_OR_NETWORKSTATUS;
  2986. }
  2987. }
  2988. /* We no longer need a router with this descriptor digest. */
  2989. if (consensus) {
  2990. routerstatus_t *rs = networkstatus_vote_find_mutable_entry(
  2991. consensus, id_digest);
  2992. if (rs && tor_memeq(rs->descriptor_digest,
  2993. router->cache_info.signed_descriptor_digest,
  2994. DIGEST_LEN)) {
  2995. in_consensus = 1;
  2996. }
  2997. }
  2998. if (router->purpose == ROUTER_PURPOSE_GENERAL &&
  2999. consensus && !in_consensus && !authdir) {
  3000. /* If it's a general router not listed in the consensus, then don't
  3001. * consider replacing the latest router with it. */
  3002. if (!from_cache && should_cache_old_descriptors())
  3003. signed_desc_append_to_journal(&router->cache_info,
  3004. &routerlist->desc_store);
  3005. routerlist_insert_old(routerlist, router);
  3006. *msg = "Skipping router descriptor: not in consensus.";
  3007. return ROUTER_NOT_IN_CONSENSUS;
  3008. }
  3009. /* If we're reading a bridge descriptor from our cache, and we don't
  3010. * recognize it as one of our currently configured bridges, drop the
  3011. * descriptor. Otherwise we could end up using it as one of our entry
  3012. * guards even if it isn't in our Bridge config lines. */
  3013. if (router->purpose == ROUTER_PURPOSE_BRIDGE && from_cache &&
  3014. !authdir_mode_bridge(options) &&
  3015. !routerinfo_is_a_configured_bridge(router)) {
  3016. log_info(LD_DIR, "Dropping bridge descriptor for %s because we have "
  3017. "no bridge configured at that address.",
  3018. safe_str_client(router_describe(router)));
  3019. *msg = "Router descriptor was not a configured bridge.";
  3020. routerinfo_free(router);
  3021. return ROUTER_WAS_NOT_WANTED;
  3022. }
  3023. /* If we have a router with the same identity key, choose the newer one. */
  3024. if (old_router) {
  3025. if (!in_consensus && (router->cache_info.published_on <=
  3026. old_router->cache_info.published_on)) {
  3027. /* Same key, but old. This one is not listed in the consensus. */
  3028. log_debug(LD_DIR, "Not-new descriptor for router %s",
  3029. router_describe(router));
  3030. /* Only journal this desc if we'll be serving it. */
  3031. if (!from_cache && should_cache_old_descriptors())
  3032. signed_desc_append_to_journal(&router->cache_info,
  3033. &routerlist->desc_store);
  3034. routerlist_insert_old(routerlist, router);
  3035. *msg = "Router descriptor was not new.";
  3036. return ROUTER_IS_ALREADY_KNOWN;
  3037. } else {
  3038. /* Same key, and either new, or listed in the consensus. */
  3039. log_debug(LD_DIR, "Replacing entry for router %s",
  3040. router_describe(router));
  3041. routerlist_replace(routerlist, old_router, router);
  3042. if (!from_cache) {
  3043. signed_desc_append_to_journal(&router->cache_info,
  3044. &routerlist->desc_store);
  3045. }
  3046. *msg = authdir_believes_valid ? "Valid server updated" :
  3047. ("Invalid server updated. (This dirserver is marking your "
  3048. "server as unapproved.)");
  3049. return ROUTER_ADDED_SUCCESSFULLY;
  3050. }
  3051. }
  3052. if (!in_consensus && from_cache &&
  3053. router_descriptor_is_older_than(router, OLD_ROUTER_DESC_MAX_AGE)) {
  3054. *msg = "Router descriptor was really old.";
  3055. routerinfo_free(router);
  3056. return ROUTER_WAS_TOO_OLD;
  3057. }
  3058. /* We haven't seen a router with this identity before. Add it to the end of
  3059. * the list. */
  3060. routerlist_insert(routerlist, router);
  3061. if (!from_cache) {
  3062. signed_desc_append_to_journal(&router->cache_info,
  3063. &routerlist->desc_store);
  3064. }
  3065. return ROUTER_ADDED_SUCCESSFULLY;
  3066. }
  3067. /** Insert <b>ei</b> into the routerlist, or free it. Other arguments are
  3068. * as for router_add_to_routerlist(). Return ROUTER_ADDED_SUCCESSFULLY iff
  3069. * we actually inserted it, ROUTER_BAD_EI otherwise.
  3070. */
  3071. was_router_added_t
  3072. router_add_extrainfo_to_routerlist(extrainfo_t *ei, const char **msg,
  3073. int from_cache, int from_fetch)
  3074. {
  3075. was_router_added_t inserted;
  3076. (void)from_fetch;
  3077. if (msg) *msg = NULL;
  3078. /*XXXX023 Do something with msg */
  3079. inserted = extrainfo_insert(router_get_routerlist(), ei, !from_cache);
  3080. if (WRA_WAS_ADDED(inserted) && !from_cache)
  3081. signed_desc_append_to_journal(&ei->cache_info,
  3082. &routerlist->extrainfo_store);
  3083. return inserted;
  3084. }
  3085. /** Sorting helper: return &lt;0, 0, or &gt;0 depending on whether the
  3086. * signed_descriptor_t* in *<b>a</b> has an identity digest preceding, equal
  3087. * to, or later than that of *<b>b</b>. */
  3088. static int
  3089. compare_old_routers_by_identity_(const void **_a, const void **_b)
  3090. {
  3091. int i;
  3092. const signed_descriptor_t *r1 = *_a, *r2 = *_b;
  3093. if ((i = fast_memcmp(r1->identity_digest, r2->identity_digest, DIGEST_LEN)))
  3094. return i;
  3095. return (int)(r1->published_on - r2->published_on);
  3096. }
  3097. /** Internal type used to represent how long an old descriptor was valid,
  3098. * where it appeared in the list of old descriptors, and whether it's extra
  3099. * old. Used only by routerlist_remove_old_cached_routers_with_id(). */
  3100. struct duration_idx_t {
  3101. int duration;
  3102. int idx;
  3103. int old;
  3104. };
  3105. /** Sorting helper: compare two duration_idx_t by their duration. */
  3106. static int
  3107. compare_duration_idx_(const void *_d1, const void *_d2)
  3108. {
  3109. const struct duration_idx_t *d1 = _d1;
  3110. const struct duration_idx_t *d2 = _d2;
  3111. return d1->duration - d2->duration;
  3112. }
  3113. /** The range <b>lo</b> through <b>hi</b> inclusive of routerlist->old_routers
  3114. * must contain routerinfo_t with the same identity and with publication time
  3115. * in ascending order. Remove members from this range until there are no more
  3116. * than max_descriptors_per_router() remaining. Start by removing the oldest
  3117. * members from before <b>cutoff</b>, then remove members which were current
  3118. * for the lowest amount of time. The order of members of old_routers at
  3119. * indices <b>lo</b> or higher may be changed.
  3120. */
  3121. static void
  3122. routerlist_remove_old_cached_routers_with_id(time_t now,
  3123. time_t cutoff, int lo, int hi,
  3124. digestset_t *retain)
  3125. {
  3126. int i, n = hi-lo+1;
  3127. unsigned n_extra, n_rmv = 0;
  3128. struct duration_idx_t *lifespans;
  3129. uint8_t *rmv, *must_keep;
  3130. smartlist_t *lst = routerlist->old_routers;
  3131. #if 1
  3132. const char *ident;
  3133. tor_assert(hi < smartlist_len(lst));
  3134. tor_assert(lo <= hi);
  3135. ident = ((signed_descriptor_t*)smartlist_get(lst, lo))->identity_digest;
  3136. for (i = lo+1; i <= hi; ++i) {
  3137. signed_descriptor_t *r = smartlist_get(lst, i);
  3138. tor_assert(tor_memeq(ident, r->identity_digest, DIGEST_LEN));
  3139. }
  3140. #endif
  3141. /* Check whether we need to do anything at all. */
  3142. {
  3143. int mdpr = directory_caches_dir_info(get_options()) ? 2 : 1;
  3144. if (n <= mdpr)
  3145. return;
  3146. n_extra = n - mdpr;
  3147. }
  3148. lifespans = tor_calloc(n, sizeof(struct duration_idx_t));
  3149. rmv = tor_calloc(n, sizeof(uint8_t));
  3150. must_keep = tor_calloc(n, sizeof(uint8_t));
  3151. /* Set lifespans to contain the lifespan and index of each server. */
  3152. /* Set rmv[i-lo]=1 if we're going to remove a server for being too old. */
  3153. for (i = lo; i <= hi; ++i) {
  3154. signed_descriptor_t *r = smartlist_get(lst, i);
  3155. signed_descriptor_t *r_next;
  3156. lifespans[i-lo].idx = i;
  3157. if (r->last_listed_as_valid_until >= now ||
  3158. (retain && digestset_contains(retain, r->signed_descriptor_digest))) {
  3159. must_keep[i-lo] = 1;
  3160. }
  3161. if (i < hi) {
  3162. r_next = smartlist_get(lst, i+1);
  3163. tor_assert(r->published_on <= r_next->published_on);
  3164. lifespans[i-lo].duration = (int)(r_next->published_on - r->published_on);
  3165. } else {
  3166. r_next = NULL;
  3167. lifespans[i-lo].duration = INT_MAX;
  3168. }
  3169. if (!must_keep[i-lo] && r->published_on < cutoff && n_rmv < n_extra) {
  3170. ++n_rmv;
  3171. lifespans[i-lo].old = 1;
  3172. rmv[i-lo] = 1;
  3173. }
  3174. }
  3175. if (n_rmv < n_extra) {
  3176. /**
  3177. * We aren't removing enough servers for being old. Sort lifespans by
  3178. * the duration of liveness, and remove the ones we're not already going to
  3179. * remove based on how long they were alive.
  3180. **/
  3181. qsort(lifespans, n, sizeof(struct duration_idx_t), compare_duration_idx_);
  3182. for (i = 0; i < n && n_rmv < n_extra; ++i) {
  3183. if (!must_keep[lifespans[i].idx-lo] && !lifespans[i].old) {
  3184. rmv[lifespans[i].idx-lo] = 1;
  3185. ++n_rmv;
  3186. }
  3187. }
  3188. }
  3189. i = hi;
  3190. do {
  3191. if (rmv[i-lo])
  3192. routerlist_remove_old(routerlist, smartlist_get(lst, i), i);
  3193. } while (--i >= lo);
  3194. tor_free(must_keep);
  3195. tor_free(rmv);
  3196. tor_free(lifespans);
  3197. }
  3198. /** Deactivate any routers from the routerlist that are more than
  3199. * ROUTER_MAX_AGE seconds old and not recommended by any networkstatuses;
  3200. * remove old routers from the list of cached routers if we have too many.
  3201. */
  3202. void
  3203. routerlist_remove_old_routers(void)
  3204. {
  3205. int i, hi=-1;
  3206. const char *cur_id = NULL;
  3207. time_t now = time(NULL);
  3208. time_t cutoff;
  3209. routerinfo_t *router;
  3210. signed_descriptor_t *sd;
  3211. digestset_t *retain;
  3212. const networkstatus_t *consensus = networkstatus_get_latest_consensus();
  3213. trusted_dirs_remove_old_certs();
  3214. if (!routerlist || !consensus)
  3215. return;
  3216. // routerlist_assert_ok(routerlist);
  3217. /* We need to guess how many router descriptors we will wind up wanting to
  3218. retain, so that we can be sure to allocate a large enough Bloom filter
  3219. to hold the digest set. Overestimating is fine; underestimating is bad.
  3220. */
  3221. {
  3222. /* We'll probably retain everything in the consensus. */
  3223. int n_max_retain = smartlist_len(consensus->routerstatus_list);
  3224. retain = digestset_new(n_max_retain);
  3225. }
  3226. cutoff = now - OLD_ROUTER_DESC_MAX_AGE;
  3227. /* Retain anything listed in the consensus. */
  3228. if (consensus) {
  3229. SMARTLIST_FOREACH(consensus->routerstatus_list, routerstatus_t *, rs,
  3230. if (rs->published_on >= cutoff)
  3231. digestset_add(retain, rs->descriptor_digest));
  3232. }
  3233. /* If we have a consensus, we should consider pruning current routers that
  3234. * are too old and that nobody recommends. (If we don't have a consensus,
  3235. * then we should get one before we decide to kill routers.) */
  3236. if (consensus) {
  3237. cutoff = now - ROUTER_MAX_AGE;
  3238. /* Remove too-old unrecommended members of routerlist->routers. */
  3239. for (i = 0; i < smartlist_len(routerlist->routers); ++i) {
  3240. router = smartlist_get(routerlist->routers, i);
  3241. if (router->cache_info.published_on <= cutoff &&
  3242. router->cache_info.last_listed_as_valid_until < now &&
  3243. !digestset_contains(retain,
  3244. router->cache_info.signed_descriptor_digest)) {
  3245. /* Too old: remove it. (If we're a cache, just move it into
  3246. * old_routers.) */
  3247. log_info(LD_DIR,
  3248. "Forgetting obsolete (too old) routerinfo for router %s",
  3249. router_describe(router));
  3250. routerlist_remove(routerlist, router, 1, now);
  3251. i--;
  3252. }
  3253. }
  3254. }
  3255. //routerlist_assert_ok(routerlist);
  3256. /* Remove far-too-old members of routerlist->old_routers. */
  3257. cutoff = now - OLD_ROUTER_DESC_MAX_AGE;
  3258. for (i = 0; i < smartlist_len(routerlist->old_routers); ++i) {
  3259. sd = smartlist_get(routerlist->old_routers, i);
  3260. if (sd->published_on <= cutoff &&
  3261. sd->last_listed_as_valid_until < now &&
  3262. !digestset_contains(retain, sd->signed_descriptor_digest)) {
  3263. /* Too old. Remove it. */
  3264. routerlist_remove_old(routerlist, sd, i--);
  3265. }
  3266. }
  3267. //routerlist_assert_ok(routerlist);
  3268. log_info(LD_DIR, "We have %d live routers and %d old router descriptors.",
  3269. smartlist_len(routerlist->routers),
  3270. smartlist_len(routerlist->old_routers));
  3271. /* Now we might have to look at routerlist->old_routers for extraneous
  3272. * members. (We'd keep all the members if we could, but we need to save
  3273. * space.) First, check whether we have too many router descriptors, total.
  3274. * We're okay with having too many for some given router, so long as the
  3275. * total number doesn't approach max_descriptors_per_router()*len(router).
  3276. */
  3277. if (smartlist_len(routerlist->old_routers) <
  3278. smartlist_len(routerlist->routers))
  3279. goto done;
  3280. /* Sort by identity, then fix indices. */
  3281. smartlist_sort(routerlist->old_routers, compare_old_routers_by_identity_);
  3282. /* Fix indices. */
  3283. for (i = 0; i < smartlist_len(routerlist->old_routers); ++i) {
  3284. signed_descriptor_t *r = smartlist_get(routerlist->old_routers, i);
  3285. r->routerlist_index = i;
  3286. }
  3287. /* Iterate through the list from back to front, so when we remove descriptors
  3288. * we don't mess up groups we haven't gotten to. */
  3289. for (i = smartlist_len(routerlist->old_routers)-1; i >= 0; --i) {
  3290. signed_descriptor_t *r = smartlist_get(routerlist->old_routers, i);
  3291. if (!cur_id) {
  3292. cur_id = r->identity_digest;
  3293. hi = i;
  3294. }
  3295. if (tor_memneq(cur_id, r->identity_digest, DIGEST_LEN)) {
  3296. routerlist_remove_old_cached_routers_with_id(now,
  3297. cutoff, i+1, hi, retain);
  3298. cur_id = r->identity_digest;
  3299. hi = i;
  3300. }
  3301. }
  3302. if (hi>=0)
  3303. routerlist_remove_old_cached_routers_with_id(now, cutoff, 0, hi, retain);
  3304. //routerlist_assert_ok(routerlist);
  3305. done:
  3306. digestset_free(retain);
  3307. router_rebuild_store(RRS_DONT_REMOVE_OLD, &routerlist->desc_store);
  3308. router_rebuild_store(RRS_DONT_REMOVE_OLD,&routerlist->extrainfo_store);
  3309. }
  3310. /** We just added a new set of descriptors. Take whatever extra steps
  3311. * we need. */
  3312. void
  3313. routerlist_descriptors_added(smartlist_t *sl, int from_cache)
  3314. {
  3315. tor_assert(sl);
  3316. control_event_descriptors_changed(sl);
  3317. SMARTLIST_FOREACH_BEGIN(sl, routerinfo_t *, ri) {
  3318. if (ri->purpose == ROUTER_PURPOSE_BRIDGE)
  3319. learned_bridge_descriptor(ri, from_cache);
  3320. if (ri->needs_retest_if_added) {
  3321. ri->needs_retest_if_added = 0;
  3322. dirserv_single_reachability_test(approx_time(), ri);
  3323. }
  3324. } SMARTLIST_FOREACH_END(ri);
  3325. }
  3326. /**
  3327. * Code to parse a single router descriptor and insert it into the
  3328. * routerlist. Return -1 if the descriptor was ill-formed; 0 if the
  3329. * descriptor was well-formed but could not be added; and 1 if the
  3330. * descriptor was added.
  3331. *
  3332. * If we don't add it and <b>msg</b> is not NULL, then assign to
  3333. * *<b>msg</b> a static string describing the reason for refusing the
  3334. * descriptor.
  3335. *
  3336. * This is used only by the controller.
  3337. */
  3338. int
  3339. router_load_single_router(const char *s, uint8_t purpose, int cache,
  3340. const char **msg)
  3341. {
  3342. routerinfo_t *ri;
  3343. was_router_added_t r;
  3344. smartlist_t *lst;
  3345. char annotation_buf[ROUTER_ANNOTATION_BUF_LEN];
  3346. tor_assert(msg);
  3347. *msg = NULL;
  3348. tor_snprintf(annotation_buf, sizeof(annotation_buf),
  3349. "@source controller\n"
  3350. "@purpose %s\n", router_purpose_to_string(purpose));
  3351. if (!(ri = router_parse_entry_from_string(s, NULL, 1, 0,
  3352. annotation_buf, NULL))) {
  3353. log_warn(LD_DIR, "Error parsing router descriptor; dropping.");
  3354. *msg = "Couldn't parse router descriptor.";
  3355. return -1;
  3356. }
  3357. tor_assert(ri->purpose == purpose);
  3358. if (router_is_me(ri)) {
  3359. log_warn(LD_DIR, "Router's identity key matches mine; dropping.");
  3360. *msg = "Router's identity key matches mine.";
  3361. routerinfo_free(ri);
  3362. return 0;
  3363. }
  3364. if (!cache) /* obey the preference of the controller */
  3365. ri->cache_info.do_not_cache = 1;
  3366. lst = smartlist_new();
  3367. smartlist_add(lst, ri);
  3368. routers_update_status_from_consensus_networkstatus(lst, 0);
  3369. r = router_add_to_routerlist(ri, msg, 0, 0);
  3370. if (!WRA_WAS_ADDED(r)) {
  3371. /* we've already assigned to *msg now, and ri is already freed */
  3372. tor_assert(*msg);
  3373. if (r == ROUTER_AUTHDIR_REJECTS)
  3374. log_warn(LD_DIR, "Couldn't add router to list: %s Dropping.", *msg);
  3375. smartlist_free(lst);
  3376. return 0;
  3377. } else {
  3378. routerlist_descriptors_added(lst, 0);
  3379. smartlist_free(lst);
  3380. log_debug(LD_DIR, "Added router to list");
  3381. return 1;
  3382. }
  3383. }
  3384. /** Given a string <b>s</b> containing some routerdescs, parse it and put the
  3385. * routers into our directory. If saved_location is SAVED_NOWHERE, the routers
  3386. * are in response to a query to the network: cache them by adding them to
  3387. * the journal.
  3388. *
  3389. * Return the number of routers actually added.
  3390. *
  3391. * If <b>requested_fingerprints</b> is provided, it must contain a list of
  3392. * uppercased fingerprints. Do not update any router whose
  3393. * fingerprint is not on the list; after updating a router, remove its
  3394. * fingerprint from the list.
  3395. *
  3396. * If <b>descriptor_digests</b> is non-zero, then the requested_fingerprints
  3397. * are descriptor digests. Otherwise they are identity digests.
  3398. */
  3399. int
  3400. router_load_routers_from_string(const char *s, const char *eos,
  3401. saved_location_t saved_location,
  3402. smartlist_t *requested_fingerprints,
  3403. int descriptor_digests,
  3404. const char *prepend_annotations)
  3405. {
  3406. smartlist_t *routers = smartlist_new(), *changed = smartlist_new();
  3407. char fp[HEX_DIGEST_LEN+1];
  3408. const char *msg;
  3409. int from_cache = (saved_location != SAVED_NOWHERE);
  3410. int allow_annotations = (saved_location != SAVED_NOWHERE);
  3411. int any_changed = 0;
  3412. smartlist_t *invalid_digests = smartlist_new();
  3413. router_parse_list_from_string(&s, eos, routers, saved_location, 0,
  3414. allow_annotations, prepend_annotations,
  3415. invalid_digests);
  3416. routers_update_status_from_consensus_networkstatus(routers, !from_cache);
  3417. log_info(LD_DIR, "%d elements to add", smartlist_len(routers));
  3418. SMARTLIST_FOREACH_BEGIN(routers, routerinfo_t *, ri) {
  3419. was_router_added_t r;
  3420. char d[DIGEST_LEN];
  3421. if (requested_fingerprints) {
  3422. base16_encode(fp, sizeof(fp), descriptor_digests ?
  3423. ri->cache_info.signed_descriptor_digest :
  3424. ri->cache_info.identity_digest,
  3425. DIGEST_LEN);
  3426. if (smartlist_contains_string(requested_fingerprints, fp)) {
  3427. smartlist_string_remove(requested_fingerprints, fp);
  3428. } else {
  3429. char *requested =
  3430. smartlist_join_strings(requested_fingerprints," ",0,NULL);
  3431. log_warn(LD_DIR,
  3432. "We received a router descriptor with a fingerprint (%s) "
  3433. "that we never requested. (We asked for: %s.) Dropping.",
  3434. fp, requested);
  3435. tor_free(requested);
  3436. routerinfo_free(ri);
  3437. continue;
  3438. }
  3439. }
  3440. memcpy(d, ri->cache_info.signed_descriptor_digest, DIGEST_LEN);
  3441. r = router_add_to_routerlist(ri, &msg, from_cache, !from_cache);
  3442. if (WRA_WAS_ADDED(r)) {
  3443. any_changed++;
  3444. smartlist_add(changed, ri);
  3445. routerlist_descriptors_added(changed, from_cache);
  3446. smartlist_clear(changed);
  3447. } else if (WRA_NEVER_DOWNLOADABLE(r)) {
  3448. download_status_t *dl_status;
  3449. dl_status = router_get_dl_status_by_descriptor_digest(d);
  3450. if (dl_status) {
  3451. log_info(LD_GENERAL, "Marking router %s as never downloadable",
  3452. hex_str(d, DIGEST_LEN));
  3453. download_status_mark_impossible(dl_status);
  3454. }
  3455. }
  3456. } SMARTLIST_FOREACH_END(ri);
  3457. SMARTLIST_FOREACH_BEGIN(invalid_digests, const uint8_t *, bad_digest) {
  3458. /* This digest is never going to be parseable. */
  3459. base16_encode(fp, sizeof(fp), (char*)bad_digest, DIGEST_LEN);
  3460. if (requested_fingerprints && descriptor_digests) {
  3461. if (! smartlist_contains_string(requested_fingerprints, fp)) {
  3462. /* But we didn't ask for it, so we should assume shennanegans. */
  3463. continue;
  3464. }
  3465. smartlist_string_remove(requested_fingerprints, fp);
  3466. }
  3467. download_status_t *dls;
  3468. dls = router_get_dl_status_by_descriptor_digest((char*)bad_digest);
  3469. if (dls) {
  3470. log_info(LD_GENERAL, "Marking router with descriptor %s as unparseable, "
  3471. "and therefore undownloadable", fp);
  3472. download_status_mark_impossible(dls);
  3473. }
  3474. } SMARTLIST_FOREACH_END(bad_digest);
  3475. SMARTLIST_FOREACH(invalid_digests, uint8_t *, d, tor_free(d));
  3476. smartlist_free(invalid_digests);
  3477. routerlist_assert_ok(routerlist);
  3478. if (any_changed)
  3479. router_rebuild_store(0, &routerlist->desc_store);
  3480. smartlist_free(routers);
  3481. smartlist_free(changed);
  3482. return any_changed;
  3483. }
  3484. /** Parse one or more extrainfos from <b>s</b> (ending immediately before
  3485. * <b>eos</b> if <b>eos</b> is present). Other arguments are as for
  3486. * router_load_routers_from_string(). */
  3487. void
  3488. router_load_extrainfo_from_string(const char *s, const char *eos,
  3489. saved_location_t saved_location,
  3490. smartlist_t *requested_fingerprints,
  3491. int descriptor_digests)
  3492. {
  3493. smartlist_t *extrainfo_list = smartlist_new();
  3494. const char *msg;
  3495. int from_cache = (saved_location != SAVED_NOWHERE);
  3496. smartlist_t *invalid_digests = smartlist_new();
  3497. router_parse_list_from_string(&s, eos, extrainfo_list, saved_location, 1, 0,
  3498. NULL, invalid_digests);
  3499. log_info(LD_DIR, "%d elements to add", smartlist_len(extrainfo_list));
  3500. SMARTLIST_FOREACH_BEGIN(extrainfo_list, extrainfo_t *, ei) {
  3501. uint8_t d[DIGEST_LEN];
  3502. memcpy(d, ei->cache_info.signed_descriptor_digest, DIGEST_LEN);
  3503. was_router_added_t added =
  3504. router_add_extrainfo_to_routerlist(ei, &msg, from_cache, !from_cache);
  3505. if (WRA_WAS_ADDED(added) && requested_fingerprints) {
  3506. char fp[HEX_DIGEST_LEN+1];
  3507. base16_encode(fp, sizeof(fp), descriptor_digests ?
  3508. ei->cache_info.signed_descriptor_digest :
  3509. ei->cache_info.identity_digest,
  3510. DIGEST_LEN);
  3511. smartlist_string_remove(requested_fingerprints, fp);
  3512. /* We silently let people stuff us with extrainfos we didn't ask for,
  3513. * so long as we would have wanted them anyway. Since we always fetch
  3514. * all the extrainfos we want, and we never actually act on them
  3515. * inside Tor, this should be harmless. */
  3516. } else if (WRA_NEVER_DOWNLOADABLE(added)) {
  3517. signed_descriptor_t *sd = router_get_by_extrainfo_digest((char*)d);
  3518. if (sd) {
  3519. log_info(LD_GENERAL, "Marking extrainfo with descriptor %s as "
  3520. "unparseable, and therefore undownloadable",
  3521. hex_str((char*)d,DIGEST_LEN));
  3522. download_status_mark_impossible(&sd->ei_dl_status);
  3523. }
  3524. }
  3525. } SMARTLIST_FOREACH_END(ei);
  3526. SMARTLIST_FOREACH_BEGIN(invalid_digests, const uint8_t *, bad_digest) {
  3527. /* This digest is never going to be parseable. */
  3528. char fp[HEX_DIGEST_LEN+1];
  3529. base16_encode(fp, sizeof(fp), (char*)bad_digest, DIGEST_LEN);
  3530. if (requested_fingerprints) {
  3531. if (! smartlist_contains_string(requested_fingerprints, fp)) {
  3532. /* But we didn't ask for it, so we should assume shennanegans. */
  3533. continue;
  3534. }
  3535. smartlist_string_remove(requested_fingerprints, fp);
  3536. }
  3537. signed_descriptor_t *sd =
  3538. router_get_by_extrainfo_digest((char*)bad_digest);
  3539. if (sd) {
  3540. log_info(LD_GENERAL, "Marking extrainfo with descriptor %s as "
  3541. "unparseable, and therefore undownloadable", fp);
  3542. download_status_mark_impossible(&sd->ei_dl_status);
  3543. }
  3544. } SMARTLIST_FOREACH_END(bad_digest);
  3545. SMARTLIST_FOREACH(invalid_digests, uint8_t *, d, tor_free(d));
  3546. smartlist_free(invalid_digests);
  3547. routerlist_assert_ok(routerlist);
  3548. router_rebuild_store(0, &router_get_routerlist()->extrainfo_store);
  3549. smartlist_free(extrainfo_list);
  3550. }
  3551. /** Return true iff any networkstatus includes a descriptor whose digest
  3552. * is that of <b>desc</b>. */
  3553. static int
  3554. signed_desc_digest_is_recognized(signed_descriptor_t *desc)
  3555. {
  3556. const routerstatus_t *rs;
  3557. networkstatus_t *consensus = networkstatus_get_latest_consensus();
  3558. if (consensus) {
  3559. rs = networkstatus_vote_find_entry(consensus, desc->identity_digest);
  3560. if (rs && tor_memeq(rs->descriptor_digest,
  3561. desc->signed_descriptor_digest, DIGEST_LEN))
  3562. return 1;
  3563. }
  3564. return 0;
  3565. }
  3566. /** Update downloads for router descriptors and/or microdescriptors as
  3567. * appropriate. */
  3568. void
  3569. update_all_descriptor_downloads(time_t now)
  3570. {
  3571. if (get_options()->DisableNetwork)
  3572. return;
  3573. update_router_descriptor_downloads(now);
  3574. update_microdesc_downloads(now);
  3575. launch_dummy_descriptor_download_as_needed(now, get_options());
  3576. }
  3577. /** Clear all our timeouts for fetching v3 directory stuff, and then
  3578. * give it all a try again. */
  3579. void
  3580. routerlist_retry_directory_downloads(time_t now)
  3581. {
  3582. (void)now;
  3583. router_reset_status_download_failures();
  3584. router_reset_descriptor_download_failures();
  3585. reschedule_directory_downloads();
  3586. }
  3587. /** Return true iff <b>router</b> does not permit exit streams.
  3588. */
  3589. int
  3590. router_exit_policy_rejects_all(const routerinfo_t *router)
  3591. {
  3592. return router->policy_is_reject_star;
  3593. }
  3594. /** Create an directory server at <b>address</b>:<b>port</b>, with OR identity
  3595. * key <b>digest</b> which has DIGEST_LEN bytes. If <b>address</b> is NULL,
  3596. * add ourself. If <b>is_authority</b>, this is a directory authority. Return
  3597. * the new directory server entry on success or NULL on failure. */
  3598. static dir_server_t *
  3599. dir_server_new(int is_authority,
  3600. const char *nickname,
  3601. const tor_addr_t *addr,
  3602. const char *hostname,
  3603. uint16_t dir_port, uint16_t or_port,
  3604. const char *digest, const char *v3_auth_digest,
  3605. dirinfo_type_t type,
  3606. double weight)
  3607. {
  3608. dir_server_t *ent;
  3609. uint32_t a;
  3610. char *hostname_ = NULL;
  3611. tor_assert(digest);
  3612. if (weight < 0)
  3613. return NULL;
  3614. if (tor_addr_family(addr) == AF_INET)
  3615. a = tor_addr_to_ipv4h(addr);
  3616. else
  3617. return NULL; /*XXXX Support IPv6 */
  3618. if (!hostname)
  3619. hostname_ = tor_dup_addr(addr);
  3620. else
  3621. hostname_ = tor_strdup(hostname);
  3622. ent = tor_malloc_zero(sizeof(dir_server_t));
  3623. ent->nickname = nickname ? tor_strdup(nickname) : NULL;
  3624. ent->address = hostname_;
  3625. ent->addr = a;
  3626. ent->dir_port = dir_port;
  3627. ent->or_port = or_port;
  3628. ent->is_running = 1;
  3629. ent->is_authority = is_authority;
  3630. ent->type = type;
  3631. ent->weight = weight;
  3632. memcpy(ent->digest, digest, DIGEST_LEN);
  3633. if (v3_auth_digest && (type & V3_DIRINFO))
  3634. memcpy(ent->v3_identity_digest, v3_auth_digest, DIGEST_LEN);
  3635. if (nickname)
  3636. tor_asprintf(&ent->description, "directory server \"%s\" at %s:%d",
  3637. nickname, hostname, (int)dir_port);
  3638. else
  3639. tor_asprintf(&ent->description, "directory server at %s:%d",
  3640. hostname, (int)dir_port);
  3641. ent->fake_status.addr = ent->addr;
  3642. memcpy(ent->fake_status.identity_digest, digest, DIGEST_LEN);
  3643. if (nickname)
  3644. strlcpy(ent->fake_status.nickname, nickname,
  3645. sizeof(ent->fake_status.nickname));
  3646. else
  3647. ent->fake_status.nickname[0] = '\0';
  3648. ent->fake_status.dir_port = ent->dir_port;
  3649. ent->fake_status.or_port = ent->or_port;
  3650. return ent;
  3651. }
  3652. /** Create an authoritative directory server at
  3653. * <b>address</b>:<b>port</b>, with identity key <b>digest</b>. If
  3654. * <b>address</b> is NULL, add ourself. Return the new trusted directory
  3655. * server entry on success or NULL if we couldn't add it. */
  3656. dir_server_t *
  3657. trusted_dir_server_new(const char *nickname, const char *address,
  3658. uint16_t dir_port, uint16_t or_port,
  3659. const char *digest, const char *v3_auth_digest,
  3660. dirinfo_type_t type, double weight)
  3661. {
  3662. uint32_t a;
  3663. tor_addr_t addr;
  3664. char *hostname=NULL;
  3665. dir_server_t *result;
  3666. if (!address) { /* The address is us; we should guess. */
  3667. if (resolve_my_address(LOG_WARN, get_options(),
  3668. &a, NULL, &hostname) < 0) {
  3669. log_warn(LD_CONFIG,
  3670. "Couldn't find a suitable address when adding ourself as a "
  3671. "trusted directory server.");
  3672. return NULL;
  3673. }
  3674. if (!hostname)
  3675. hostname = tor_dup_ip(a);
  3676. } else {
  3677. if (tor_lookup_hostname(address, &a)) {
  3678. log_warn(LD_CONFIG,
  3679. "Unable to lookup address for directory server at '%s'",
  3680. address);
  3681. return NULL;
  3682. }
  3683. hostname = tor_strdup(address);
  3684. }
  3685. tor_addr_from_ipv4h(&addr, a);
  3686. result = dir_server_new(1, nickname, &addr, hostname,
  3687. dir_port, or_port, digest,
  3688. v3_auth_digest, type, weight);
  3689. tor_free(hostname);
  3690. return result;
  3691. }
  3692. /** Return a new dir_server_t for a fallback directory server at
  3693. * <b>addr</b>:<b>or_port</b>/<b>dir_port</b>, with identity key digest
  3694. * <b>id_digest</b> */
  3695. dir_server_t *
  3696. fallback_dir_server_new(const tor_addr_t *addr,
  3697. uint16_t dir_port, uint16_t or_port,
  3698. const char *id_digest, double weight)
  3699. {
  3700. return dir_server_new(0, NULL, addr, NULL, dir_port, or_port, id_digest,
  3701. NULL, ALL_DIRINFO, weight);
  3702. }
  3703. /** Add a directory server to the global list(s). */
  3704. void
  3705. dir_server_add(dir_server_t *ent)
  3706. {
  3707. if (!trusted_dir_servers)
  3708. trusted_dir_servers = smartlist_new();
  3709. if (!fallback_dir_servers)
  3710. fallback_dir_servers = smartlist_new();
  3711. if (ent->is_authority)
  3712. smartlist_add(trusted_dir_servers, ent);
  3713. smartlist_add(fallback_dir_servers, ent);
  3714. router_dir_info_changed();
  3715. }
  3716. /** Free storage held in <b>cert</b>. */
  3717. void
  3718. authority_cert_free(authority_cert_t *cert)
  3719. {
  3720. if (!cert)
  3721. return;
  3722. tor_free(cert->cache_info.signed_descriptor_body);
  3723. crypto_pk_free(cert->signing_key);
  3724. crypto_pk_free(cert->identity_key);
  3725. tor_free(cert);
  3726. }
  3727. /** Free storage held in <b>ds</b>. */
  3728. static void
  3729. dir_server_free(dir_server_t *ds)
  3730. {
  3731. if (!ds)
  3732. return;
  3733. tor_free(ds->nickname);
  3734. tor_free(ds->description);
  3735. tor_free(ds->address);
  3736. tor_free(ds);
  3737. }
  3738. /** Remove all members from the list of dir servers. */
  3739. void
  3740. clear_dir_servers(void)
  3741. {
  3742. if (fallback_dir_servers) {
  3743. SMARTLIST_FOREACH(fallback_dir_servers, dir_server_t *, ent,
  3744. dir_server_free(ent));
  3745. smartlist_clear(fallback_dir_servers);
  3746. } else {
  3747. fallback_dir_servers = smartlist_new();
  3748. }
  3749. if (trusted_dir_servers) {
  3750. smartlist_clear(trusted_dir_servers);
  3751. } else {
  3752. trusted_dir_servers = smartlist_new();
  3753. }
  3754. router_dir_info_changed();
  3755. }
  3756. /** For every current directory connection whose purpose is <b>purpose</b>,
  3757. * and where the resource being downloaded begins with <b>prefix</b>, split
  3758. * rest of the resource into base16 fingerprints (or base64 fingerprints if
  3759. * purpose==DIR_PURPPOSE_FETCH_MICRODESC), decode them, and set the
  3760. * corresponding elements of <b>result</b> to a nonzero value.
  3761. */
  3762. static void
  3763. list_pending_downloads(digestmap_t *result, digest256map_t *result256,
  3764. int purpose, const char *prefix)
  3765. {
  3766. const size_t p_len = strlen(prefix);
  3767. smartlist_t *tmp = smartlist_new();
  3768. smartlist_t *conns = get_connection_array();
  3769. int flags = DSR_HEX;
  3770. if (purpose == DIR_PURPOSE_FETCH_MICRODESC)
  3771. flags = DSR_DIGEST256|DSR_BASE64;
  3772. tor_assert(result || result256);
  3773. SMARTLIST_FOREACH_BEGIN(conns, connection_t *, conn) {
  3774. if (conn->type == CONN_TYPE_DIR &&
  3775. conn->purpose == purpose &&
  3776. !conn->marked_for_close) {
  3777. const char *resource = TO_DIR_CONN(conn)->requested_resource;
  3778. if (!strcmpstart(resource, prefix))
  3779. dir_split_resource_into_fingerprints(resource + p_len,
  3780. tmp, NULL, flags);
  3781. }
  3782. } SMARTLIST_FOREACH_END(conn);
  3783. if (result) {
  3784. SMARTLIST_FOREACH(tmp, char *, d,
  3785. {
  3786. digestmap_set(result, d, (void*)1);
  3787. tor_free(d);
  3788. });
  3789. } else if (result256) {
  3790. SMARTLIST_FOREACH(tmp, uint8_t *, d,
  3791. {
  3792. digest256map_set(result256, d, (void*)1);
  3793. tor_free(d);
  3794. });
  3795. }
  3796. smartlist_free(tmp);
  3797. }
  3798. /** For every router descriptor (or extra-info document if <b>extrainfo</b> is
  3799. * true) we are currently downloading by descriptor digest, set result[d] to
  3800. * (void*)1. */
  3801. static void
  3802. list_pending_descriptor_downloads(digestmap_t *result, int extrainfo)
  3803. {
  3804. int purpose =
  3805. extrainfo ? DIR_PURPOSE_FETCH_EXTRAINFO : DIR_PURPOSE_FETCH_SERVERDESC;
  3806. list_pending_downloads(result, NULL, purpose, "d/");
  3807. }
  3808. /** For every microdescriptor we are currently downloading by descriptor
  3809. * digest, set result[d] to (void*)1.
  3810. */
  3811. void
  3812. list_pending_microdesc_downloads(digest256map_t *result)
  3813. {
  3814. list_pending_downloads(NULL, result, DIR_PURPOSE_FETCH_MICRODESC, "d/");
  3815. }
  3816. /** For every certificate we are currently downloading by (identity digest,
  3817. * signing key digest) pair, set result[fp_pair] to (void *1).
  3818. */
  3819. static void
  3820. list_pending_fpsk_downloads(fp_pair_map_t *result)
  3821. {
  3822. const char *pfx = "fp-sk/";
  3823. smartlist_t *tmp;
  3824. smartlist_t *conns;
  3825. const char *resource;
  3826. tor_assert(result);
  3827. tmp = smartlist_new();
  3828. conns = get_connection_array();
  3829. SMARTLIST_FOREACH_BEGIN(conns, connection_t *, conn) {
  3830. if (conn->type == CONN_TYPE_DIR &&
  3831. conn->purpose == DIR_PURPOSE_FETCH_CERTIFICATE &&
  3832. !conn->marked_for_close) {
  3833. resource = TO_DIR_CONN(conn)->requested_resource;
  3834. if (!strcmpstart(resource, pfx))
  3835. dir_split_resource_into_fingerprint_pairs(resource + strlen(pfx),
  3836. tmp);
  3837. }
  3838. } SMARTLIST_FOREACH_END(conn);
  3839. SMARTLIST_FOREACH_BEGIN(tmp, fp_pair_t *, fp) {
  3840. fp_pair_map_set(result, fp, (void*)1);
  3841. tor_free(fp);
  3842. } SMARTLIST_FOREACH_END(fp);
  3843. smartlist_free(tmp);
  3844. }
  3845. /** Launch downloads for all the descriptors whose digests or digests256
  3846. * are listed as digests[i] for lo <= i < hi. (Lo and hi may be out of
  3847. * range.) If <b>source</b> is given, download from <b>source</b>;
  3848. * otherwise, download from an appropriate random directory server.
  3849. */
  3850. MOCK_IMPL(STATIC void, initiate_descriptor_downloads,
  3851. (const routerstatus_t *source, int purpose, smartlist_t *digests,
  3852. int lo, int hi, int pds_flags))
  3853. {
  3854. char *resource, *cp;
  3855. int digest_len, enc_digest_len;
  3856. const char *sep;
  3857. int b64_256;
  3858. smartlist_t *tmp;
  3859. if (purpose == DIR_PURPOSE_FETCH_MICRODESC) {
  3860. /* Microdescriptors are downloaded by "-"-separated base64-encoded
  3861. * 256-bit digests. */
  3862. digest_len = DIGEST256_LEN;
  3863. enc_digest_len = BASE64_DIGEST256_LEN + 1;
  3864. sep = "-";
  3865. b64_256 = 1;
  3866. } else {
  3867. digest_len = DIGEST_LEN;
  3868. enc_digest_len = HEX_DIGEST_LEN + 1;
  3869. sep = "+";
  3870. b64_256 = 0;
  3871. }
  3872. if (lo < 0)
  3873. lo = 0;
  3874. if (hi > smartlist_len(digests))
  3875. hi = smartlist_len(digests);
  3876. if (hi-lo <= 0)
  3877. return;
  3878. tmp = smartlist_new();
  3879. for (; lo < hi; ++lo) {
  3880. cp = tor_malloc(enc_digest_len);
  3881. if (b64_256) {
  3882. digest256_to_base64(cp, smartlist_get(digests, lo));
  3883. } else {
  3884. base16_encode(cp, enc_digest_len, smartlist_get(digests, lo),
  3885. digest_len);
  3886. }
  3887. smartlist_add(tmp, cp);
  3888. }
  3889. cp = smartlist_join_strings(tmp, sep, 0, NULL);
  3890. tor_asprintf(&resource, "d/%s.z", cp);
  3891. SMARTLIST_FOREACH(tmp, char *, cp1, tor_free(cp1));
  3892. smartlist_free(tmp);
  3893. tor_free(cp);
  3894. if (source) {
  3895. /* We know which authority we want. */
  3896. directory_initiate_command_routerstatus(source, purpose,
  3897. ROUTER_PURPOSE_GENERAL,
  3898. DIRIND_ONEHOP,
  3899. resource, NULL, 0, 0);
  3900. } else {
  3901. directory_get_from_dirserver(purpose, ROUTER_PURPOSE_GENERAL, resource,
  3902. pds_flags);
  3903. }
  3904. tor_free(resource);
  3905. }
  3906. /** Return the max number of hashes to put in a URL for a given request.
  3907. */
  3908. static int
  3909. max_dl_per_request(const or_options_t *options, int purpose)
  3910. {
  3911. /* Since squid does not like URLs >= 4096 bytes we limit it to 96.
  3912. * 4096 - strlen(http://255.255.255.255/tor/server/d/.z) == 4058
  3913. * 4058/41 (40 for the hash and 1 for the + that separates them) => 98
  3914. * So use 96 because it's a nice number.
  3915. */
  3916. int max = 96;
  3917. if (purpose == DIR_PURPOSE_FETCH_MICRODESC) {
  3918. max = 92;
  3919. }
  3920. /* If we're going to tunnel our connections, we can ask for a lot more
  3921. * in a request. */
  3922. if (!directory_fetches_from_authorities(options)) {
  3923. max = 500;
  3924. }
  3925. return max;
  3926. }
  3927. /** Don't split our requests so finely that we are requesting fewer than
  3928. * this number per server. */
  3929. #define MIN_DL_PER_REQUEST 4
  3930. /** To prevent a single screwy cache from confusing us by selective reply,
  3931. * try to split our requests into at least this many requests. */
  3932. #define MIN_REQUESTS 3
  3933. /** If we want fewer than this many descriptors, wait until we
  3934. * want more, or until TestingClientMaxIntervalWithoutRequest has passed. */
  3935. #define MAX_DL_TO_DELAY 16
  3936. /** Given a <b>purpose</b> (FETCH_MICRODESC or FETCH_SERVERDESC) and a list of
  3937. * router descriptor digests or microdescriptor digest256s in
  3938. * <b>downloadable</b>, decide whether to delay fetching until we have more.
  3939. * If we don't want to delay, launch one or more requests to the appropriate
  3940. * directory authorities.
  3941. */
  3942. void
  3943. launch_descriptor_downloads(int purpose,
  3944. smartlist_t *downloadable,
  3945. const routerstatus_t *source, time_t now)
  3946. {
  3947. const or_options_t *options = get_options();
  3948. const char *descname;
  3949. const int fetch_microdesc = (purpose == DIR_PURPOSE_FETCH_MICRODESC);
  3950. int n_downloadable = smartlist_len(downloadable);
  3951. int i, n_per_request, max_dl_per_req;
  3952. const char *req_plural = "", *rtr_plural = "";
  3953. int pds_flags = PDS_RETRY_IF_NO_SERVERS;
  3954. tor_assert(fetch_microdesc || purpose == DIR_PURPOSE_FETCH_SERVERDESC);
  3955. descname = fetch_microdesc ? "microdesc" : "routerdesc";
  3956. if (!n_downloadable)
  3957. return;
  3958. if (!directory_fetches_dir_info_early(options)) {
  3959. if (n_downloadable >= MAX_DL_TO_DELAY) {
  3960. log_debug(LD_DIR,
  3961. "There are enough downloadable %ss to launch requests.",
  3962. descname);
  3963. } else {
  3964. /* should delay */
  3965. if ((last_descriptor_download_attempted +
  3966. options->TestingClientMaxIntervalWithoutRequest) > now)
  3967. return;
  3968. if (last_descriptor_download_attempted) {
  3969. log_info(LD_DIR,
  3970. "There are not many downloadable %ss, but we've "
  3971. "been waiting long enough (%d seconds). Downloading.",
  3972. descname,
  3973. (int)(now-last_descriptor_download_attempted));
  3974. } else {
  3975. log_info(LD_DIR,
  3976. "There are not many downloadable %ss, but we haven't "
  3977. "tried downloading descriptors recently. Downloading.",
  3978. descname);
  3979. }
  3980. }
  3981. }
  3982. if (!authdir_mode_any_nonhidserv(options)) {
  3983. /* If we wind up going to the authorities, we want to only open one
  3984. * connection to each authority at a time, so that we don't overload
  3985. * them. We do this by setting PDS_NO_EXISTING_SERVERDESC_FETCH
  3986. * regardless of whether we're a cache or not.
  3987. *
  3988. * Setting this flag can make initiate_descriptor_downloads() ignore
  3989. * requests. We need to make sure that we do in fact call
  3990. * update_router_descriptor_downloads() later on, once the connections
  3991. * have succeeded or failed.
  3992. */
  3993. pds_flags |= fetch_microdesc ?
  3994. PDS_NO_EXISTING_MICRODESC_FETCH :
  3995. PDS_NO_EXISTING_SERVERDESC_FETCH;
  3996. }
  3997. n_per_request = CEIL_DIV(n_downloadable, MIN_REQUESTS);
  3998. max_dl_per_req = max_dl_per_request(options, purpose);
  3999. if (n_per_request > max_dl_per_req)
  4000. n_per_request = max_dl_per_req;
  4001. if (n_per_request < MIN_DL_PER_REQUEST)
  4002. n_per_request = MIN_DL_PER_REQUEST;
  4003. if (n_downloadable > n_per_request)
  4004. req_plural = rtr_plural = "s";
  4005. else if (n_downloadable > 1)
  4006. rtr_plural = "s";
  4007. log_info(LD_DIR,
  4008. "Launching %d request%s for %d %s%s, %d at a time",
  4009. CEIL_DIV(n_downloadable, n_per_request), req_plural,
  4010. n_downloadable, descname, rtr_plural, n_per_request);
  4011. smartlist_sort_digests(downloadable);
  4012. for (i=0; i < n_downloadable; i += n_per_request) {
  4013. initiate_descriptor_downloads(source, purpose,
  4014. downloadable, i, i+n_per_request,
  4015. pds_flags);
  4016. }
  4017. last_descriptor_download_attempted = now;
  4018. }
  4019. /** For any descriptor that we want that's currently listed in
  4020. * <b>consensus</b>, download it as appropriate. */
  4021. void
  4022. update_consensus_router_descriptor_downloads(time_t now, int is_vote,
  4023. networkstatus_t *consensus)
  4024. {
  4025. const or_options_t *options = get_options();
  4026. digestmap_t *map = NULL;
  4027. smartlist_t *no_longer_old = smartlist_new();
  4028. smartlist_t *downloadable = smartlist_new();
  4029. routerstatus_t *source = NULL;
  4030. int authdir = authdir_mode(options);
  4031. int n_delayed=0, n_have=0, n_would_reject=0, n_wouldnt_use=0,
  4032. n_inprogress=0, n_in_oldrouters=0;
  4033. if (directory_too_idle_to_fetch_descriptors(options, now))
  4034. goto done;
  4035. if (!consensus)
  4036. goto done;
  4037. if (is_vote) {
  4038. /* where's it from, so we know whom to ask for descriptors */
  4039. dir_server_t *ds;
  4040. networkstatus_voter_info_t *voter = smartlist_get(consensus->voters, 0);
  4041. tor_assert(voter);
  4042. ds = trusteddirserver_get_by_v3_auth_digest(voter->identity_digest);
  4043. if (ds)
  4044. source = &(ds->fake_status);
  4045. else
  4046. log_warn(LD_DIR, "couldn't lookup source from vote?");
  4047. }
  4048. map = digestmap_new();
  4049. list_pending_descriptor_downloads(map, 0);
  4050. SMARTLIST_FOREACH_BEGIN(consensus->routerstatus_list, void *, rsp) {
  4051. routerstatus_t *rs =
  4052. is_vote ? &(((vote_routerstatus_t *)rsp)->status) : rsp;
  4053. signed_descriptor_t *sd;
  4054. if ((sd = router_get_by_descriptor_digest(rs->descriptor_digest))) {
  4055. const routerinfo_t *ri;
  4056. ++n_have;
  4057. if (!(ri = router_get_by_id_digest(rs->identity_digest)) ||
  4058. tor_memneq(ri->cache_info.signed_descriptor_digest,
  4059. sd->signed_descriptor_digest, DIGEST_LEN)) {
  4060. /* We have a descriptor with this digest, but either there is no
  4061. * entry in routerlist with the same ID (!ri), or there is one,
  4062. * but the identity digest differs (memneq).
  4063. */
  4064. smartlist_add(no_longer_old, sd);
  4065. ++n_in_oldrouters; /* We have it in old_routers. */
  4066. }
  4067. continue; /* We have it already. */
  4068. }
  4069. if (digestmap_get(map, rs->descriptor_digest)) {
  4070. ++n_inprogress;
  4071. continue; /* We have an in-progress download. */
  4072. }
  4073. if (!download_status_is_ready(&rs->dl_status, now,
  4074. options->TestingDescriptorMaxDownloadTries)) {
  4075. ++n_delayed; /* Not ready for retry. */
  4076. continue;
  4077. }
  4078. if (authdir && dirserv_would_reject_router(rs)) {
  4079. ++n_would_reject;
  4080. continue; /* We would throw it out immediately. */
  4081. }
  4082. if (!directory_caches_dir_info(options) &&
  4083. !client_would_use_router(rs, now, options)) {
  4084. ++n_wouldnt_use;
  4085. continue; /* We would never use it ourself. */
  4086. }
  4087. if (is_vote && source) {
  4088. char time_bufnew[ISO_TIME_LEN+1];
  4089. char time_bufold[ISO_TIME_LEN+1];
  4090. const routerinfo_t *oldrouter;
  4091. oldrouter = router_get_by_id_digest(rs->identity_digest);
  4092. format_iso_time(time_bufnew, rs->published_on);
  4093. if (oldrouter)
  4094. format_iso_time(time_bufold, oldrouter->cache_info.published_on);
  4095. log_info(LD_DIR, "Learned about %s (%s vs %s) from %s's vote (%s)",
  4096. routerstatus_describe(rs),
  4097. time_bufnew,
  4098. oldrouter ? time_bufold : "none",
  4099. source->nickname, oldrouter ? "known" : "unknown");
  4100. }
  4101. smartlist_add(downloadable, rs->descriptor_digest);
  4102. } SMARTLIST_FOREACH_END(rsp);
  4103. if (!authdir_mode_handles_descs(options, ROUTER_PURPOSE_GENERAL)
  4104. && smartlist_len(no_longer_old)) {
  4105. routerlist_t *rl = router_get_routerlist();
  4106. log_info(LD_DIR, "%d router descriptors listed in consensus are "
  4107. "currently in old_routers; making them current.",
  4108. smartlist_len(no_longer_old));
  4109. SMARTLIST_FOREACH_BEGIN(no_longer_old, signed_descriptor_t *, sd) {
  4110. const char *msg;
  4111. was_router_added_t r;
  4112. routerinfo_t *ri = routerlist_reparse_old(rl, sd);
  4113. if (!ri) {
  4114. log_warn(LD_BUG, "Failed to re-parse a router.");
  4115. continue;
  4116. }
  4117. r = router_add_to_routerlist(ri, &msg, 1, 0);
  4118. if (WRA_WAS_OUTDATED(r)) {
  4119. log_warn(LD_DIR, "Couldn't add re-parsed router: %s",
  4120. msg?msg:"???");
  4121. }
  4122. } SMARTLIST_FOREACH_END(sd);
  4123. routerlist_assert_ok(rl);
  4124. }
  4125. log_info(LD_DIR,
  4126. "%d router descriptors downloadable. %d delayed; %d present "
  4127. "(%d of those were in old_routers); %d would_reject; "
  4128. "%d wouldnt_use; %d in progress.",
  4129. smartlist_len(downloadable), n_delayed, n_have, n_in_oldrouters,
  4130. n_would_reject, n_wouldnt_use, n_inprogress);
  4131. launch_descriptor_downloads(DIR_PURPOSE_FETCH_SERVERDESC,
  4132. downloadable, source, now);
  4133. digestmap_free(map, NULL);
  4134. done:
  4135. smartlist_free(downloadable);
  4136. smartlist_free(no_longer_old);
  4137. }
  4138. /** How often should we launch a server/authority request to be sure of getting
  4139. * a guess for our IP? */
  4140. /*XXXX024 this info should come from netinfo cells or something, or we should
  4141. * do this only when we aren't seeing incoming data. see bug 652. */
  4142. #define DUMMY_DOWNLOAD_INTERVAL (20*60)
  4143. /** As needed, launch a dummy router descriptor fetch to see if our
  4144. * address has changed. */
  4145. static void
  4146. launch_dummy_descriptor_download_as_needed(time_t now,
  4147. const or_options_t *options)
  4148. {
  4149. static time_t last_dummy_download = 0;
  4150. /* XXXX024 we could be smarter here; see notes on bug 652. */
  4151. /* If we're a server that doesn't have a configured address, we rely on
  4152. * directory fetches to learn when our address changes. So if we haven't
  4153. * tried to get any routerdescs in a long time, try a dummy fetch now. */
  4154. if (!options->Address &&
  4155. server_mode(options) &&
  4156. last_descriptor_download_attempted + DUMMY_DOWNLOAD_INTERVAL < now &&
  4157. last_dummy_download + DUMMY_DOWNLOAD_INTERVAL < now) {
  4158. last_dummy_download = now;
  4159. directory_get_from_dirserver(DIR_PURPOSE_FETCH_SERVERDESC,
  4160. ROUTER_PURPOSE_GENERAL, "authority.z",
  4161. PDS_RETRY_IF_NO_SERVERS);
  4162. }
  4163. }
  4164. /** Launch downloads for router status as needed. */
  4165. void
  4166. update_router_descriptor_downloads(time_t now)
  4167. {
  4168. const or_options_t *options = get_options();
  4169. if (should_delay_dir_fetches(options, NULL))
  4170. return;
  4171. if (!we_fetch_router_descriptors(options))
  4172. return;
  4173. update_consensus_router_descriptor_downloads(now, 0,
  4174. networkstatus_get_reasonably_live_consensus(now, FLAV_NS));
  4175. }
  4176. /** Launch extrainfo downloads as needed. */
  4177. void
  4178. update_extrainfo_downloads(time_t now)
  4179. {
  4180. const or_options_t *options = get_options();
  4181. routerlist_t *rl;
  4182. smartlist_t *wanted;
  4183. digestmap_t *pending;
  4184. int old_routers, i, max_dl_per_req;
  4185. int n_no_ei = 0, n_pending = 0, n_have = 0, n_delay = 0, n_bogus[2] = {0,0};
  4186. if (! options->DownloadExtraInfo)
  4187. return;
  4188. if (should_delay_dir_fetches(options, NULL))
  4189. return;
  4190. if (!router_have_minimum_dir_info())
  4191. return;
  4192. pending = digestmap_new();
  4193. list_pending_descriptor_downloads(pending, 1);
  4194. rl = router_get_routerlist();
  4195. wanted = smartlist_new();
  4196. for (old_routers = 0; old_routers < 2; ++old_routers) {
  4197. smartlist_t *lst = old_routers ? rl->old_routers : rl->routers;
  4198. for (i = 0; i < smartlist_len(lst); ++i) {
  4199. signed_descriptor_t *sd;
  4200. char *d;
  4201. if (old_routers)
  4202. sd = smartlist_get(lst, i);
  4203. else
  4204. sd = &((routerinfo_t*)smartlist_get(lst, i))->cache_info;
  4205. if (sd->is_extrainfo)
  4206. continue; /* This should never happen. */
  4207. if (old_routers && !router_get_by_id_digest(sd->identity_digest))
  4208. continue; /* Couldn't check the signature if we got it. */
  4209. if (sd->extrainfo_is_bogus)
  4210. continue;
  4211. d = sd->extra_info_digest;
  4212. if (tor_digest_is_zero(d)) {
  4213. ++n_no_ei;
  4214. continue;
  4215. }
  4216. if (eimap_get(rl->extra_info_map, d)) {
  4217. ++n_have;
  4218. continue;
  4219. }
  4220. if (!download_status_is_ready(&sd->ei_dl_status, now,
  4221. options->TestingDescriptorMaxDownloadTries)) {
  4222. ++n_delay;
  4223. continue;
  4224. }
  4225. if (digestmap_get(pending, d)) {
  4226. ++n_pending;
  4227. continue;
  4228. }
  4229. const signed_descriptor_t *sd2 = router_get_by_extrainfo_digest(d);
  4230. if (sd2 != sd) {
  4231. if (sd2 != NULL) {
  4232. char d1[HEX_DIGEST_LEN+1], d2[HEX_DIGEST_LEN+1];
  4233. char d3[HEX_DIGEST_LEN+1], d4[HEX_DIGEST_LEN+1];
  4234. base16_encode(d1, sizeof(d1), sd->identity_digest, DIGEST_LEN);
  4235. base16_encode(d2, sizeof(d2), sd2->identity_digest, DIGEST_LEN);
  4236. base16_encode(d3, sizeof(d3), d, DIGEST_LEN);
  4237. base16_encode(d4, sizeof(d3), sd2->extra_info_digest, DIGEST_LEN);
  4238. log_info(LD_DIR, "Found an entry in %s with mismatched "
  4239. "router_get_by_extrainfo_digest() value. This has ID %s "
  4240. "but the entry in the map has ID %s. This has EI digest "
  4241. "%s and the entry in the map has EI digest %s.",
  4242. old_routers?"old_routers":"routers",
  4243. d1, d2, d3, d4);
  4244. } else {
  4245. char d1[HEX_DIGEST_LEN+1], d2[HEX_DIGEST_LEN+1];
  4246. base16_encode(d1, sizeof(d1), sd->identity_digest, DIGEST_LEN);
  4247. base16_encode(d2, sizeof(d2), d, DIGEST_LEN);
  4248. log_info(LD_DIR, "Found an entry in %s with NULL "
  4249. "router_get_by_extrainfo_digest() value. This has ID %s "
  4250. "and EI digest %s.",
  4251. old_routers?"old_routers":"routers",
  4252. d1, d2);
  4253. }
  4254. ++n_bogus[old_routers];
  4255. continue;
  4256. }
  4257. smartlist_add(wanted, d);
  4258. }
  4259. }
  4260. digestmap_free(pending, NULL);
  4261. log_info(LD_DIR, "Extrainfo download status: %d router with no ei, %d "
  4262. "with present ei, %d delaying, %d pending, %d downloadable, %d "
  4263. "bogus in routers, %d bogus in old_routers",
  4264. n_no_ei, n_have, n_delay, n_pending, smartlist_len(wanted),
  4265. n_bogus[0], n_bogus[1]);
  4266. smartlist_shuffle(wanted);
  4267. max_dl_per_req = max_dl_per_request(options, DIR_PURPOSE_FETCH_EXTRAINFO);
  4268. for (i = 0; i < smartlist_len(wanted); i += max_dl_per_req) {
  4269. initiate_descriptor_downloads(NULL, DIR_PURPOSE_FETCH_EXTRAINFO,
  4270. wanted, i, i+max_dl_per_req,
  4271. PDS_RETRY_IF_NO_SERVERS|PDS_NO_EXISTING_SERVERDESC_FETCH);
  4272. }
  4273. smartlist_free(wanted);
  4274. }
  4275. /** Reset the descriptor download failure count on all routers, so that we
  4276. * can retry any long-failed routers immediately.
  4277. */
  4278. void
  4279. router_reset_descriptor_download_failures(void)
  4280. {
  4281. networkstatus_reset_download_failures();
  4282. last_descriptor_download_attempted = 0;
  4283. if (!routerlist)
  4284. return;
  4285. SMARTLIST_FOREACH(routerlist->routers, routerinfo_t *, ri,
  4286. {
  4287. download_status_reset(&ri->cache_info.ei_dl_status);
  4288. });
  4289. SMARTLIST_FOREACH(routerlist->old_routers, signed_descriptor_t *, sd,
  4290. {
  4291. download_status_reset(&sd->ei_dl_status);
  4292. });
  4293. }
  4294. /** Any changes in a router descriptor's publication time larger than this are
  4295. * automatically non-cosmetic. */
  4296. #define ROUTER_MAX_COSMETIC_TIME_DIFFERENCE (2*60*60)
  4297. /** We allow uptime to vary from how much it ought to be by this much. */
  4298. #define ROUTER_ALLOW_UPTIME_DRIFT (6*60*60)
  4299. /** Return true iff the only differences between r1 and r2 are such that
  4300. * would not cause a recent (post 0.1.1.6) dirserver to republish.
  4301. */
  4302. int
  4303. router_differences_are_cosmetic(const routerinfo_t *r1, const routerinfo_t *r2)
  4304. {
  4305. time_t r1pub, r2pub;
  4306. long time_difference;
  4307. tor_assert(r1 && r2);
  4308. /* r1 should be the one that was published first. */
  4309. if (r1->cache_info.published_on > r2->cache_info.published_on) {
  4310. const routerinfo_t *ri_tmp = r2;
  4311. r2 = r1;
  4312. r1 = ri_tmp;
  4313. }
  4314. /* If any key fields differ, they're different. */
  4315. if (r1->addr != r2->addr ||
  4316. strcasecmp(r1->nickname, r2->nickname) ||
  4317. r1->or_port != r2->or_port ||
  4318. !tor_addr_eq(&r1->ipv6_addr, &r2->ipv6_addr) ||
  4319. r1->ipv6_orport != r2->ipv6_orport ||
  4320. r1->dir_port != r2->dir_port ||
  4321. r1->purpose != r2->purpose ||
  4322. !crypto_pk_eq_keys(r1->onion_pkey, r2->onion_pkey) ||
  4323. !crypto_pk_eq_keys(r1->identity_pkey, r2->identity_pkey) ||
  4324. strcasecmp(r1->platform, r2->platform) ||
  4325. (r1->contact_info && !r2->contact_info) || /* contact_info is optional */
  4326. (!r1->contact_info && r2->contact_info) ||
  4327. (r1->contact_info && r2->contact_info &&
  4328. strcasecmp(r1->contact_info, r2->contact_info)) ||
  4329. r1->is_hibernating != r2->is_hibernating ||
  4330. cmp_addr_policies(r1->exit_policy, r2->exit_policy))
  4331. return 0;
  4332. if ((r1->declared_family == NULL) != (r2->declared_family == NULL))
  4333. return 0;
  4334. if (r1->declared_family && r2->declared_family) {
  4335. int i, n;
  4336. if (smartlist_len(r1->declared_family)!=smartlist_len(r2->declared_family))
  4337. return 0;
  4338. n = smartlist_len(r1->declared_family);
  4339. for (i=0; i < n; ++i) {
  4340. if (strcasecmp(smartlist_get(r1->declared_family, i),
  4341. smartlist_get(r2->declared_family, i)))
  4342. return 0;
  4343. }
  4344. }
  4345. /* Did bandwidth change a lot? */
  4346. if ((r1->bandwidthcapacity < r2->bandwidthcapacity/2) ||
  4347. (r2->bandwidthcapacity < r1->bandwidthcapacity/2))
  4348. return 0;
  4349. /* Did the bandwidthrate or bandwidthburst change? */
  4350. if ((r1->bandwidthrate != r2->bandwidthrate) ||
  4351. (r1->bandwidthburst != r2->bandwidthburst))
  4352. return 0;
  4353. /* Did more than 12 hours pass? */
  4354. if (r1->cache_info.published_on + ROUTER_MAX_COSMETIC_TIME_DIFFERENCE
  4355. < r2->cache_info.published_on)
  4356. return 0;
  4357. /* Did uptime fail to increase by approximately the amount we would think,
  4358. * give or take some slop? */
  4359. r1pub = r1->cache_info.published_on;
  4360. r2pub = r2->cache_info.published_on;
  4361. time_difference = labs(r2->uptime - (r1->uptime + (r2pub - r1pub)));
  4362. if (time_difference > ROUTER_ALLOW_UPTIME_DRIFT &&
  4363. time_difference > r1->uptime * .05 &&
  4364. time_difference > r2->uptime * .05)
  4365. return 0;
  4366. /* Otherwise, the difference is cosmetic. */
  4367. return 1;
  4368. }
  4369. /** Check whether <b>ri</b> (a.k.a. sd) is a router compatible with the
  4370. * extrainfo document
  4371. * <b>ei</b>. If no router is compatible with <b>ei</b>, <b>ei</b> should be
  4372. * dropped. Return 0 for "compatible", return 1 for "reject, and inform
  4373. * whoever uploaded <b>ei</b>, and return -1 for "reject silently.". If
  4374. * <b>msg</b> is present, set *<b>msg</b> to a description of the
  4375. * incompatibility (if any).
  4376. **/
  4377. int
  4378. routerinfo_incompatible_with_extrainfo(const routerinfo_t *ri,
  4379. extrainfo_t *ei,
  4380. signed_descriptor_t *sd,
  4381. const char **msg)
  4382. {
  4383. int digest_matches, digest256_matches, r=1;
  4384. tor_assert(ri);
  4385. tor_assert(ei);
  4386. if (!sd)
  4387. sd = (signed_descriptor_t*)&ri->cache_info;
  4388. if (ei->bad_sig) {
  4389. if (msg) *msg = "Extrainfo signature was bad, or signed with wrong key.";
  4390. return 1;
  4391. }
  4392. digest_matches = tor_memeq(ei->cache_info.signed_descriptor_digest,
  4393. sd->extra_info_digest, DIGEST_LEN);
  4394. /* Set digest256_matches to 1 if the digest is correct, or if no
  4395. * digest256 was in the ri. */
  4396. digest256_matches = tor_memeq(ei->digest256,
  4397. ri->extra_info_digest256, DIGEST256_LEN);
  4398. digest256_matches |=
  4399. tor_mem_is_zero(ri->extra_info_digest256, DIGEST256_LEN);
  4400. /* The identity must match exactly to have been generated at the same time
  4401. * by the same router. */
  4402. if (tor_memneq(ri->cache_info.identity_digest,
  4403. ei->cache_info.identity_digest,
  4404. DIGEST_LEN)) {
  4405. if (msg) *msg = "Extrainfo nickname or identity did not match routerinfo";
  4406. goto err; /* different servers */
  4407. }
  4408. if (! tor_cert_opt_eq(ri->signing_key_cert, ei->signing_key_cert)) {
  4409. if (msg) *msg = "Extrainfo signing key cert didn't match routerinfo";
  4410. goto err; /* different servers */
  4411. }
  4412. if (ei->pending_sig) {
  4413. char signed_digest[128];
  4414. if (crypto_pk_public_checksig(ri->identity_pkey,
  4415. signed_digest, sizeof(signed_digest),
  4416. ei->pending_sig, ei->pending_sig_len) != DIGEST_LEN ||
  4417. tor_memneq(signed_digest, ei->cache_info.signed_descriptor_digest,
  4418. DIGEST_LEN)) {
  4419. ei->bad_sig = 1;
  4420. tor_free(ei->pending_sig);
  4421. if (msg) *msg = "Extrainfo signature bad, or signed with wrong key";
  4422. goto err; /* Bad signature, or no match. */
  4423. }
  4424. ei->cache_info.send_unencrypted = ri->cache_info.send_unencrypted;
  4425. tor_free(ei->pending_sig);
  4426. }
  4427. if (ei->cache_info.published_on < sd->published_on) {
  4428. if (msg) *msg = "Extrainfo published time did not match routerdesc";
  4429. goto err;
  4430. } else if (ei->cache_info.published_on > sd->published_on) {
  4431. if (msg) *msg = "Extrainfo published time did not match routerdesc";
  4432. r = -1;
  4433. goto err;
  4434. }
  4435. if (!digest256_matches && !digest_matches) {
  4436. if (msg) *msg = "Neither digest256 or digest matched "
  4437. "digest from routerdesc";
  4438. goto err;
  4439. }
  4440. if (!digest256_matches) {
  4441. if (msg) *msg = "Extrainfo digest did not match digest256 from routerdesc";
  4442. goto err; /* Digest doesn't match declared value. */
  4443. }
  4444. if (!digest_matches) {
  4445. if (msg) *msg = "Extrainfo digest did not match value from routerdesc";
  4446. goto err; /* Digest doesn't match declared value. */
  4447. }
  4448. return 0;
  4449. err:
  4450. if (digest_matches) {
  4451. /* This signature was okay, and the digest was right: This is indeed the
  4452. * corresponding extrainfo. But insanely, it doesn't match the routerinfo
  4453. * that lists it. Don't try to fetch this one again. */
  4454. sd->extrainfo_is_bogus = 1;
  4455. }
  4456. return r;
  4457. }
  4458. /** Assert that the internal representation of <b>rl</b> is
  4459. * self-consistent. */
  4460. void
  4461. routerlist_assert_ok(const routerlist_t *rl)
  4462. {
  4463. routerinfo_t *r2;
  4464. signed_descriptor_t *sd2;
  4465. if (!rl)
  4466. return;
  4467. SMARTLIST_FOREACH_BEGIN(rl->routers, routerinfo_t *, r) {
  4468. r2 = rimap_get(rl->identity_map, r->cache_info.identity_digest);
  4469. tor_assert(r == r2);
  4470. sd2 = sdmap_get(rl->desc_digest_map,
  4471. r->cache_info.signed_descriptor_digest);
  4472. tor_assert(&(r->cache_info) == sd2);
  4473. tor_assert(r->cache_info.routerlist_index == r_sl_idx);
  4474. /* XXXX
  4475. *
  4476. * Hoo boy. We need to fix this one, and the fix is a bit tricky, so
  4477. * commenting this out is just a band-aid.
  4478. *
  4479. * The problem is that, although well-behaved router descriptors
  4480. * should never have the same value for their extra_info_digest, it's
  4481. * possible for ill-behaved routers to claim whatever they like there.
  4482. *
  4483. * The real answer is to trash desc_by_eid_map and instead have
  4484. * something that indicates for a given extra-info digest we want,
  4485. * what its download status is. We'll do that as a part of routerlist
  4486. * refactoring once consensus directories are in. For now,
  4487. * this rep violation is probably harmless: an adversary can make us
  4488. * reset our retry count for an extrainfo, but that's not the end
  4489. * of the world. Changing the representation in 0.2.0.x would just
  4490. * destabilize the codebase.
  4491. if (!tor_digest_is_zero(r->cache_info.extra_info_digest)) {
  4492. signed_descriptor_t *sd3 =
  4493. sdmap_get(rl->desc_by_eid_map, r->cache_info.extra_info_digest);
  4494. tor_assert(sd3 == &(r->cache_info));
  4495. }
  4496. */
  4497. } SMARTLIST_FOREACH_END(r);
  4498. SMARTLIST_FOREACH_BEGIN(rl->old_routers, signed_descriptor_t *, sd) {
  4499. r2 = rimap_get(rl->identity_map, sd->identity_digest);
  4500. tor_assert(!r2 || sd != &(r2->cache_info));
  4501. sd2 = sdmap_get(rl->desc_digest_map, sd->signed_descriptor_digest);
  4502. tor_assert(sd == sd2);
  4503. tor_assert(sd->routerlist_index == sd_sl_idx);
  4504. /* XXXX see above.
  4505. if (!tor_digest_is_zero(sd->extra_info_digest)) {
  4506. signed_descriptor_t *sd3 =
  4507. sdmap_get(rl->desc_by_eid_map, sd->extra_info_digest);
  4508. tor_assert(sd3 == sd);
  4509. }
  4510. */
  4511. } SMARTLIST_FOREACH_END(sd);
  4512. RIMAP_FOREACH(rl->identity_map, d, r) {
  4513. tor_assert(tor_memeq(r->cache_info.identity_digest, d, DIGEST_LEN));
  4514. } DIGESTMAP_FOREACH_END;
  4515. SDMAP_FOREACH(rl->desc_digest_map, d, sd) {
  4516. tor_assert(tor_memeq(sd->signed_descriptor_digest, d, DIGEST_LEN));
  4517. } DIGESTMAP_FOREACH_END;
  4518. SDMAP_FOREACH(rl->desc_by_eid_map, d, sd) {
  4519. tor_assert(!tor_digest_is_zero(d));
  4520. tor_assert(sd);
  4521. tor_assert(tor_memeq(sd->extra_info_digest, d, DIGEST_LEN));
  4522. } DIGESTMAP_FOREACH_END;
  4523. EIMAP_FOREACH(rl->extra_info_map, d, ei) {
  4524. signed_descriptor_t *sd;
  4525. tor_assert(tor_memeq(ei->cache_info.signed_descriptor_digest,
  4526. d, DIGEST_LEN));
  4527. sd = sdmap_get(rl->desc_by_eid_map,
  4528. ei->cache_info.signed_descriptor_digest);
  4529. // tor_assert(sd); // XXXX see above
  4530. if (sd) {
  4531. tor_assert(tor_memeq(ei->cache_info.signed_descriptor_digest,
  4532. sd->extra_info_digest, DIGEST_LEN));
  4533. }
  4534. } DIGESTMAP_FOREACH_END;
  4535. }
  4536. /** Allocate and return a new string representing the contact info
  4537. * and platform string for <b>router</b>,
  4538. * surrounded by quotes and using standard C escapes.
  4539. *
  4540. * THIS FUNCTION IS NOT REENTRANT. Don't call it from outside the main
  4541. * thread. Also, each call invalidates the last-returned value, so don't
  4542. * try log_warn(LD_GENERAL, "%s %s", esc_router_info(a), esc_router_info(b));
  4543. *
  4544. * If <b>router</b> is NULL, it just frees its internal memory and returns.
  4545. */
  4546. const char *
  4547. esc_router_info(const routerinfo_t *router)
  4548. {
  4549. static char *info=NULL;
  4550. char *esc_contact, *esc_platform;
  4551. tor_free(info);
  4552. if (!router)
  4553. return NULL; /* we're exiting; just free the memory we use */
  4554. esc_contact = esc_for_log(router->contact_info);
  4555. esc_platform = esc_for_log(router->platform);
  4556. tor_asprintf(&info, "Contact %s, Platform %s", esc_contact, esc_platform);
  4557. tor_free(esc_contact);
  4558. tor_free(esc_platform);
  4559. return info;
  4560. }
  4561. /** Helper for sorting: compare two routerinfos by their identity
  4562. * digest. */
  4563. static int
  4564. compare_routerinfo_by_id_digest_(const void **a, const void **b)
  4565. {
  4566. routerinfo_t *first = *(routerinfo_t **)a, *second = *(routerinfo_t **)b;
  4567. return fast_memcmp(first->cache_info.identity_digest,
  4568. second->cache_info.identity_digest,
  4569. DIGEST_LEN);
  4570. }
  4571. /** Sort a list of routerinfo_t in ascending order of identity digest. */
  4572. void
  4573. routers_sort_by_identity(smartlist_t *routers)
  4574. {
  4575. smartlist_sort(routers, compare_routerinfo_by_id_digest_);
  4576. }
  4577. /** Called when we change a node set, or when we reload the geoip IPv4 list:
  4578. * recompute all country info in all configuration node sets and in the
  4579. * routerlist. */
  4580. void
  4581. refresh_all_country_info(void)
  4582. {
  4583. const or_options_t *options = get_options();
  4584. if (options->EntryNodes)
  4585. routerset_refresh_countries(options->EntryNodes);
  4586. if (options->ExitNodes)
  4587. routerset_refresh_countries(options->ExitNodes);
  4588. if (options->ExcludeNodes)
  4589. routerset_refresh_countries(options->ExcludeNodes);
  4590. if (options->ExcludeExitNodes)
  4591. routerset_refresh_countries(options->ExcludeExitNodes);
  4592. if (options->ExcludeExitNodesUnion_)
  4593. routerset_refresh_countries(options->ExcludeExitNodesUnion_);
  4594. nodelist_refresh_countries();
  4595. }
  4596. /** Determine the routers that are responsible for <b>id</b> (binary) and
  4597. * add pointers to those routers' routerstatus_t to <b>responsible_dirs</b>.
  4598. * Return -1 if we're returning an empty smartlist, else return 0.
  4599. */
  4600. int
  4601. hid_serv_get_responsible_directories(smartlist_t *responsible_dirs,
  4602. const char *id)
  4603. {
  4604. int start, found, n_added = 0, i;
  4605. networkstatus_t *c = networkstatus_get_latest_consensus();
  4606. if (!c || !smartlist_len(c->routerstatus_list)) {
  4607. log_warn(LD_REND, "We don't have a consensus, so we can't perform v2 "
  4608. "rendezvous operations.");
  4609. return -1;
  4610. }
  4611. tor_assert(id);
  4612. start = networkstatus_vote_find_entry_idx(c, id, &found);
  4613. if (start == smartlist_len(c->routerstatus_list)) start = 0;
  4614. i = start;
  4615. do {
  4616. routerstatus_t *r = smartlist_get(c->routerstatus_list, i);
  4617. if (r->is_hs_dir) {
  4618. smartlist_add(responsible_dirs, r);
  4619. if (++n_added == REND_NUMBER_OF_CONSECUTIVE_REPLICAS)
  4620. return 0;
  4621. }
  4622. if (++i == smartlist_len(c->routerstatus_list))
  4623. i = 0;
  4624. } while (i != start);
  4625. /* Even though we don't have the desired number of hidden service
  4626. * directories, be happy if we got any. */
  4627. return smartlist_len(responsible_dirs) ? 0 : -1;
  4628. }
  4629. /** Return true if this node is currently acting as hidden service
  4630. * directory, false otherwise. */
  4631. int
  4632. hid_serv_acting_as_directory(void)
  4633. {
  4634. const routerinfo_t *me = router_get_my_routerinfo();
  4635. if (!me)
  4636. return 0;
  4637. return 1;
  4638. }
  4639. /** Return true if this node is responsible for storing the descriptor ID
  4640. * in <b>query</b> and false otherwise. */
  4641. MOCK_IMPL(int, hid_serv_responsible_for_desc_id,
  4642. (const char *query))
  4643. {
  4644. const routerinfo_t *me;
  4645. routerstatus_t *last_rs;
  4646. const char *my_id, *last_id;
  4647. int result;
  4648. smartlist_t *responsible;
  4649. if (!hid_serv_acting_as_directory())
  4650. return 0;
  4651. if (!(me = router_get_my_routerinfo()))
  4652. return 0; /* This is redundant, but let's be paranoid. */
  4653. my_id = me->cache_info.identity_digest;
  4654. responsible = smartlist_new();
  4655. if (hid_serv_get_responsible_directories(responsible, query) < 0) {
  4656. smartlist_free(responsible);
  4657. return 0;
  4658. }
  4659. last_rs = smartlist_get(responsible, smartlist_len(responsible)-1);
  4660. last_id = last_rs->identity_digest;
  4661. result = rend_id_is_in_interval(my_id, query, last_id);
  4662. smartlist_free(responsible);
  4663. return result;
  4664. }