routerlist.c 179 KB

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