routerlist.c 174 KB

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