routerlist.c 171 KB

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