routerlist.c 171 KB

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