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