routerlist.c 181 KB

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