routerlist.c 177 KB

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