routerlist.c 204 KB

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