routerparse.c 210 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267526852695270527152725273527452755276527752785279528052815282528352845285528652875288528952905291529252935294529552965297529852995300530153025303530453055306530753085309531053115312531353145315531653175318531953205321532253235324532553265327532853295330533153325333533453355336533753385339534053415342534353445345534653475348534953505351535253535354535553565357535853595360536153625363536453655366536753685369537053715372537353745375537653775378537953805381538253835384538553865387538853895390539153925393539453955396539753985399540054015402540354045405540654075408540954105411541254135414541554165417541854195420542154225423542454255426542754285429543054315432543354345435543654375438543954405441544254435444544554465447544854495450545154525453545454555456545754585459546054615462546354645465546654675468546954705471547254735474547554765477547854795480548154825483548454855486548754885489549054915492549354945495549654975498549955005501550255035504550555065507550855095510551155125513551455155516551755185519552055215522552355245525552655275528552955305531553255335534553555365537553855395540554155425543554455455546554755485549555055515552555355545555555655575558555955605561556255635564556555665567556855695570557155725573557455755576557755785579558055815582558355845585558655875588558955905591559255935594559555965597559855995600560156025603560456055606560756085609561056115612561356145615561656175618561956205621562256235624562556265627562856295630563156325633563456355636563756385639564056415642564356445645564656475648564956505651565256535654565556565657565856595660566156625663566456655666566756685669567056715672567356745675567656775678567956805681568256835684568556865687568856895690569156925693569456955696569756985699570057015702570357045705570657075708570957105711571257135714571557165717571857195720572157225723572457255726572757285729573057315732573357345735573657375738573957405741574257435744574557465747574857495750575157525753575457555756575757585759576057615762576357645765576657675768576957705771577257735774577557765777577857795780578157825783578457855786578757885789579057915792579357945795579657975798579958005801580258035804580558065807580858095810581158125813581458155816581758185819582058215822582358245825582658275828582958305831583258335834583558365837583858395840584158425843584458455846584758485849585058515852585358545855585658575858585958605861586258635864586558665867586858695870587158725873587458755876587758785879588058815882588358845885588658875888588958905891589258935894589558965897589858995900590159025903590459055906590759085909591059115912591359145915591659175918591959205921592259235924592559265927592859295930593159325933593459355936593759385939594059415942594359445945594659475948594959505951595259535954595559565957595859595960596159625963596459655966596759685969597059715972597359745975597659775978597959805981598259835984598559865987598859895990599159925993599459955996599759985999600060016002600360046005600660076008600960106011601260136014601560166017601860196020602160226023602460256026602760286029603060316032603360346035603660376038603960406041604260436044604560466047604860496050605160526053605460556056605760586059606060616062606360646065606660676068606960706071607260736074607560766077607860796080608160826083608460856086608760886089609060916092609360946095609660976098609961006101610261036104610561066107610861096110611161126113611461156116611761186119612061216122612361246125612661276128612961306131613261336134613561366137613861396140614161426143614461456146614761486149615061516152615361546155615661576158615961606161616261636164616561666167616861696170617161726173617461756176617761786179618061816182618361846185618661876188618961906191619261936194619561966197619861996200
  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-2016, The Tor Project, Inc. */
  5. /* See LICENSE for licensing information */
  6. /**
  7. * \file routerparse.c
  8. * \brief Code to parse and validate router descriptors and directories.
  9. **/
  10. #define ROUTERPARSE_PRIVATE
  11. #include "or.h"
  12. #include "config.h"
  13. #include "circuitstats.h"
  14. #include "dirserv.h"
  15. #include "dirvote.h"
  16. #include "policies.h"
  17. #include "rendcommon.h"
  18. #include "router.h"
  19. #include "routerlist.h"
  20. #include "memarea.h"
  21. #include "microdesc.h"
  22. #include "networkstatus.h"
  23. #include "rephist.h"
  24. #include "routerkeys.h"
  25. #include "routerparse.h"
  26. #include "entrynodes.h"
  27. #include "torcert.h"
  28. #include "sandbox.h"
  29. #include "shared_random.h"
  30. #undef log
  31. #include <math.h>
  32. /****************************************************************************/
  33. /** Enumeration of possible token types. The ones starting with K_ correspond
  34. * to directory 'keywords'. A_ is for an annotation, R or C is related to
  35. * hidden services, ERR_ is an error in the tokenizing process, EOF_ is an
  36. * end-of-file marker, and NIL_ is used to encode not-a-token.
  37. */
  38. typedef enum {
  39. K_ACCEPT = 0,
  40. K_ACCEPT6,
  41. K_DIRECTORY_SIGNATURE,
  42. K_RECOMMENDED_SOFTWARE,
  43. K_REJECT,
  44. K_REJECT6,
  45. K_ROUTER,
  46. K_SIGNED_DIRECTORY,
  47. K_SIGNING_KEY,
  48. K_ONION_KEY,
  49. K_ONION_KEY_NTOR,
  50. K_ROUTER_SIGNATURE,
  51. K_PUBLISHED,
  52. K_RUNNING_ROUTERS,
  53. K_ROUTER_STATUS,
  54. K_PLATFORM,
  55. K_OPT,
  56. K_BANDWIDTH,
  57. K_CONTACT,
  58. K_NETWORK_STATUS,
  59. K_UPTIME,
  60. K_DIR_SIGNING_KEY,
  61. K_FAMILY,
  62. K_FINGERPRINT,
  63. K_HIBERNATING,
  64. K_READ_HISTORY,
  65. K_WRITE_HISTORY,
  66. K_NETWORK_STATUS_VERSION,
  67. K_DIR_SOURCE,
  68. K_DIR_OPTIONS,
  69. K_CLIENT_VERSIONS,
  70. K_SERVER_VERSIONS,
  71. K_OR_ADDRESS,
  72. K_ID,
  73. K_P,
  74. K_P6,
  75. K_R,
  76. K_A,
  77. K_S,
  78. K_V,
  79. K_W,
  80. K_M,
  81. K_EXTRA_INFO,
  82. K_EXTRA_INFO_DIGEST,
  83. K_CACHES_EXTRA_INFO,
  84. K_HIDDEN_SERVICE_DIR,
  85. K_ALLOW_SINGLE_HOP_EXITS,
  86. K_IPV6_POLICY,
  87. K_ROUTER_SIG_ED25519,
  88. K_IDENTITY_ED25519,
  89. K_MASTER_KEY_ED25519,
  90. K_ONION_KEY_CROSSCERT,
  91. K_NTOR_ONION_KEY_CROSSCERT,
  92. K_DIRREQ_END,
  93. K_DIRREQ_V2_IPS,
  94. K_DIRREQ_V3_IPS,
  95. K_DIRREQ_V2_REQS,
  96. K_DIRREQ_V3_REQS,
  97. K_DIRREQ_V2_SHARE,
  98. K_DIRREQ_V3_SHARE,
  99. K_DIRREQ_V2_RESP,
  100. K_DIRREQ_V3_RESP,
  101. K_DIRREQ_V2_DIR,
  102. K_DIRREQ_V3_DIR,
  103. K_DIRREQ_V2_TUN,
  104. K_DIRREQ_V3_TUN,
  105. K_ENTRY_END,
  106. K_ENTRY_IPS,
  107. K_CELL_END,
  108. K_CELL_PROCESSED,
  109. K_CELL_QUEUED,
  110. K_CELL_TIME,
  111. K_CELL_CIRCS,
  112. K_EXIT_END,
  113. K_EXIT_WRITTEN,
  114. K_EXIT_READ,
  115. K_EXIT_OPENED,
  116. K_DIR_KEY_CERTIFICATE_VERSION,
  117. K_DIR_IDENTITY_KEY,
  118. K_DIR_KEY_PUBLISHED,
  119. K_DIR_KEY_EXPIRES,
  120. K_DIR_KEY_CERTIFICATION,
  121. K_DIR_KEY_CROSSCERT,
  122. K_DIR_ADDRESS,
  123. K_DIR_TUNNELLED,
  124. K_VOTE_STATUS,
  125. K_VALID_AFTER,
  126. K_FRESH_UNTIL,
  127. K_VALID_UNTIL,
  128. K_VOTING_DELAY,
  129. K_KNOWN_FLAGS,
  130. K_PARAMS,
  131. K_BW_WEIGHTS,
  132. K_VOTE_DIGEST,
  133. K_CONSENSUS_DIGEST,
  134. K_ADDITIONAL_DIGEST,
  135. K_ADDITIONAL_SIGNATURE,
  136. K_CONSENSUS_METHODS,
  137. K_CONSENSUS_METHOD,
  138. K_LEGACY_DIR_KEY,
  139. K_DIRECTORY_FOOTER,
  140. K_SIGNING_CERT_ED,
  141. K_SR_FLAG,
  142. K_COMMIT,
  143. K_PREVIOUS_SRV,
  144. K_CURRENT_SRV,
  145. K_PACKAGE,
  146. A_PURPOSE,
  147. A_LAST_LISTED,
  148. A_UNKNOWN_,
  149. R_RENDEZVOUS_SERVICE_DESCRIPTOR,
  150. R_VERSION,
  151. R_PERMANENT_KEY,
  152. R_SECRET_ID_PART,
  153. R_PUBLICATION_TIME,
  154. R_PROTOCOL_VERSIONS,
  155. R_INTRODUCTION_POINTS,
  156. R_SIGNATURE,
  157. R_IPO_IDENTIFIER,
  158. R_IPO_IP_ADDRESS,
  159. R_IPO_ONION_PORT,
  160. R_IPO_ONION_KEY,
  161. R_IPO_SERVICE_KEY,
  162. C_CLIENT_NAME,
  163. C_DESCRIPTOR_COOKIE,
  164. C_CLIENT_KEY,
  165. ERR_,
  166. EOF_,
  167. NIL_
  168. } directory_keyword;
  169. #define MIN_ANNOTATION A_PURPOSE
  170. #define MAX_ANNOTATION A_UNKNOWN_
  171. /** Structure to hold a single directory token.
  172. *
  173. * We parse a directory by breaking it into "tokens", each consisting
  174. * of a keyword, a line full of arguments, and a binary object. The
  175. * arguments and object are both optional, depending on the keyword
  176. * type.
  177. *
  178. * This structure is only allocated in memareas; do not allocate it on
  179. * the heap, or token_clear() won't work.
  180. */
  181. typedef struct directory_token_t {
  182. directory_keyword tp; /**< Type of the token. */
  183. int n_args:30; /**< Number of elements in args */
  184. char **args; /**< Array of arguments from keyword line. */
  185. char *object_type; /**< -----BEGIN [object_type]-----*/
  186. size_t object_size; /**< Bytes in object_body */
  187. char *object_body; /**< Contents of object, base64-decoded. */
  188. crypto_pk_t *key; /**< For public keys only. Heap-allocated. */
  189. char *error; /**< For ERR_ tokens only. */
  190. } directory_token_t;
  191. /* ********************************************************************** */
  192. /** We use a table of rules to decide how to parse each token type. */
  193. /** Rules for whether the keyword needs an object. */
  194. typedef enum {
  195. NO_OBJ, /**< No object, ever. */
  196. NEED_OBJ, /**< Object is required. */
  197. NEED_SKEY_1024,/**< Object is required, and must be a 1024 bit private key */
  198. NEED_KEY_1024, /**< Object is required, and must be a 1024 bit public key */
  199. NEED_KEY, /**< Object is required, and must be a public key. */
  200. OBJ_OK, /**< Object is optional. */
  201. } obj_syntax;
  202. #define AT_START 1
  203. #define AT_END 2
  204. /** Determines the parsing rules for a single token type. */
  205. typedef struct token_rule_t {
  206. /** The string value of the keyword identifying the type of item. */
  207. const char *t;
  208. /** The corresponding directory_keyword enum. */
  209. directory_keyword v;
  210. /** Minimum number of arguments for this item */
  211. int min_args;
  212. /** Maximum number of arguments for this item */
  213. int max_args;
  214. /** If true, we concatenate all arguments for this item into a single
  215. * string. */
  216. int concat_args;
  217. /** Requirements on object syntax for this item. */
  218. obj_syntax os;
  219. /** Lowest number of times this item may appear in a document. */
  220. int min_cnt;
  221. /** Highest number of times this item may appear in a document. */
  222. int max_cnt;
  223. /** One or more of AT_START/AT_END to limit where the item may appear in a
  224. * document. */
  225. int pos;
  226. /** True iff this token is an annotation. */
  227. int is_annotation;
  228. } token_rule_t;
  229. /*
  230. * Helper macros to define token tables. 's' is a string, 't' is a
  231. * directory_keyword, 'a' is a trio of argument multiplicities, and 'o' is an
  232. * object syntax.
  233. *
  234. */
  235. /** Appears to indicate the end of a table. */
  236. #define END_OF_TABLE { NULL, NIL_, 0,0,0, NO_OBJ, 0, INT_MAX, 0, 0 }
  237. /** An item with no restrictions: used for obsolete document types */
  238. #define T(s,t,a,o) { s, t, a, o, 0, INT_MAX, 0, 0 }
  239. /** An item with no restrictions on multiplicity or location. */
  240. #define T0N(s,t,a,o) { s, t, a, o, 0, INT_MAX, 0, 0 }
  241. /** An item that must appear exactly once */
  242. #define T1(s,t,a,o) { s, t, a, o, 1, 1, 0, 0 }
  243. /** An item that must appear exactly once, at the start of the document */
  244. #define T1_START(s,t,a,o) { s, t, a, o, 1, 1, AT_START, 0 }
  245. /** An item that must appear exactly once, at the end of the document */
  246. #define T1_END(s,t,a,o) { s, t, a, o, 1, 1, AT_END, 0 }
  247. /** An item that must appear one or more times */
  248. #define T1N(s,t,a,o) { s, t, a, o, 1, INT_MAX, 0, 0 }
  249. /** An item that must appear no more than once */
  250. #define T01(s,t,a,o) { s, t, a, o, 0, 1, 0, 0 }
  251. /** An annotation that must appear no more than once */
  252. #define A01(s,t,a,o) { s, t, a, o, 0, 1, 0, 1 }
  253. /* Argument multiplicity: any number of arguments. */
  254. #define ARGS 0,INT_MAX,0
  255. /* Argument multiplicity: no arguments. */
  256. #define NO_ARGS 0,0,0
  257. /* Argument multiplicity: concatenate all arguments. */
  258. #define CONCAT_ARGS 1,1,1
  259. /* Argument multiplicity: at least <b>n</b> arguments. */
  260. #define GE(n) n,INT_MAX,0
  261. /* Argument multiplicity: exactly <b>n</b> arguments. */
  262. #define EQ(n) n,n,0
  263. /** List of tokens recognized in router descriptors */
  264. static token_rule_t routerdesc_token_table[] = {
  265. T0N("reject", K_REJECT, ARGS, NO_OBJ ),
  266. T0N("accept", K_ACCEPT, ARGS, NO_OBJ ),
  267. T0N("reject6", K_REJECT6, ARGS, NO_OBJ ),
  268. T0N("accept6", K_ACCEPT6, ARGS, NO_OBJ ),
  269. T1_START( "router", K_ROUTER, GE(5), NO_OBJ ),
  270. T01("ipv6-policy", K_IPV6_POLICY, CONCAT_ARGS, NO_OBJ),
  271. T1( "signing-key", K_SIGNING_KEY, NO_ARGS, NEED_KEY_1024 ),
  272. T1( "onion-key", K_ONION_KEY, NO_ARGS, NEED_KEY_1024 ),
  273. T01("ntor-onion-key", K_ONION_KEY_NTOR, GE(1), NO_OBJ ),
  274. T1_END( "router-signature", K_ROUTER_SIGNATURE, NO_ARGS, NEED_OBJ ),
  275. T1( "published", K_PUBLISHED, CONCAT_ARGS, NO_OBJ ),
  276. T01("uptime", K_UPTIME, GE(1), NO_OBJ ),
  277. T01("fingerprint", K_FINGERPRINT, CONCAT_ARGS, NO_OBJ ),
  278. T01("hibernating", K_HIBERNATING, GE(1), NO_OBJ ),
  279. T01("platform", K_PLATFORM, CONCAT_ARGS, NO_OBJ ),
  280. T01("contact", K_CONTACT, CONCAT_ARGS, NO_OBJ ),
  281. T01("read-history", K_READ_HISTORY, ARGS, NO_OBJ ),
  282. T01("write-history", K_WRITE_HISTORY, ARGS, NO_OBJ ),
  283. T01("extra-info-digest", K_EXTRA_INFO_DIGEST, GE(1), NO_OBJ ),
  284. T01("hidden-service-dir", K_HIDDEN_SERVICE_DIR, NO_ARGS, NO_OBJ ),
  285. T01("identity-ed25519", K_IDENTITY_ED25519, NO_ARGS, NEED_OBJ ),
  286. T01("master-key-ed25519", K_MASTER_KEY_ED25519, GE(1), NO_OBJ ),
  287. T01("router-sig-ed25519", K_ROUTER_SIG_ED25519, GE(1), NO_OBJ ),
  288. T01("onion-key-crosscert", K_ONION_KEY_CROSSCERT, NO_ARGS, NEED_OBJ ),
  289. T01("ntor-onion-key-crosscert", K_NTOR_ONION_KEY_CROSSCERT,
  290. EQ(1), NEED_OBJ ),
  291. T01("allow-single-hop-exits",K_ALLOW_SINGLE_HOP_EXITS, NO_ARGS, NO_OBJ ),
  292. T01("family", K_FAMILY, ARGS, NO_OBJ ),
  293. T01("caches-extra-info", K_CACHES_EXTRA_INFO, NO_ARGS, NO_OBJ ),
  294. T0N("or-address", K_OR_ADDRESS, GE(1), NO_OBJ ),
  295. T0N("opt", K_OPT, CONCAT_ARGS, OBJ_OK ),
  296. T1( "bandwidth", K_BANDWIDTH, GE(3), NO_OBJ ),
  297. A01("@purpose", A_PURPOSE, GE(1), NO_OBJ ),
  298. T01("tunnelled-dir-server",K_DIR_TUNNELLED, NO_ARGS, NO_OBJ ),
  299. END_OF_TABLE
  300. };
  301. /** List of tokens recognized in extra-info documents. */
  302. static token_rule_t extrainfo_token_table[] = {
  303. T1_END( "router-signature", K_ROUTER_SIGNATURE, NO_ARGS, NEED_OBJ ),
  304. T1( "published", K_PUBLISHED, CONCAT_ARGS, NO_OBJ ),
  305. T01("identity-ed25519", K_IDENTITY_ED25519, NO_ARGS, NEED_OBJ ),
  306. T01("router-sig-ed25519", K_ROUTER_SIG_ED25519, GE(1), NO_OBJ ),
  307. T0N("opt", K_OPT, CONCAT_ARGS, OBJ_OK ),
  308. T01("read-history", K_READ_HISTORY, ARGS, NO_OBJ ),
  309. T01("write-history", K_WRITE_HISTORY, ARGS, NO_OBJ ),
  310. T01("dirreq-stats-end", K_DIRREQ_END, ARGS, NO_OBJ ),
  311. T01("dirreq-v2-ips", K_DIRREQ_V2_IPS, ARGS, NO_OBJ ),
  312. T01("dirreq-v3-ips", K_DIRREQ_V3_IPS, ARGS, NO_OBJ ),
  313. T01("dirreq-v2-reqs", K_DIRREQ_V2_REQS, ARGS, NO_OBJ ),
  314. T01("dirreq-v3-reqs", K_DIRREQ_V3_REQS, ARGS, NO_OBJ ),
  315. T01("dirreq-v2-share", K_DIRREQ_V2_SHARE, ARGS, NO_OBJ ),
  316. T01("dirreq-v3-share", K_DIRREQ_V3_SHARE, ARGS, NO_OBJ ),
  317. T01("dirreq-v2-resp", K_DIRREQ_V2_RESP, ARGS, NO_OBJ ),
  318. T01("dirreq-v3-resp", K_DIRREQ_V3_RESP, ARGS, NO_OBJ ),
  319. T01("dirreq-v2-direct-dl", K_DIRREQ_V2_DIR, ARGS, NO_OBJ ),
  320. T01("dirreq-v3-direct-dl", K_DIRREQ_V3_DIR, ARGS, NO_OBJ ),
  321. T01("dirreq-v2-tunneled-dl", K_DIRREQ_V2_TUN, ARGS, NO_OBJ ),
  322. T01("dirreq-v3-tunneled-dl", K_DIRREQ_V3_TUN, ARGS, NO_OBJ ),
  323. T01("entry-stats-end", K_ENTRY_END, ARGS, NO_OBJ ),
  324. T01("entry-ips", K_ENTRY_IPS, ARGS, NO_OBJ ),
  325. T01("cell-stats-end", K_CELL_END, ARGS, NO_OBJ ),
  326. T01("cell-processed-cells", K_CELL_PROCESSED, ARGS, NO_OBJ ),
  327. T01("cell-queued-cells", K_CELL_QUEUED, ARGS, NO_OBJ ),
  328. T01("cell-time-in-queue", K_CELL_TIME, ARGS, NO_OBJ ),
  329. T01("cell-circuits-per-decile", K_CELL_CIRCS, ARGS, NO_OBJ ),
  330. T01("exit-stats-end", K_EXIT_END, ARGS, NO_OBJ ),
  331. T01("exit-kibibytes-written", K_EXIT_WRITTEN, ARGS, NO_OBJ ),
  332. T01("exit-kibibytes-read", K_EXIT_READ, ARGS, NO_OBJ ),
  333. T01("exit-streams-opened", K_EXIT_OPENED, ARGS, NO_OBJ ),
  334. T1_START( "extra-info", K_EXTRA_INFO, GE(2), NO_OBJ ),
  335. END_OF_TABLE
  336. };
  337. /** List of tokens recognized in the body part of v3 networkstatus
  338. * documents. */
  339. static token_rule_t rtrstatus_token_table[] = {
  340. T01("p", K_P, CONCAT_ARGS, NO_OBJ ),
  341. T1( "r", K_R, GE(7), NO_OBJ ),
  342. T0N("a", K_A, GE(1), NO_OBJ ),
  343. T1( "s", K_S, ARGS, NO_OBJ ),
  344. T01("v", K_V, CONCAT_ARGS, NO_OBJ ),
  345. T01("w", K_W, ARGS, NO_OBJ ),
  346. T0N("m", K_M, CONCAT_ARGS, NO_OBJ ),
  347. T0N("id", K_ID, GE(2), NO_OBJ ),
  348. T0N("opt", K_OPT, CONCAT_ARGS, OBJ_OK ),
  349. END_OF_TABLE
  350. };
  351. /** List of tokens common to V3 authority certificates and V3 consensuses. */
  352. #define CERTIFICATE_MEMBERS \
  353. T1("dir-key-certificate-version", K_DIR_KEY_CERTIFICATE_VERSION, \
  354. GE(1), NO_OBJ ), \
  355. T1("dir-identity-key", K_DIR_IDENTITY_KEY, NO_ARGS, NEED_KEY ),\
  356. T1("dir-key-published",K_DIR_KEY_PUBLISHED, CONCAT_ARGS, NO_OBJ), \
  357. T1("dir-key-expires", K_DIR_KEY_EXPIRES, CONCAT_ARGS, NO_OBJ), \
  358. T1("dir-signing-key", K_DIR_SIGNING_KEY, NO_ARGS, NEED_KEY ),\
  359. T1("dir-key-crosscert", K_DIR_KEY_CROSSCERT, NO_ARGS, NEED_OBJ ),\
  360. T1("dir-key-certification", K_DIR_KEY_CERTIFICATION, \
  361. NO_ARGS, NEED_OBJ), \
  362. T01("dir-address", K_DIR_ADDRESS, GE(1), NO_OBJ),
  363. /** List of tokens recognized in V3 authority certificates. */
  364. static token_rule_t dir_key_certificate_table[] = {
  365. CERTIFICATE_MEMBERS
  366. T1("fingerprint", K_FINGERPRINT, CONCAT_ARGS, NO_OBJ ),
  367. END_OF_TABLE
  368. };
  369. /** List of tokens recognized in rendezvous service descriptors */
  370. static token_rule_t desc_token_table[] = {
  371. T1_START("rendezvous-service-descriptor", R_RENDEZVOUS_SERVICE_DESCRIPTOR,
  372. EQ(1), NO_OBJ),
  373. T1("version", R_VERSION, EQ(1), NO_OBJ),
  374. T1("permanent-key", R_PERMANENT_KEY, NO_ARGS, NEED_KEY_1024),
  375. T1("secret-id-part", R_SECRET_ID_PART, EQ(1), NO_OBJ),
  376. T1("publication-time", R_PUBLICATION_TIME, CONCAT_ARGS, NO_OBJ),
  377. T1("protocol-versions", R_PROTOCOL_VERSIONS, EQ(1), NO_OBJ),
  378. T01("introduction-points", R_INTRODUCTION_POINTS, NO_ARGS, NEED_OBJ),
  379. T1_END("signature", R_SIGNATURE, NO_ARGS, NEED_OBJ),
  380. END_OF_TABLE
  381. };
  382. /** List of tokens recognized in the (encrypted) list of introduction points of
  383. * rendezvous service descriptors */
  384. static token_rule_t ipo_token_table[] = {
  385. T1_START("introduction-point", R_IPO_IDENTIFIER, EQ(1), NO_OBJ),
  386. T1("ip-address", R_IPO_IP_ADDRESS, EQ(1), NO_OBJ),
  387. T1("onion-port", R_IPO_ONION_PORT, EQ(1), NO_OBJ),
  388. T1("onion-key", R_IPO_ONION_KEY, NO_ARGS, NEED_KEY_1024),
  389. T1("service-key", R_IPO_SERVICE_KEY, NO_ARGS, NEED_KEY_1024),
  390. END_OF_TABLE
  391. };
  392. /** List of tokens recognized in the (possibly encrypted) list of introduction
  393. * points of rendezvous service descriptors */
  394. static token_rule_t client_keys_token_table[] = {
  395. T1_START("client-name", C_CLIENT_NAME, CONCAT_ARGS, NO_OBJ),
  396. T1("descriptor-cookie", C_DESCRIPTOR_COOKIE, EQ(1), NO_OBJ),
  397. T01("client-key", C_CLIENT_KEY, NO_ARGS, NEED_SKEY_1024),
  398. END_OF_TABLE
  399. };
  400. /** List of tokens recognized in V3 networkstatus votes. */
  401. static token_rule_t networkstatus_token_table[] = {
  402. T1_START("network-status-version", K_NETWORK_STATUS_VERSION,
  403. GE(1), NO_OBJ ),
  404. T1("vote-status", K_VOTE_STATUS, GE(1), NO_OBJ ),
  405. T1("published", K_PUBLISHED, CONCAT_ARGS, NO_OBJ ),
  406. T1("valid-after", K_VALID_AFTER, CONCAT_ARGS, NO_OBJ ),
  407. T1("fresh-until", K_FRESH_UNTIL, CONCAT_ARGS, NO_OBJ ),
  408. T1("valid-until", K_VALID_UNTIL, CONCAT_ARGS, NO_OBJ ),
  409. T1("voting-delay", K_VOTING_DELAY, GE(2), NO_OBJ ),
  410. T1("known-flags", K_KNOWN_FLAGS, ARGS, NO_OBJ ),
  411. T01("params", K_PARAMS, ARGS, NO_OBJ ),
  412. T( "fingerprint", K_FINGERPRINT, CONCAT_ARGS, NO_OBJ ),
  413. T01("signing-ed25519", K_SIGNING_CERT_ED, NO_ARGS , NEED_OBJ ),
  414. T01("shared-rand-participate",K_SR_FLAG, NO_ARGS, NO_OBJ ),
  415. T0N("shared-rand-commit", K_COMMIT, GE(3), NO_OBJ ),
  416. T01("shared-rand-previous-value", K_PREVIOUS_SRV,EQ(2), NO_OBJ ),
  417. T01("shared-rand-current-value", K_CURRENT_SRV, EQ(2), NO_OBJ ),
  418. T0N("package", K_PACKAGE, CONCAT_ARGS, NO_OBJ ),
  419. CERTIFICATE_MEMBERS
  420. T0N("opt", K_OPT, CONCAT_ARGS, OBJ_OK ),
  421. T1( "contact", K_CONTACT, CONCAT_ARGS, NO_OBJ ),
  422. T1( "dir-source", K_DIR_SOURCE, GE(6), NO_OBJ ),
  423. T01("legacy-dir-key", K_LEGACY_DIR_KEY, GE(1), NO_OBJ ),
  424. T1( "known-flags", K_KNOWN_FLAGS, CONCAT_ARGS, NO_OBJ ),
  425. T01("client-versions", K_CLIENT_VERSIONS, CONCAT_ARGS, NO_OBJ ),
  426. T01("server-versions", K_SERVER_VERSIONS, CONCAT_ARGS, NO_OBJ ),
  427. T1( "consensus-methods", K_CONSENSUS_METHODS, GE(1), NO_OBJ ),
  428. END_OF_TABLE
  429. };
  430. /** List of tokens recognized in V3 networkstatus consensuses. */
  431. static token_rule_t networkstatus_consensus_token_table[] = {
  432. T1_START("network-status-version", K_NETWORK_STATUS_VERSION,
  433. GE(1), NO_OBJ ),
  434. T1("vote-status", K_VOTE_STATUS, GE(1), NO_OBJ ),
  435. T1("valid-after", K_VALID_AFTER, CONCAT_ARGS, NO_OBJ ),
  436. T1("fresh-until", K_FRESH_UNTIL, CONCAT_ARGS, NO_OBJ ),
  437. T1("valid-until", K_VALID_UNTIL, CONCAT_ARGS, NO_OBJ ),
  438. T1("voting-delay", K_VOTING_DELAY, GE(2), NO_OBJ ),
  439. T0N("opt", K_OPT, CONCAT_ARGS, OBJ_OK ),
  440. T1N("dir-source", K_DIR_SOURCE, GE(6), NO_OBJ ),
  441. T1N("contact", K_CONTACT, CONCAT_ARGS, NO_OBJ ),
  442. T1N("vote-digest", K_VOTE_DIGEST, GE(1), NO_OBJ ),
  443. T1( "known-flags", K_KNOWN_FLAGS, CONCAT_ARGS, NO_OBJ ),
  444. T01("client-versions", K_CLIENT_VERSIONS, CONCAT_ARGS, NO_OBJ ),
  445. T01("server-versions", K_SERVER_VERSIONS, CONCAT_ARGS, NO_OBJ ),
  446. T01("consensus-method", K_CONSENSUS_METHOD, EQ(1), NO_OBJ),
  447. T01("params", K_PARAMS, ARGS, NO_OBJ ),
  448. T01("shared-rand-previous-value", K_PREVIOUS_SRV, EQ(2), NO_OBJ ),
  449. T01("shared-rand-current-value", K_CURRENT_SRV, EQ(2), NO_OBJ ),
  450. END_OF_TABLE
  451. };
  452. /** List of tokens recognized in the footer of v1 directory footers. */
  453. static token_rule_t networkstatus_vote_footer_token_table[] = {
  454. T01("directory-footer", K_DIRECTORY_FOOTER, NO_ARGS, NO_OBJ ),
  455. T01("bandwidth-weights", K_BW_WEIGHTS, ARGS, NO_OBJ ),
  456. T( "directory-signature", K_DIRECTORY_SIGNATURE, GE(2), NEED_OBJ ),
  457. END_OF_TABLE
  458. };
  459. /** List of tokens recognized in detached networkstatus signature documents. */
  460. static token_rule_t networkstatus_detached_signature_token_table[] = {
  461. T1_START("consensus-digest", K_CONSENSUS_DIGEST, GE(1), NO_OBJ ),
  462. T("additional-digest", K_ADDITIONAL_DIGEST,GE(3), NO_OBJ ),
  463. T1("valid-after", K_VALID_AFTER, CONCAT_ARGS, NO_OBJ ),
  464. T1("fresh-until", K_FRESH_UNTIL, CONCAT_ARGS, NO_OBJ ),
  465. T1("valid-until", K_VALID_UNTIL, CONCAT_ARGS, NO_OBJ ),
  466. T("additional-signature", K_ADDITIONAL_SIGNATURE, GE(4), NEED_OBJ ),
  467. T1N("directory-signature", K_DIRECTORY_SIGNATURE, GE(2), NEED_OBJ ),
  468. END_OF_TABLE
  469. };
  470. /** List of tokens recognized in microdescriptors */
  471. static token_rule_t microdesc_token_table[] = {
  472. T1_START("onion-key", K_ONION_KEY, NO_ARGS, NEED_KEY_1024),
  473. T01("ntor-onion-key", K_ONION_KEY_NTOR, GE(1), NO_OBJ ),
  474. T0N("id", K_ID, GE(2), NO_OBJ ),
  475. T0N("a", K_A, GE(1), NO_OBJ ),
  476. T01("family", K_FAMILY, ARGS, NO_OBJ ),
  477. T01("p", K_P, CONCAT_ARGS, NO_OBJ ),
  478. T01("p6", K_P6, CONCAT_ARGS, NO_OBJ ),
  479. A01("@last-listed", A_LAST_LISTED, CONCAT_ARGS, NO_OBJ ),
  480. END_OF_TABLE
  481. };
  482. #undef T
  483. /* static function prototypes */
  484. static int router_add_exit_policy(routerinfo_t *router,directory_token_t *tok);
  485. static addr_policy_t *router_parse_addr_policy(directory_token_t *tok,
  486. unsigned fmt_flags);
  487. static addr_policy_t *router_parse_addr_policy_private(directory_token_t *tok);
  488. static int router_get_hash_impl_helper(const char *s, size_t s_len,
  489. const char *start_str,
  490. const char *end_str, char end_c,
  491. const char **start_out, const char **end_out);
  492. static int router_get_hash_impl(const char *s, size_t s_len, char *digest,
  493. const char *start_str, const char *end_str,
  494. char end_char,
  495. digest_algorithm_t alg);
  496. static int router_get_hashes_impl(const char *s, size_t s_len,
  497. common_digests_t *digests,
  498. const char *start_str, const char *end_str,
  499. char end_char);
  500. static void token_clear(directory_token_t *tok);
  501. static smartlist_t *find_all_by_keyword(smartlist_t *s, directory_keyword k);
  502. static smartlist_t *find_all_exitpolicy(smartlist_t *s);
  503. static directory_token_t *find_by_keyword_(smartlist_t *s,
  504. directory_keyword keyword,
  505. const char *keyword_str);
  506. #define find_by_keyword(s, keyword) find_by_keyword_((s), (keyword), #keyword)
  507. static directory_token_t *find_opt_by_keyword(smartlist_t *s,
  508. directory_keyword keyword);
  509. #define TS_ANNOTATIONS_OK 1
  510. #define TS_NOCHECK 2
  511. #define TS_NO_NEW_ANNOTATIONS 4
  512. static int tokenize_string(memarea_t *area,
  513. const char *start, const char *end,
  514. smartlist_t *out,
  515. token_rule_t *table,
  516. int flags);
  517. static directory_token_t *get_next_token(memarea_t *area,
  518. const char **s,
  519. const char *eos,
  520. token_rule_t *table);
  521. #define CST_CHECK_AUTHORITY (1<<0)
  522. #define CST_NO_CHECK_OBJTYPE (1<<1)
  523. static int check_signature_token(const char *digest,
  524. ssize_t digest_len,
  525. directory_token_t *tok,
  526. crypto_pk_t *pkey,
  527. int flags,
  528. const char *doctype);
  529. #undef DEBUG_AREA_ALLOC
  530. #ifdef DEBUG_AREA_ALLOC
  531. #define DUMP_AREA(a,name) STMT_BEGIN \
  532. size_t alloc=0, used=0; \
  533. memarea_get_stats((a),&alloc,&used); \
  534. log_debug(LD_MM, "Area for %s has %lu allocated; using %lu.", \
  535. name, (unsigned long)alloc, (unsigned long)used); \
  536. STMT_END
  537. #else
  538. #define DUMP_AREA(a,name) STMT_NIL
  539. #endif
  540. /* Dump mechanism for unparseable descriptors */
  541. /** List of dumped descriptors for FIFO cleanup purposes */
  542. STATIC smartlist_t *descs_dumped = NULL;
  543. /** Total size of dumped descriptors for FIFO cleanup */
  544. STATIC uint64_t len_descs_dumped = 0;
  545. /** Directory to stash dumps in */
  546. static int have_dump_desc_dir = 0;
  547. static int problem_with_dump_desc_dir = 0;
  548. #define DESC_DUMP_DATADIR_SUBDIR "unparseable-descs"
  549. #define DESC_DUMP_BASE_FILENAME "unparseable-desc"
  550. /** Find the dump directory and check if we'll be able to create it */
  551. static void
  552. dump_desc_init(void)
  553. {
  554. char *dump_desc_dir;
  555. dump_desc_dir = get_datadir_fname(DESC_DUMP_DATADIR_SUBDIR);
  556. /*
  557. * We just check for it, don't create it at this point; we'll
  558. * create it when we need it if it isn't already there.
  559. */
  560. if (check_private_dir(dump_desc_dir, CPD_CHECK, get_options()->User) < 0) {
  561. /* Error, log and flag it as having a problem */
  562. log_notice(LD_DIR,
  563. "Doesn't look like we'll be able to create descriptor dump "
  564. "directory %s; dumps will be disabled.",
  565. dump_desc_dir);
  566. problem_with_dump_desc_dir = 1;
  567. tor_free(dump_desc_dir);
  568. return;
  569. }
  570. /* Check if it exists */
  571. switch (file_status(dump_desc_dir)) {
  572. case FN_DIR:
  573. /* We already have a directory */
  574. have_dump_desc_dir = 1;
  575. break;
  576. case FN_NOENT:
  577. /* Nothing, we'll need to create it later */
  578. have_dump_desc_dir = 0;
  579. break;
  580. case FN_ERROR:
  581. /* Log and flag having a problem */
  582. log_notice(LD_DIR,
  583. "Couldn't check whether descriptor dump directory %s already"
  584. " exists: %s",
  585. dump_desc_dir, strerror(errno));
  586. problem_with_dump_desc_dir = 1;
  587. break;
  588. case FN_FILE:
  589. case FN_EMPTY:
  590. default:
  591. /* Something else was here! */
  592. log_notice(LD_DIR,
  593. "Descriptor dump directory %s already exists and isn't a "
  594. "directory",
  595. dump_desc_dir);
  596. problem_with_dump_desc_dir = 1;
  597. }
  598. if (have_dump_desc_dir && !problem_with_dump_desc_dir) {
  599. dump_desc_populate_fifo_from_directory(dump_desc_dir);
  600. }
  601. tor_free(dump_desc_dir);
  602. }
  603. /** Create the dump directory if needed and possible */
  604. static void
  605. dump_desc_create_dir(void)
  606. {
  607. char *dump_desc_dir;
  608. /* If the problem flag is set, skip it */
  609. if (problem_with_dump_desc_dir) return;
  610. /* Do we need it? */
  611. if (!have_dump_desc_dir) {
  612. dump_desc_dir = get_datadir_fname(DESC_DUMP_DATADIR_SUBDIR);
  613. if (check_private_dir(dump_desc_dir, CPD_CREATE,
  614. get_options()->User) < 0) {
  615. log_notice(LD_DIR,
  616. "Failed to create descriptor dump directory %s",
  617. dump_desc_dir);
  618. problem_with_dump_desc_dir = 1;
  619. }
  620. /* Okay, we created it */
  621. have_dump_desc_dir = 1;
  622. tor_free(dump_desc_dir);
  623. }
  624. }
  625. /** Dump desc FIFO/cleanup; take ownership of the given filename, add it to
  626. * the FIFO, and clean up the oldest entries to the extent they exceed the
  627. * configured cap. If any old entries with a matching hash existed, they
  628. * just got overwritten right before this was called and we should adjust
  629. * the total size counter without deleting them.
  630. */
  631. static void
  632. dump_desc_fifo_add_and_clean(char *filename, const uint8_t *digest_sha256,
  633. size_t len)
  634. {
  635. dumped_desc_t *ent = NULL, *tmp;
  636. uint64_t max_len;
  637. tor_assert(filename != NULL);
  638. tor_assert(digest_sha256 != NULL);
  639. if (descs_dumped == NULL) {
  640. /* We better have no length, then */
  641. tor_assert(len_descs_dumped == 0);
  642. /* Make a smartlist */
  643. descs_dumped = smartlist_new();
  644. }
  645. /* Make a new entry to put this one in */
  646. ent = tor_malloc_zero(sizeof(*ent));
  647. ent->filename = filename;
  648. ent->len = len;
  649. ent->when = time(NULL);
  650. memcpy(ent->digest_sha256, digest_sha256, DIGEST256_LEN);
  651. /* Do we need to do some cleanup? */
  652. max_len = get_options()->MaxUnparseableDescSizeToLog;
  653. /* Iterate over the list until we've freed enough space */
  654. while (len > max_len - len_descs_dumped &&
  655. smartlist_len(descs_dumped) > 0) {
  656. /* Get the oldest thing on the list */
  657. tmp = (dumped_desc_t *)(smartlist_get(descs_dumped, 0));
  658. /*
  659. * Check if it matches the filename we just added, so we don't delete
  660. * something we just emitted if we get repeated identical descriptors.
  661. */
  662. if (strcmp(tmp->filename, filename) != 0) {
  663. /* Delete it and adjust the length counter */
  664. tor_unlink(tmp->filename);
  665. tor_assert(len_descs_dumped >= tmp->len);
  666. len_descs_dumped -= tmp->len;
  667. log_info(LD_DIR,
  668. "Deleting old unparseable descriptor dump %s due to "
  669. "space limits",
  670. tmp->filename);
  671. } else {
  672. /*
  673. * Don't delete, but do adjust the counter since we will bump it
  674. * later
  675. */
  676. tor_assert(len_descs_dumped >= tmp->len);
  677. len_descs_dumped -= tmp->len;
  678. log_info(LD_DIR,
  679. "Replacing old descriptor dump %s with new identical one",
  680. tmp->filename);
  681. }
  682. /* Free it and remove it from the list */
  683. smartlist_del_keeporder(descs_dumped, 0);
  684. tor_free(tmp->filename);
  685. tor_free(tmp);
  686. }
  687. /* Append our entry to the end of the list and bump the counter */
  688. smartlist_add(descs_dumped, ent);
  689. len_descs_dumped += len;
  690. }
  691. /** Check if we already have a descriptor for this hash and move it to the
  692. * head of the queue if so. Return 1 if one existed and 0 otherwise.
  693. */
  694. static int
  695. dump_desc_fifo_bump_hash(const uint8_t *digest_sha256)
  696. {
  697. dumped_desc_t *match = NULL;
  698. tor_assert(digest_sha256);
  699. if (descs_dumped) {
  700. /* Find a match if one exists */
  701. SMARTLIST_FOREACH_BEGIN(descs_dumped, dumped_desc_t *, ent) {
  702. if (ent &&
  703. tor_memeq(ent->digest_sha256, digest_sha256, DIGEST256_LEN)) {
  704. /*
  705. * Save a pointer to the match and remove it from its current
  706. * position.
  707. */
  708. match = ent;
  709. SMARTLIST_DEL_CURRENT_KEEPORDER(descs_dumped, ent);
  710. break;
  711. }
  712. } SMARTLIST_FOREACH_END(ent);
  713. if (match) {
  714. /* Update the timestamp */
  715. match->when = time(NULL);
  716. /* Add it back at the end of the list */
  717. smartlist_add(descs_dumped, match);
  718. /* Indicate we found one */
  719. return 1;
  720. }
  721. }
  722. return 0;
  723. }
  724. /** Clean up on exit; just memory, leave the dumps behind
  725. */
  726. STATIC void
  727. dump_desc_fifo_cleanup(void)
  728. {
  729. if (descs_dumped) {
  730. /* Free each descriptor */
  731. SMARTLIST_FOREACH_BEGIN(descs_dumped, dumped_desc_t *, ent) {
  732. tor_assert(ent);
  733. tor_free(ent->filename);
  734. tor_free(ent);
  735. } SMARTLIST_FOREACH_END(ent);
  736. /* Free the list */
  737. smartlist_free(descs_dumped);
  738. descs_dumped = NULL;
  739. len_descs_dumped = 0;
  740. }
  741. }
  742. /** Handle one file for dump_desc_populate_fifo_from_directory(); make sure
  743. * the filename is sensibly formed and matches the file content, and either
  744. * return a dumped_desc_t for it or remove the file and return NULL.
  745. */
  746. MOCK_IMPL(STATIC dumped_desc_t *,
  747. dump_desc_populate_one_file, (const char *dirname, const char *f))
  748. {
  749. dumped_desc_t *ent = NULL;
  750. char *path = NULL, *desc = NULL;
  751. const char *digest_str;
  752. char digest[DIGEST256_LEN], content_digest[DIGEST256_LEN];
  753. /* Expected prefix before digest in filenames */
  754. const char *f_pfx = DESC_DUMP_BASE_FILENAME ".";
  755. /*
  756. * Stat while reading; this is important in case the file
  757. * contains a NUL character.
  758. */
  759. struct stat st;
  760. /* Sanity-check args */
  761. tor_assert(dirname != NULL);
  762. tor_assert(f != NULL);
  763. /* Form the full path */
  764. tor_asprintf(&path, "%s" PATH_SEPARATOR "%s", dirname, f);
  765. /* Check that f has the form DESC_DUMP_BASE_FILENAME.<digest256> */
  766. if (!strcmpstart(f, f_pfx)) {
  767. /* It matches the form, but is the digest parseable as such? */
  768. digest_str = f + strlen(f_pfx);
  769. if (base16_decode(digest, DIGEST256_LEN,
  770. digest_str, strlen(digest_str)) != DIGEST256_LEN) {
  771. /* We failed to decode it */
  772. digest_str = NULL;
  773. }
  774. } else {
  775. /* No match */
  776. digest_str = NULL;
  777. }
  778. if (!digest_str) {
  779. /* We couldn't get a sensible digest */
  780. log_notice(LD_DIR,
  781. "Removing unrecognized filename %s from unparseable "
  782. "descriptors directory", f);
  783. tor_unlink(path);
  784. /* We're done */
  785. goto done;
  786. }
  787. /*
  788. * The filename has the form DESC_DUMP_BASE_FILENAME "." <digest256> and
  789. * we've decoded the digest. Next, check that we can read it and the
  790. * content matches this digest. We are relying on the fact that if the
  791. * file contains a '\0', read_file_to_str() will allocate space for and
  792. * read the entire file and return the correct size in st.
  793. */
  794. desc = read_file_to_str(path, RFTS_IGNORE_MISSING|RFTS_BIN, &st);
  795. if (!desc) {
  796. /* We couldn't read it */
  797. log_notice(LD_DIR,
  798. "Failed to read %s from unparseable descriptors directory; "
  799. "attempting to remove it.", f);
  800. tor_unlink(path);
  801. /* We're done */
  802. goto done;
  803. }
  804. #if SIZE_MAX > UINT64_MAX
  805. if (BUG((uint64_t)st.st_size > (uint64_t)SIZE_MAX)) {
  806. /* LCOV_EXCL_START
  807. * Should be impossible since RFTS above should have failed to read the
  808. * huge file into RAM. */
  809. goto done;
  810. /* LCOV_EXCL_STOP */
  811. }
  812. #endif
  813. if (BUG(st.st_size < 0)) {
  814. /* LCOV_EXCL_START
  815. * Should be impossible, since the OS isn't supposed to be b0rken. */
  816. goto done;
  817. /* LCOV_EXCL_STOP */
  818. }
  819. /* (Now we can be sure that st.st_size is safe to cast to a size_t.) */
  820. /*
  821. * We got one; now compute its digest and check that it matches the
  822. * filename.
  823. */
  824. if (crypto_digest256((char *)content_digest, desc, (size_t) st.st_size,
  825. DIGEST_SHA256) != 0) {
  826. /* Weird, but okay */
  827. log_info(LD_DIR,
  828. "Unable to hash content of %s from unparseable descriptors "
  829. "directory", f);
  830. tor_unlink(path);
  831. /* We're done */
  832. goto done;
  833. }
  834. /* Compare the digests */
  835. if (tor_memneq(digest, content_digest, DIGEST256_LEN)) {
  836. /* No match */
  837. log_info(LD_DIR,
  838. "Hash of %s from unparseable descriptors directory didn't "
  839. "match its filename; removing it", f);
  840. tor_unlink(path);
  841. /* We're done */
  842. goto done;
  843. }
  844. /* Okay, it's a match, we should prepare ent */
  845. ent = tor_malloc_zero(sizeof(dumped_desc_t));
  846. ent->filename = path;
  847. memcpy(ent->digest_sha256, digest, DIGEST256_LEN);
  848. ent->len = (size_t) st.st_size;
  849. ent->when = st.st_mtime;
  850. /* Null out path so we don't free it out from under ent */
  851. path = NULL;
  852. done:
  853. /* Free allocations if we had them */
  854. tor_free(desc);
  855. tor_free(path);
  856. return ent;
  857. }
  858. /** Sort helper for dump_desc_populate_fifo_from_directory(); compares
  859. * the when field of dumped_desc_ts in a smartlist to put the FIFO in
  860. * the correct order after reconstructing it from the directory.
  861. */
  862. static int
  863. dump_desc_compare_fifo_entries(const void **a_v, const void **b_v)
  864. {
  865. const dumped_desc_t **a = (const dumped_desc_t **)a_v;
  866. const dumped_desc_t **b = (const dumped_desc_t **)b_v;
  867. if ((a != NULL) && (*a != NULL)) {
  868. if ((b != NULL) && (*b != NULL)) {
  869. /* We have sensible dumped_desc_ts to compare */
  870. if ((*a)->when < (*b)->when) {
  871. return -1;
  872. } else if ((*a)->when == (*b)->when) {
  873. return 0;
  874. } else {
  875. return 1;
  876. }
  877. } else {
  878. /*
  879. * We shouldn't see this, but what the hell, NULLs precede everythin
  880. * else
  881. */
  882. return 1;
  883. }
  884. } else {
  885. return -1;
  886. }
  887. }
  888. /** Scan the contents of the directory, and update FIFO/counters; this will
  889. * consistency-check descriptor dump filenames against hashes of descriptor
  890. * dump file content, and remove any inconsistent/unreadable dumps, and then
  891. * reconstruct the dump FIFO as closely as possible for the last time the
  892. * tor process shut down. If a previous dump was repeated more than once and
  893. * moved ahead in the FIFO, the mtime will not have been updated and the
  894. * reconstructed order will be wrong, but will always be a permutation of
  895. * the original.
  896. */
  897. STATIC void
  898. dump_desc_populate_fifo_from_directory(const char *dirname)
  899. {
  900. smartlist_t *files = NULL;
  901. dumped_desc_t *ent = NULL;
  902. tor_assert(dirname != NULL);
  903. /* Get a list of files */
  904. files = tor_listdir(dirname);
  905. if (!files) {
  906. log_notice(LD_DIR,
  907. "Unable to get contents of unparseable descriptor dump "
  908. "directory %s",
  909. dirname);
  910. return;
  911. }
  912. /*
  913. * Iterate through the list and decide which files should go in the
  914. * FIFO and which should be purged.
  915. */
  916. SMARTLIST_FOREACH_BEGIN(files, char *, f) {
  917. /* Try to get a FIFO entry */
  918. ent = dump_desc_populate_one_file(dirname, f);
  919. if (ent) {
  920. /*
  921. * We got one; add it to the FIFO. No need for duplicate checking
  922. * here since we just verified the name and digest match.
  923. */
  924. /* Make sure we have a list to add it to */
  925. if (!descs_dumped) {
  926. descs_dumped = smartlist_new();
  927. len_descs_dumped = 0;
  928. }
  929. /* Add it and adjust the counter */
  930. smartlist_add(descs_dumped, ent);
  931. len_descs_dumped += ent->len;
  932. }
  933. /*
  934. * If we didn't, we will have unlinked the file if necessary and
  935. * possible, and emitted a log message about it, so just go on to
  936. * the next.
  937. */
  938. } SMARTLIST_FOREACH_END(f);
  939. /* Did we get anything? */
  940. if (descs_dumped != NULL) {
  941. /* Sort the FIFO in order of increasing timestamp */
  942. smartlist_sort(descs_dumped, dump_desc_compare_fifo_entries);
  943. /* Log some stats */
  944. log_info(LD_DIR,
  945. "Reloaded unparseable descriptor dump FIFO with %d dump(s) "
  946. "totaling " U64_FORMAT " bytes",
  947. smartlist_len(descs_dumped), U64_PRINTF_ARG(len_descs_dumped));
  948. }
  949. /* Free the original list */
  950. SMARTLIST_FOREACH(files, char *, f, tor_free(f));
  951. smartlist_free(files);
  952. }
  953. /** For debugging purposes, dump unparseable descriptor *<b>desc</b> of
  954. * type *<b>type</b> to file $DATADIR/unparseable-desc. Do not write more
  955. * than one descriptor to disk per minute. If there is already such a
  956. * file in the data directory, overwrite it. */
  957. STATIC void
  958. dump_desc(const char *desc, const char *type)
  959. {
  960. tor_assert(desc);
  961. tor_assert(type);
  962. size_t len;
  963. /* The SHA256 of the string */
  964. uint8_t digest_sha256[DIGEST256_LEN];
  965. char digest_sha256_hex[HEX_DIGEST256_LEN+1];
  966. /* Filename to log it to */
  967. char *debugfile, *debugfile_base;
  968. /* Get the hash for logging purposes anyway */
  969. len = strlen(desc);
  970. if (crypto_digest256((char *)digest_sha256, desc, len,
  971. DIGEST_SHA256) != 0) {
  972. log_info(LD_DIR,
  973. "Unable to parse descriptor of type %s, and unable to even hash"
  974. " it!", type);
  975. goto err;
  976. }
  977. base16_encode(digest_sha256_hex, sizeof(digest_sha256_hex),
  978. (const char *)digest_sha256, sizeof(digest_sha256));
  979. /*
  980. * We mention type and hash in the main log; don't clutter up the files
  981. * with anything but the exact dump.
  982. */
  983. tor_asprintf(&debugfile_base,
  984. DESC_DUMP_BASE_FILENAME ".%s", digest_sha256_hex);
  985. debugfile = get_datadir_fname2(DESC_DUMP_DATADIR_SUBDIR, debugfile_base);
  986. /*
  987. * Check if the sandbox is active or will become active; see comment
  988. * below at the log message for why.
  989. */
  990. if (!(sandbox_is_active() || get_options()->Sandbox)) {
  991. if (len <= get_options()->MaxUnparseableDescSizeToLog) {
  992. if (!dump_desc_fifo_bump_hash(digest_sha256)) {
  993. /* Create the directory if needed */
  994. dump_desc_create_dir();
  995. /* Make sure we've got it */
  996. if (have_dump_desc_dir && !problem_with_dump_desc_dir) {
  997. /* Write it, and tell the main log about it */
  998. write_str_to_file(debugfile, desc, 1);
  999. log_info(LD_DIR,
  1000. "Unable to parse descriptor of type %s with hash %s and "
  1001. "length %lu. See file %s in data directory for details.",
  1002. type, digest_sha256_hex, (unsigned long)len,
  1003. debugfile_base);
  1004. dump_desc_fifo_add_and_clean(debugfile, digest_sha256, len);
  1005. /* Since we handed ownership over, don't free debugfile later */
  1006. debugfile = NULL;
  1007. } else {
  1008. /* Problem with the subdirectory */
  1009. log_info(LD_DIR,
  1010. "Unable to parse descriptor of type %s with hash %s and "
  1011. "length %lu. Descriptor not dumped because we had a "
  1012. "problem creating the " DESC_DUMP_DATADIR_SUBDIR
  1013. " subdirectory",
  1014. type, digest_sha256_hex, (unsigned long)len);
  1015. /* We do have to free debugfile in this case */
  1016. }
  1017. } else {
  1018. /* We already had one with this hash dumped */
  1019. log_info(LD_DIR,
  1020. "Unable to parse descriptor of type %s with hash %s and "
  1021. "length %lu. Descriptor not dumped because one with that "
  1022. "hash has already been dumped.",
  1023. type, digest_sha256_hex, (unsigned long)len);
  1024. /* We do have to free debugfile in this case */
  1025. }
  1026. } else {
  1027. /* Just log that it happened without dumping */
  1028. log_info(LD_DIR,
  1029. "Unable to parse descriptor of type %s with hash %s and "
  1030. "length %lu. Descriptor not dumped because it exceeds maximum"
  1031. " log size all by itself.",
  1032. type, digest_sha256_hex, (unsigned long)len);
  1033. /* We do have to free debugfile in this case */
  1034. }
  1035. } else {
  1036. /*
  1037. * Not logging because the sandbox is active and seccomp2 apparently
  1038. * doesn't have a sensible way to allow filenames according to a pattern
  1039. * match. (If we ever figure out how to say "allow writes to /regex/",
  1040. * remove this checK).
  1041. */
  1042. log_info(LD_DIR,
  1043. "Unable to parse descriptor of type %s with hash %s and "
  1044. "length %lu. Descriptor not dumped because the sandbox is "
  1045. "configured",
  1046. type, digest_sha256_hex, (unsigned long)len);
  1047. }
  1048. tor_free(debugfile_base);
  1049. tor_free(debugfile);
  1050. err:
  1051. return;
  1052. }
  1053. /** Set <b>digest</b> to the SHA-1 digest of the hash of the directory in
  1054. * <b>s</b>. Return 0 on success, -1 on failure.
  1055. */
  1056. int
  1057. router_get_dir_hash(const char *s, char *digest)
  1058. {
  1059. return router_get_hash_impl(s, strlen(s), digest,
  1060. "signed-directory","\ndirectory-signature",'\n',
  1061. DIGEST_SHA1);
  1062. }
  1063. /** Set <b>digest</b> to the SHA-1 digest of the hash of the first router in
  1064. * <b>s</b>. Return 0 on success, -1 on failure.
  1065. */
  1066. int
  1067. router_get_router_hash(const char *s, size_t s_len, char *digest)
  1068. {
  1069. return router_get_hash_impl(s, s_len, digest,
  1070. "router ","\nrouter-signature", '\n',
  1071. DIGEST_SHA1);
  1072. }
  1073. /** Set <b>digests</b> to all the digests of the consensus document in
  1074. * <b>s</b> */
  1075. int
  1076. router_get_networkstatus_v3_hashes(const char *s, common_digests_t *digests)
  1077. {
  1078. return router_get_hashes_impl(s,strlen(s),digests,
  1079. "network-status-version",
  1080. "\ndirectory-signature",
  1081. ' ');
  1082. }
  1083. /** Set <b>digest</b> to the SHA-1 digest of the hash of the <b>s_len</b>-byte
  1084. * extrainfo string at <b>s</b>. Return 0 on success, -1 on failure. */
  1085. int
  1086. router_get_extrainfo_hash(const char *s, size_t s_len, char *digest)
  1087. {
  1088. return router_get_hash_impl(s, s_len, digest, "extra-info",
  1089. "\nrouter-signature",'\n', DIGEST_SHA1);
  1090. }
  1091. /** Helper: used to generate signatures for routers, directories and
  1092. * network-status objects. Given a <b>digest_len</b>-byte digest in
  1093. * <b>digest</b> and a secret <b>private_key</b>, generate an PKCS1-padded
  1094. * signature, BASE64-encode it, surround it with -----BEGIN/END----- pairs,
  1095. * and return the new signature on success or NULL on failure.
  1096. */
  1097. char *
  1098. router_get_dirobj_signature(const char *digest,
  1099. size_t digest_len,
  1100. const crypto_pk_t *private_key)
  1101. {
  1102. char *signature;
  1103. size_t i, keysize;
  1104. int siglen;
  1105. char *buf = NULL;
  1106. size_t buf_len;
  1107. /* overestimate of BEGIN/END lines total len. */
  1108. #define BEGIN_END_OVERHEAD_LEN 64
  1109. keysize = crypto_pk_keysize(private_key);
  1110. signature = tor_malloc(keysize);
  1111. siglen = crypto_pk_private_sign(private_key, signature, keysize,
  1112. digest, digest_len);
  1113. if (siglen < 0) {
  1114. log_warn(LD_BUG,"Couldn't sign digest.");
  1115. goto err;
  1116. }
  1117. /* The *2 here is a ridiculous overestimate of base-64 overhead. */
  1118. buf_len = (siglen * 2) + BEGIN_END_OVERHEAD_LEN;
  1119. buf = tor_malloc(buf_len);
  1120. if (strlcpy(buf, "-----BEGIN SIGNATURE-----\n", buf_len) >= buf_len)
  1121. goto truncated;
  1122. i = strlen(buf);
  1123. if (base64_encode(buf+i, buf_len-i, signature, siglen,
  1124. BASE64_ENCODE_MULTILINE) < 0) {
  1125. log_warn(LD_BUG,"couldn't base64-encode signature");
  1126. goto err;
  1127. }
  1128. if (strlcat(buf, "-----END SIGNATURE-----\n", buf_len) >= buf_len)
  1129. goto truncated;
  1130. tor_free(signature);
  1131. return buf;
  1132. truncated:
  1133. log_warn(LD_BUG,"tried to exceed string length.");
  1134. err:
  1135. tor_free(signature);
  1136. tor_free(buf);
  1137. return NULL;
  1138. }
  1139. /** Helper: used to generate signatures for routers, directories and
  1140. * network-status objects. Given a digest in <b>digest</b> and a secret
  1141. * <b>private_key</b>, generate a PKCS1-padded signature, BASE64-encode it,
  1142. * surround it with -----BEGIN/END----- pairs, and write it to the
  1143. * <b>buf_len</b>-byte buffer at <b>buf</b>. Return 0 on success, -1 on
  1144. * failure.
  1145. */
  1146. int
  1147. router_append_dirobj_signature(char *buf, size_t buf_len, const char *digest,
  1148. size_t digest_len, crypto_pk_t *private_key)
  1149. {
  1150. size_t sig_len, s_len;
  1151. char *sig = router_get_dirobj_signature(digest, digest_len, private_key);
  1152. if (!sig) {
  1153. log_warn(LD_BUG, "No signature generated");
  1154. return -1;
  1155. }
  1156. sig_len = strlen(sig);
  1157. s_len = strlen(buf);
  1158. if (sig_len + s_len + 1 > buf_len) {
  1159. log_warn(LD_BUG, "Not enough room for signature");
  1160. tor_free(sig);
  1161. return -1;
  1162. }
  1163. memcpy(buf+s_len, sig, sig_len+1);
  1164. tor_free(sig);
  1165. return 0;
  1166. }
  1167. /** Return VS_RECOMMENDED if <b>myversion</b> is contained in
  1168. * <b>versionlist</b>. Else, return VS_EMPTY if versionlist has no
  1169. * entries. Else, return VS_OLD if every member of
  1170. * <b>versionlist</b> is newer than <b>myversion</b>. Else, return
  1171. * VS_NEW_IN_SERIES if there is at least one member of <b>versionlist</b> in
  1172. * the same series (major.minor.micro) as <b>myversion</b>, but no such member
  1173. * is newer than <b>myversion.</b>. Else, return VS_NEW if every member of
  1174. * <b>versionlist</b> is older than <b>myversion</b>. Else, return
  1175. * VS_UNRECOMMENDED.
  1176. *
  1177. * (versionlist is a comma-separated list of version strings,
  1178. * optionally prefixed with "Tor". Versions that can't be parsed are
  1179. * ignored.)
  1180. */
  1181. version_status_t
  1182. tor_version_is_obsolete(const char *myversion, const char *versionlist)
  1183. {
  1184. tor_version_t mine, other;
  1185. int found_newer = 0, found_older = 0, found_newer_in_series = 0,
  1186. found_any_in_series = 0, r, same;
  1187. version_status_t ret = VS_UNRECOMMENDED;
  1188. smartlist_t *version_sl;
  1189. log_debug(LD_CONFIG,"Checking whether version '%s' is in '%s'",
  1190. myversion, versionlist);
  1191. if (tor_version_parse(myversion, &mine)) {
  1192. log_err(LD_BUG,"I couldn't parse my own version (%s)", myversion);
  1193. tor_assert(0);
  1194. }
  1195. version_sl = smartlist_new();
  1196. smartlist_split_string(version_sl, versionlist, ",", SPLIT_SKIP_SPACE, 0);
  1197. if (!strlen(versionlist)) { /* no authorities cared or agreed */
  1198. ret = VS_EMPTY;
  1199. goto done;
  1200. }
  1201. SMARTLIST_FOREACH_BEGIN(version_sl, const char *, cp) {
  1202. if (!strcmpstart(cp, "Tor "))
  1203. cp += 4;
  1204. if (tor_version_parse(cp, &other)) {
  1205. /* Couldn't parse other; it can't be a match. */
  1206. } else {
  1207. same = tor_version_same_series(&mine, &other);
  1208. if (same)
  1209. found_any_in_series = 1;
  1210. r = tor_version_compare(&mine, &other);
  1211. if (r==0) {
  1212. ret = VS_RECOMMENDED;
  1213. goto done;
  1214. } else if (r<0) {
  1215. found_newer = 1;
  1216. if (same)
  1217. found_newer_in_series = 1;
  1218. } else if (r>0) {
  1219. found_older = 1;
  1220. }
  1221. }
  1222. } SMARTLIST_FOREACH_END(cp);
  1223. /* We didn't find the listed version. Is it new or old? */
  1224. if (found_any_in_series && !found_newer_in_series && found_newer) {
  1225. ret = VS_NEW_IN_SERIES;
  1226. } else if (found_newer && !found_older) {
  1227. ret = VS_OLD;
  1228. } else if (found_older && !found_newer) {
  1229. ret = VS_NEW;
  1230. } else {
  1231. ret = VS_UNRECOMMENDED;
  1232. }
  1233. done:
  1234. SMARTLIST_FOREACH(version_sl, char *, version, tor_free(version));
  1235. smartlist_free(version_sl);
  1236. return ret;
  1237. }
  1238. /** Return true iff <b>key</b> is allowed to sign directories.
  1239. */
  1240. static int
  1241. dir_signing_key_is_trusted(crypto_pk_t *key)
  1242. {
  1243. char digest[DIGEST_LEN];
  1244. if (!key) return 0;
  1245. if (crypto_pk_get_digest(key, digest) < 0) {
  1246. log_warn(LD_DIR, "Error computing dir-signing-key digest");
  1247. return 0;
  1248. }
  1249. if (!router_digest_is_trusted_dir(digest)) {
  1250. log_warn(LD_DIR, "Listed dir-signing-key is not trusted");
  1251. return 0;
  1252. }
  1253. return 1;
  1254. }
  1255. /** Check whether the object body of the token in <b>tok</b> has a good
  1256. * signature for <b>digest</b> using key <b>pkey</b>. If
  1257. * <b>CST_CHECK_AUTHORITY</b> is set, make sure that <b>pkey</b> is the key of
  1258. * a directory authority. If <b>CST_NO_CHECK_OBJTYPE</b> is set, do not check
  1259. * the object type of the signature object. Use <b>doctype</b> as the type of
  1260. * the document when generating log messages. Return 0 on success, negative
  1261. * on failure.
  1262. */
  1263. static int
  1264. check_signature_token(const char *digest,
  1265. ssize_t digest_len,
  1266. directory_token_t *tok,
  1267. crypto_pk_t *pkey,
  1268. int flags,
  1269. const char *doctype)
  1270. {
  1271. char *signed_digest;
  1272. size_t keysize;
  1273. const int check_authority = (flags & CST_CHECK_AUTHORITY);
  1274. const int check_objtype = ! (flags & CST_NO_CHECK_OBJTYPE);
  1275. tor_assert(pkey);
  1276. tor_assert(tok);
  1277. tor_assert(digest);
  1278. tor_assert(doctype);
  1279. if (check_authority && !dir_signing_key_is_trusted(pkey)) {
  1280. log_warn(LD_DIR, "Key on %s did not come from an authority; rejecting",
  1281. doctype);
  1282. return -1;
  1283. }
  1284. if (check_objtype) {
  1285. if (strcmp(tok->object_type, "SIGNATURE")) {
  1286. log_warn(LD_DIR, "Bad object type on %s signature", doctype);
  1287. return -1;
  1288. }
  1289. }
  1290. keysize = crypto_pk_keysize(pkey);
  1291. signed_digest = tor_malloc(keysize);
  1292. if (crypto_pk_public_checksig(pkey, signed_digest, keysize,
  1293. tok->object_body, tok->object_size)
  1294. < digest_len) {
  1295. log_warn(LD_DIR, "Error reading %s: invalid signature.", doctype);
  1296. tor_free(signed_digest);
  1297. return -1;
  1298. }
  1299. // log_debug(LD_DIR,"Signed %s hash starts %s", doctype,
  1300. // hex_str(signed_digest,4));
  1301. if (tor_memneq(digest, signed_digest, digest_len)) {
  1302. log_warn(LD_DIR, "Error reading %s: signature does not match.", doctype);
  1303. tor_free(signed_digest);
  1304. return -1;
  1305. }
  1306. tor_free(signed_digest);
  1307. return 0;
  1308. }
  1309. /** Helper: move *<b>s_ptr</b> ahead to the next router, the next extra-info,
  1310. * or to the first of the annotations proceeding the next router or
  1311. * extra-info---whichever comes first. Set <b>is_extrainfo_out</b> to true if
  1312. * we found an extrainfo, or false if found a router. Do not scan beyond
  1313. * <b>eos</b>. Return -1 if we found nothing; 0 if we found something. */
  1314. static int
  1315. find_start_of_next_router_or_extrainfo(const char **s_ptr,
  1316. const char *eos,
  1317. int *is_extrainfo_out)
  1318. {
  1319. const char *annotations = NULL;
  1320. const char *s = *s_ptr;
  1321. s = eat_whitespace_eos(s, eos);
  1322. while (s < eos-32) { /* 32 gives enough room for a the first keyword. */
  1323. /* We're at the start of a line. */
  1324. tor_assert(*s != '\n');
  1325. if (*s == '@' && !annotations) {
  1326. annotations = s;
  1327. } else if (*s == 'r' && !strcmpstart(s, "router ")) {
  1328. *s_ptr = annotations ? annotations : s;
  1329. *is_extrainfo_out = 0;
  1330. return 0;
  1331. } else if (*s == 'e' && !strcmpstart(s, "extra-info ")) {
  1332. *s_ptr = annotations ? annotations : s;
  1333. *is_extrainfo_out = 1;
  1334. return 0;
  1335. }
  1336. if (!(s = memchr(s+1, '\n', eos-(s+1))))
  1337. break;
  1338. s = eat_whitespace_eos(s, eos);
  1339. }
  1340. return -1;
  1341. }
  1342. /** Given a string *<b>s</b> containing a concatenated sequence of router
  1343. * descriptors (or extra-info documents if <b>is_extrainfo</b> is set), parses
  1344. * them and stores the result in <b>dest</b>. All routers are marked running
  1345. * and valid. Advances *s to a point immediately following the last router
  1346. * entry. Ignore any trailing router entries that are not complete.
  1347. *
  1348. * If <b>saved_location</b> isn't SAVED_IN_CACHE, make a local copy of each
  1349. * descriptor in the signed_descriptor_body field of each routerinfo_t. If it
  1350. * isn't SAVED_NOWHERE, remember the offset of each descriptor.
  1351. *
  1352. * Returns 0 on success and -1 on failure. Adds a digest to
  1353. * <b>invalid_digests_out</b> for every entry that was unparseable or
  1354. * invalid. (This may cause duplicate entries.)
  1355. */
  1356. int
  1357. router_parse_list_from_string(const char **s, const char *eos,
  1358. smartlist_t *dest,
  1359. saved_location_t saved_location,
  1360. int want_extrainfo,
  1361. int allow_annotations,
  1362. const char *prepend_annotations,
  1363. smartlist_t *invalid_digests_out)
  1364. {
  1365. routerinfo_t *router;
  1366. extrainfo_t *extrainfo;
  1367. signed_descriptor_t *signed_desc = NULL;
  1368. void *elt;
  1369. const char *end, *start;
  1370. int have_extrainfo;
  1371. tor_assert(s);
  1372. tor_assert(*s);
  1373. tor_assert(dest);
  1374. start = *s;
  1375. if (!eos)
  1376. eos = *s + strlen(*s);
  1377. tor_assert(eos >= *s);
  1378. while (1) {
  1379. char raw_digest[DIGEST_LEN];
  1380. int have_raw_digest = 0;
  1381. int dl_again = 0;
  1382. if (find_start_of_next_router_or_extrainfo(s, eos, &have_extrainfo) < 0)
  1383. break;
  1384. end = tor_memstr(*s, eos-*s, "\nrouter-signature");
  1385. if (end)
  1386. end = tor_memstr(end, eos-end, "\n-----END SIGNATURE-----\n");
  1387. if (end)
  1388. end += strlen("\n-----END SIGNATURE-----\n");
  1389. if (!end)
  1390. break;
  1391. elt = NULL;
  1392. if (have_extrainfo && want_extrainfo) {
  1393. routerlist_t *rl = router_get_routerlist();
  1394. have_raw_digest = router_get_extrainfo_hash(*s, end-*s, raw_digest) == 0;
  1395. extrainfo = extrainfo_parse_entry_from_string(*s, end,
  1396. saved_location != SAVED_IN_CACHE,
  1397. rl->identity_map, &dl_again);
  1398. if (extrainfo) {
  1399. signed_desc = &extrainfo->cache_info;
  1400. elt = extrainfo;
  1401. }
  1402. } else if (!have_extrainfo && !want_extrainfo) {
  1403. have_raw_digest = router_get_router_hash(*s, end-*s, raw_digest) == 0;
  1404. router = router_parse_entry_from_string(*s, end,
  1405. saved_location != SAVED_IN_CACHE,
  1406. allow_annotations,
  1407. prepend_annotations, &dl_again);
  1408. if (router) {
  1409. log_debug(LD_DIR, "Read router '%s', purpose '%s'",
  1410. router_describe(router),
  1411. router_purpose_to_string(router->purpose));
  1412. signed_desc = &router->cache_info;
  1413. elt = router;
  1414. }
  1415. }
  1416. if (! elt && ! dl_again && have_raw_digest && invalid_digests_out) {
  1417. smartlist_add(invalid_digests_out, tor_memdup(raw_digest, DIGEST_LEN));
  1418. }
  1419. if (!elt) {
  1420. *s = end;
  1421. continue;
  1422. }
  1423. if (saved_location != SAVED_NOWHERE) {
  1424. tor_assert(signed_desc);
  1425. signed_desc->saved_location = saved_location;
  1426. signed_desc->saved_offset = *s - start;
  1427. }
  1428. *s = end;
  1429. smartlist_add(dest, elt);
  1430. }
  1431. return 0;
  1432. }
  1433. /* For debugging: define to count every descriptor digest we've seen so we
  1434. * know if we need to try harder to avoid duplicate verifies. */
  1435. #undef COUNT_DISTINCT_DIGESTS
  1436. #ifdef COUNT_DISTINCT_DIGESTS
  1437. static digestmap_t *verified_digests = NULL;
  1438. #endif
  1439. /** Log the total count of the number of distinct router digests we've ever
  1440. * verified. When compared to the number of times we've verified routerdesc
  1441. * signatures <i>in toto</i>, this will tell us if we're doing too much
  1442. * multiple-verification. */
  1443. void
  1444. dump_distinct_digest_count(int severity)
  1445. {
  1446. #ifdef COUNT_DISTINCT_DIGESTS
  1447. if (!verified_digests)
  1448. verified_digests = digestmap_new();
  1449. tor_log(severity, LD_GENERAL, "%d *distinct* router digests verified",
  1450. digestmap_size(verified_digests));
  1451. #else
  1452. (void)severity; /* suppress "unused parameter" warning */
  1453. #endif
  1454. }
  1455. /** Try to find an IPv6 OR port in <b>list</b> of directory_token_t's
  1456. * with at least one argument (use GE(1) in setup). If found, store
  1457. * address and port number to <b>addr_out</b> and
  1458. * <b>port_out</b>. Return number of OR ports found. */
  1459. static int
  1460. find_single_ipv6_orport(const smartlist_t *list,
  1461. tor_addr_t *addr_out,
  1462. uint16_t *port_out)
  1463. {
  1464. int ret = 0;
  1465. tor_assert(list != NULL);
  1466. tor_assert(addr_out != NULL);
  1467. tor_assert(port_out != NULL);
  1468. SMARTLIST_FOREACH_BEGIN(list, directory_token_t *, t) {
  1469. tor_addr_t a;
  1470. maskbits_t bits;
  1471. uint16_t port_min, port_max;
  1472. tor_assert(t->n_args >= 1);
  1473. /* XXXX Prop186 the full spec allows much more than this. */
  1474. if (tor_addr_parse_mask_ports(t->args[0], 0,
  1475. &a, &bits, &port_min,
  1476. &port_max) == AF_INET6 &&
  1477. bits == 128 &&
  1478. port_min == port_max) {
  1479. /* Okay, this is one we can understand. Use it and ignore
  1480. any potential more addresses in list. */
  1481. tor_addr_copy(addr_out, &a);
  1482. *port_out = port_min;
  1483. ret = 1;
  1484. break;
  1485. }
  1486. } SMARTLIST_FOREACH_END(t);
  1487. return ret;
  1488. }
  1489. /** Helper function: reads a single router entry from *<b>s</b> ...
  1490. * *<b>end</b>. Mallocs a new router and returns it if all goes well, else
  1491. * returns NULL. If <b>cache_copy</b> is true, duplicate the contents of
  1492. * s through end into the signed_descriptor_body of the resulting
  1493. * routerinfo_t.
  1494. *
  1495. * If <b>end</b> is NULL, <b>s</b> must be properly NUL-terminated.
  1496. *
  1497. * If <b>allow_annotations</b>, it's okay to encounter annotations in <b>s</b>
  1498. * before the router; if it's false, reject the router if it's annotated. If
  1499. * <b>prepend_annotations</b> is set, it should contain some annotations:
  1500. * append them to the front of the router before parsing it, and keep them
  1501. * around when caching the router.
  1502. *
  1503. * Only one of allow_annotations and prepend_annotations may be set.
  1504. *
  1505. * If <b>can_dl_again_out</b> is provided, set *<b>can_dl_again_out</b> to 1
  1506. * if it's okay to try to download a descriptor with this same digest again,
  1507. * and 0 if it isn't. (It might not be okay to download it again if part of
  1508. * the part covered by the digest is invalid.)
  1509. */
  1510. routerinfo_t *
  1511. router_parse_entry_from_string(const char *s, const char *end,
  1512. int cache_copy, int allow_annotations,
  1513. const char *prepend_annotations,
  1514. int *can_dl_again_out)
  1515. {
  1516. routerinfo_t *router = NULL;
  1517. char digest[128];
  1518. smartlist_t *tokens = NULL, *exit_policy_tokens = NULL;
  1519. directory_token_t *tok;
  1520. struct in_addr in;
  1521. const char *start_of_annotations, *cp, *s_dup = s;
  1522. size_t prepend_len = prepend_annotations ? strlen(prepend_annotations) : 0;
  1523. int ok = 1;
  1524. memarea_t *area = NULL;
  1525. tor_cert_t *ntor_cc_cert = NULL;
  1526. /* Do not set this to '1' until we have parsed everything that we intend to
  1527. * parse that's covered by the hash. */
  1528. int can_dl_again = 0;
  1529. tor_assert(!allow_annotations || !prepend_annotations);
  1530. if (!end) {
  1531. end = s + strlen(s);
  1532. }
  1533. /* point 'end' to a point immediately after the final newline. */
  1534. while (end > s+2 && *(end-1) == '\n' && *(end-2) == '\n')
  1535. --end;
  1536. area = memarea_new();
  1537. tokens = smartlist_new();
  1538. if (prepend_annotations) {
  1539. if (tokenize_string(area,prepend_annotations,NULL,tokens,
  1540. routerdesc_token_table,TS_NOCHECK)) {
  1541. log_warn(LD_DIR, "Error tokenizing router descriptor (annotations).");
  1542. goto err;
  1543. }
  1544. }
  1545. start_of_annotations = s;
  1546. cp = tor_memstr(s, end-s, "\nrouter ");
  1547. if (!cp) {
  1548. if (end-s < 7 || strcmpstart(s, "router ")) {
  1549. log_warn(LD_DIR, "No router keyword found.");
  1550. goto err;
  1551. }
  1552. } else {
  1553. s = cp+1;
  1554. }
  1555. if (start_of_annotations != s) { /* We have annotations */
  1556. if (allow_annotations) {
  1557. if (tokenize_string(area,start_of_annotations,s,tokens,
  1558. routerdesc_token_table,TS_NOCHECK)) {
  1559. log_warn(LD_DIR, "Error tokenizing router descriptor (annotations).");
  1560. goto err;
  1561. }
  1562. } else {
  1563. log_warn(LD_DIR, "Found unexpected annotations on router descriptor not "
  1564. "loaded from disk. Dropping it.");
  1565. goto err;
  1566. }
  1567. }
  1568. if (router_get_router_hash(s, end - s, digest) < 0) {
  1569. log_warn(LD_DIR, "Couldn't compute router hash.");
  1570. goto err;
  1571. }
  1572. {
  1573. int flags = 0;
  1574. if (allow_annotations)
  1575. flags |= TS_ANNOTATIONS_OK;
  1576. if (prepend_annotations)
  1577. flags |= TS_ANNOTATIONS_OK|TS_NO_NEW_ANNOTATIONS;
  1578. if (tokenize_string(area,s,end,tokens,routerdesc_token_table, flags)) {
  1579. log_warn(LD_DIR, "Error tokenizing router descriptor.");
  1580. goto err;
  1581. }
  1582. }
  1583. if (smartlist_len(tokens) < 2) {
  1584. log_warn(LD_DIR, "Impossibly short router descriptor.");
  1585. goto err;
  1586. }
  1587. tok = find_by_keyword(tokens, K_ROUTER);
  1588. const int router_token_pos = smartlist_pos(tokens, tok);
  1589. tor_assert(tok->n_args >= 5);
  1590. router = tor_malloc_zero(sizeof(routerinfo_t));
  1591. router->cert_expiration_time = TIME_MAX;
  1592. router->cache_info.routerlist_index = -1;
  1593. router->cache_info.annotations_len = s-start_of_annotations + prepend_len;
  1594. router->cache_info.signed_descriptor_len = end-s;
  1595. if (cache_copy) {
  1596. size_t len = router->cache_info.signed_descriptor_len +
  1597. router->cache_info.annotations_len;
  1598. char *cp =
  1599. router->cache_info.signed_descriptor_body = tor_malloc(len+1);
  1600. if (prepend_annotations) {
  1601. memcpy(cp, prepend_annotations, prepend_len);
  1602. cp += prepend_len;
  1603. }
  1604. /* This assertion will always succeed.
  1605. * len == signed_desc_len + annotations_len
  1606. * == end-s + s-start_of_annotations + prepend_len
  1607. * == end-start_of_annotations + prepend_len
  1608. * We already wrote prepend_len bytes into the buffer; now we're
  1609. * writing end-start_of_annotations -NM. */
  1610. tor_assert(cp+(end-start_of_annotations) ==
  1611. router->cache_info.signed_descriptor_body+len);
  1612. memcpy(cp, start_of_annotations, end-start_of_annotations);
  1613. router->cache_info.signed_descriptor_body[len] = '\0';
  1614. tor_assert(strlen(router->cache_info.signed_descriptor_body) == len);
  1615. }
  1616. memcpy(router->cache_info.signed_descriptor_digest, digest, DIGEST_LEN);
  1617. router->nickname = tor_strdup(tok->args[0]);
  1618. if (!is_legal_nickname(router->nickname)) {
  1619. log_warn(LD_DIR,"Router nickname is invalid");
  1620. goto err;
  1621. }
  1622. if (!tor_inet_aton(tok->args[1], &in)) {
  1623. log_warn(LD_DIR,"Router address is not an IP address.");
  1624. goto err;
  1625. }
  1626. router->addr = ntohl(in.s_addr);
  1627. router->or_port =
  1628. (uint16_t) tor_parse_long(tok->args[2],10,0,65535,&ok,NULL);
  1629. if (!ok) {
  1630. log_warn(LD_DIR,"Invalid OR port %s", escaped(tok->args[2]));
  1631. goto err;
  1632. }
  1633. router->dir_port =
  1634. (uint16_t) tor_parse_long(tok->args[4],10,0,65535,&ok,NULL);
  1635. if (!ok) {
  1636. log_warn(LD_DIR,"Invalid dir port %s", escaped(tok->args[4]));
  1637. goto err;
  1638. }
  1639. tok = find_by_keyword(tokens, K_BANDWIDTH);
  1640. tor_assert(tok->n_args >= 3);
  1641. router->bandwidthrate = (int)
  1642. tor_parse_long(tok->args[0],10,1,INT_MAX,&ok,NULL);
  1643. if (!ok) {
  1644. log_warn(LD_DIR, "bandwidthrate %s unreadable or 0. Failing.",
  1645. escaped(tok->args[0]));
  1646. goto err;
  1647. }
  1648. router->bandwidthburst =
  1649. (int) tor_parse_long(tok->args[1],10,0,INT_MAX,&ok,NULL);
  1650. if (!ok) {
  1651. log_warn(LD_DIR, "Invalid bandwidthburst %s", escaped(tok->args[1]));
  1652. goto err;
  1653. }
  1654. router->bandwidthcapacity = (int)
  1655. tor_parse_long(tok->args[2],10,0,INT_MAX,&ok,NULL);
  1656. if (!ok) {
  1657. log_warn(LD_DIR, "Invalid bandwidthcapacity %s", escaped(tok->args[1]));
  1658. goto err;
  1659. }
  1660. if ((tok = find_opt_by_keyword(tokens, A_PURPOSE))) {
  1661. tor_assert(tok->n_args);
  1662. router->purpose = router_purpose_from_string(tok->args[0]);
  1663. } else {
  1664. router->purpose = ROUTER_PURPOSE_GENERAL;
  1665. }
  1666. router->cache_info.send_unencrypted =
  1667. (router->purpose == ROUTER_PURPOSE_GENERAL) ? 1 : 0;
  1668. if ((tok = find_opt_by_keyword(tokens, K_UPTIME))) {
  1669. tor_assert(tok->n_args >= 1);
  1670. router->uptime = tor_parse_long(tok->args[0],10,0,LONG_MAX,&ok,NULL);
  1671. if (!ok) {
  1672. log_warn(LD_DIR, "Invalid uptime %s", escaped(tok->args[0]));
  1673. goto err;
  1674. }
  1675. }
  1676. if ((tok = find_opt_by_keyword(tokens, K_HIBERNATING))) {
  1677. tor_assert(tok->n_args >= 1);
  1678. router->is_hibernating
  1679. = (tor_parse_long(tok->args[0],10,0,LONG_MAX,NULL,NULL) != 0);
  1680. }
  1681. tok = find_by_keyword(tokens, K_PUBLISHED);
  1682. tor_assert(tok->n_args == 1);
  1683. if (parse_iso_time(tok->args[0], &router->cache_info.published_on) < 0)
  1684. goto err;
  1685. tok = find_by_keyword(tokens, K_ONION_KEY);
  1686. if (!crypto_pk_public_exponent_ok(tok->key)) {
  1687. log_warn(LD_DIR,
  1688. "Relay's onion key had invalid exponent.");
  1689. goto err;
  1690. }
  1691. router->onion_pkey = tok->key;
  1692. tok->key = NULL; /* Prevent free */
  1693. if ((tok = find_opt_by_keyword(tokens, K_ONION_KEY_NTOR))) {
  1694. curve25519_public_key_t k;
  1695. tor_assert(tok->n_args >= 1);
  1696. if (curve25519_public_from_base64(&k, tok->args[0]) < 0) {
  1697. log_warn(LD_DIR, "Bogus ntor-onion-key in routerinfo");
  1698. goto err;
  1699. }
  1700. router->onion_curve25519_pkey =
  1701. tor_memdup(&k, sizeof(curve25519_public_key_t));
  1702. }
  1703. tok = find_by_keyword(tokens, K_SIGNING_KEY);
  1704. router->identity_pkey = tok->key;
  1705. tok->key = NULL; /* Prevent free */
  1706. if (crypto_pk_get_digest(router->identity_pkey,
  1707. router->cache_info.identity_digest)) {
  1708. log_warn(LD_DIR, "Couldn't calculate key digest"); goto err;
  1709. }
  1710. {
  1711. directory_token_t *ed_sig_tok, *ed_cert_tok, *cc_tap_tok, *cc_ntor_tok,
  1712. *master_key_tok;
  1713. ed_sig_tok = find_opt_by_keyword(tokens, K_ROUTER_SIG_ED25519);
  1714. ed_cert_tok = find_opt_by_keyword(tokens, K_IDENTITY_ED25519);
  1715. master_key_tok = find_opt_by_keyword(tokens, K_MASTER_KEY_ED25519);
  1716. cc_tap_tok = find_opt_by_keyword(tokens, K_ONION_KEY_CROSSCERT);
  1717. cc_ntor_tok = find_opt_by_keyword(tokens, K_NTOR_ONION_KEY_CROSSCERT);
  1718. int n_ed_toks = !!ed_sig_tok + !!ed_cert_tok +
  1719. !!cc_tap_tok + !!cc_ntor_tok;
  1720. if ((n_ed_toks != 0 && n_ed_toks != 4) ||
  1721. (n_ed_toks == 4 && !router->onion_curve25519_pkey)) {
  1722. log_warn(LD_DIR, "Router descriptor with only partial ed25519/"
  1723. "cross-certification support");
  1724. goto err;
  1725. }
  1726. if (master_key_tok && !ed_sig_tok) {
  1727. log_warn(LD_DIR, "Router descriptor has ed25519 master key but no "
  1728. "certificate");
  1729. goto err;
  1730. }
  1731. if (ed_sig_tok) {
  1732. tor_assert(ed_cert_tok && cc_tap_tok && cc_ntor_tok);
  1733. const int ed_cert_token_pos = smartlist_pos(tokens, ed_cert_tok);
  1734. if (ed_cert_token_pos == -1 || router_token_pos == -1 ||
  1735. (ed_cert_token_pos != router_token_pos + 1 &&
  1736. ed_cert_token_pos != router_token_pos - 1)) {
  1737. log_warn(LD_DIR, "Ed25519 certificate in wrong position");
  1738. goto err;
  1739. }
  1740. if (ed_sig_tok != smartlist_get(tokens, smartlist_len(tokens)-2)) {
  1741. log_warn(LD_DIR, "Ed25519 signature in wrong position");
  1742. goto err;
  1743. }
  1744. if (strcmp(ed_cert_tok->object_type, "ED25519 CERT")) {
  1745. log_warn(LD_DIR, "Wrong object type on identity-ed25519 in decriptor");
  1746. goto err;
  1747. }
  1748. if (strcmp(cc_ntor_tok->object_type, "ED25519 CERT")) {
  1749. log_warn(LD_DIR, "Wrong object type on ntor-onion-key-crosscert "
  1750. "in decriptor");
  1751. goto err;
  1752. }
  1753. if (strcmp(cc_tap_tok->object_type, "CROSSCERT")) {
  1754. log_warn(LD_DIR, "Wrong object type on onion-key-crosscert "
  1755. "in decriptor");
  1756. goto err;
  1757. }
  1758. if (strcmp(cc_ntor_tok->args[0], "0") &&
  1759. strcmp(cc_ntor_tok->args[0], "1")) {
  1760. log_warn(LD_DIR, "Bad sign bit on ntor-onion-key-crosscert");
  1761. goto err;
  1762. }
  1763. int ntor_cc_sign_bit = !strcmp(cc_ntor_tok->args[0], "1");
  1764. uint8_t d256[DIGEST256_LEN];
  1765. const char *signed_start, *signed_end;
  1766. tor_cert_t *cert = tor_cert_parse(
  1767. (const uint8_t*)ed_cert_tok->object_body,
  1768. ed_cert_tok->object_size);
  1769. if (! cert) {
  1770. log_warn(LD_DIR, "Couldn't parse ed25519 cert");
  1771. goto err;
  1772. }
  1773. /* makes sure it gets freed. */
  1774. router->cache_info.signing_key_cert = cert;
  1775. if (cert->cert_type != CERT_TYPE_ID_SIGNING ||
  1776. ! cert->signing_key_included) {
  1777. log_warn(LD_DIR, "Invalid form for ed25519 cert");
  1778. goto err;
  1779. }
  1780. if (master_key_tok) {
  1781. /* This token is optional, but if it's present, it must match
  1782. * the signature in the signing cert, or supplant it. */
  1783. tor_assert(master_key_tok->n_args >= 1);
  1784. ed25519_public_key_t pkey;
  1785. if (ed25519_public_from_base64(&pkey, master_key_tok->args[0])<0) {
  1786. log_warn(LD_DIR, "Can't parse ed25519 master key");
  1787. goto err;
  1788. }
  1789. if (fast_memneq(&cert->signing_key.pubkey,
  1790. pkey.pubkey, ED25519_PUBKEY_LEN)) {
  1791. log_warn(LD_DIR, "Ed25519 master key does not match "
  1792. "key in certificate");
  1793. goto err;
  1794. }
  1795. }
  1796. ntor_cc_cert = tor_cert_parse((const uint8_t*)cc_ntor_tok->object_body,
  1797. cc_ntor_tok->object_size);
  1798. if (!ntor_cc_cert) {
  1799. log_warn(LD_DIR, "Couldn't parse ntor-onion-key-crosscert cert");
  1800. goto err;
  1801. }
  1802. if (ntor_cc_cert->cert_type != CERT_TYPE_ONION_ID ||
  1803. ! ed25519_pubkey_eq(&ntor_cc_cert->signed_key, &cert->signing_key)) {
  1804. log_warn(LD_DIR, "Invalid contents for ntor-onion-key-crosscert cert");
  1805. goto err;
  1806. }
  1807. ed25519_public_key_t ntor_cc_pk;
  1808. if (ed25519_public_key_from_curve25519_public_key(&ntor_cc_pk,
  1809. router->onion_curve25519_pkey,
  1810. ntor_cc_sign_bit)<0) {
  1811. log_warn(LD_DIR, "Error converting onion key to ed25519");
  1812. goto err;
  1813. }
  1814. if (router_get_hash_impl_helper(s, end-s, "router ",
  1815. "\nrouter-sig-ed25519",
  1816. ' ', &signed_start, &signed_end) < 0) {
  1817. log_warn(LD_DIR, "Can't find ed25519-signed portion of descriptor");
  1818. goto err;
  1819. }
  1820. crypto_digest_t *d = crypto_digest256_new(DIGEST_SHA256);
  1821. crypto_digest_add_bytes(d, ED_DESC_SIGNATURE_PREFIX,
  1822. strlen(ED_DESC_SIGNATURE_PREFIX));
  1823. crypto_digest_add_bytes(d, signed_start, signed_end-signed_start);
  1824. crypto_digest_get_digest(d, (char*)d256, sizeof(d256));
  1825. crypto_digest_free(d);
  1826. ed25519_checkable_t check[3];
  1827. int check_ok[3];
  1828. if (tor_cert_get_checkable_sig(&check[0], cert, NULL) < 0) {
  1829. log_err(LD_BUG, "Couldn't create 'checkable' for cert.");
  1830. goto err;
  1831. }
  1832. if (tor_cert_get_checkable_sig(&check[1],
  1833. ntor_cc_cert, &ntor_cc_pk) < 0) {
  1834. log_err(LD_BUG, "Couldn't create 'checkable' for ntor_cc_cert.");
  1835. goto err;
  1836. }
  1837. if (ed25519_signature_from_base64(&check[2].signature,
  1838. ed_sig_tok->args[0])<0) {
  1839. log_warn(LD_DIR, "Couldn't decode ed25519 signature");
  1840. goto err;
  1841. }
  1842. check[2].pubkey = &cert->signed_key;
  1843. check[2].msg = d256;
  1844. check[2].len = DIGEST256_LEN;
  1845. if (ed25519_checksig_batch(check_ok, check, 3) < 0) {
  1846. log_warn(LD_DIR, "Incorrect ed25519 signature(s)");
  1847. goto err;
  1848. }
  1849. if (check_tap_onion_key_crosscert(
  1850. (const uint8_t*)cc_tap_tok->object_body,
  1851. (int)cc_tap_tok->object_size,
  1852. router->onion_pkey,
  1853. &cert->signing_key,
  1854. (const uint8_t*)router->cache_info.identity_digest)<0) {
  1855. log_warn(LD_DIR, "Incorrect TAP cross-verification");
  1856. goto err;
  1857. }
  1858. /* We check this before adding it to the routerlist. */
  1859. if (cert->valid_until < ntor_cc_cert->valid_until)
  1860. router->cert_expiration_time = cert->valid_until;
  1861. else
  1862. router->cert_expiration_time = ntor_cc_cert->valid_until;
  1863. }
  1864. }
  1865. if ((tok = find_opt_by_keyword(tokens, K_FINGERPRINT))) {
  1866. /* If there's a fingerprint line, it must match the identity digest. */
  1867. char d[DIGEST_LEN];
  1868. tor_assert(tok->n_args == 1);
  1869. tor_strstrip(tok->args[0], " ");
  1870. if (base16_decode(d, DIGEST_LEN,
  1871. tok->args[0], strlen(tok->args[0])) != DIGEST_LEN) {
  1872. log_warn(LD_DIR, "Couldn't decode router fingerprint %s",
  1873. escaped(tok->args[0]));
  1874. goto err;
  1875. }
  1876. if (tor_memneq(d,router->cache_info.identity_digest, DIGEST_LEN)) {
  1877. log_warn(LD_DIR, "Fingerprint '%s' does not match identity digest.",
  1878. tok->args[0]);
  1879. goto err;
  1880. }
  1881. }
  1882. if ((tok = find_opt_by_keyword(tokens, K_PLATFORM))) {
  1883. router->platform = tor_strdup(tok->args[0]);
  1884. }
  1885. if ((tok = find_opt_by_keyword(tokens, K_CONTACT))) {
  1886. router->contact_info = tor_strdup(tok->args[0]);
  1887. }
  1888. if (find_opt_by_keyword(tokens, K_REJECT6) ||
  1889. find_opt_by_keyword(tokens, K_ACCEPT6)) {
  1890. log_warn(LD_DIR, "Rejecting router with reject6/accept6 line: they crash "
  1891. "older Tors.");
  1892. goto err;
  1893. }
  1894. {
  1895. smartlist_t *or_addresses = find_all_by_keyword(tokens, K_OR_ADDRESS);
  1896. if (or_addresses) {
  1897. find_single_ipv6_orport(or_addresses, &router->ipv6_addr,
  1898. &router->ipv6_orport);
  1899. smartlist_free(or_addresses);
  1900. }
  1901. }
  1902. exit_policy_tokens = find_all_exitpolicy(tokens);
  1903. if (!smartlist_len(exit_policy_tokens)) {
  1904. log_warn(LD_DIR, "No exit policy tokens in descriptor.");
  1905. goto err;
  1906. }
  1907. SMARTLIST_FOREACH(exit_policy_tokens, directory_token_t *, t,
  1908. if (router_add_exit_policy(router,t)<0) {
  1909. log_warn(LD_DIR,"Error in exit policy");
  1910. goto err;
  1911. });
  1912. policy_expand_private(&router->exit_policy);
  1913. if ((tok = find_opt_by_keyword(tokens, K_IPV6_POLICY)) && tok->n_args) {
  1914. router->ipv6_exit_policy = parse_short_policy(tok->args[0]);
  1915. if (! router->ipv6_exit_policy) {
  1916. log_warn(LD_DIR , "Error in ipv6-policy %s", escaped(tok->args[0]));
  1917. goto err;
  1918. }
  1919. }
  1920. if (policy_is_reject_star(router->exit_policy, AF_INET) &&
  1921. (!router->ipv6_exit_policy ||
  1922. short_policy_is_reject_star(router->ipv6_exit_policy)))
  1923. router->policy_is_reject_star = 1;
  1924. if ((tok = find_opt_by_keyword(tokens, K_FAMILY)) && tok->n_args) {
  1925. int i;
  1926. router->declared_family = smartlist_new();
  1927. for (i=0;i<tok->n_args;++i) {
  1928. if (!is_legal_nickname_or_hexdigest(tok->args[i])) {
  1929. log_warn(LD_DIR, "Illegal nickname %s in family line",
  1930. escaped(tok->args[i]));
  1931. goto err;
  1932. }
  1933. smartlist_add(router->declared_family, tor_strdup(tok->args[i]));
  1934. }
  1935. }
  1936. if (find_opt_by_keyword(tokens, K_CACHES_EXTRA_INFO))
  1937. router->caches_extra_info = 1;
  1938. if (find_opt_by_keyword(tokens, K_ALLOW_SINGLE_HOP_EXITS))
  1939. router->allow_single_hop_exits = 1;
  1940. if ((tok = find_opt_by_keyword(tokens, K_EXTRA_INFO_DIGEST))) {
  1941. tor_assert(tok->n_args >= 1);
  1942. if (strlen(tok->args[0]) == HEX_DIGEST_LEN) {
  1943. if (base16_decode(router->cache_info.extra_info_digest, DIGEST_LEN,
  1944. tok->args[0], HEX_DIGEST_LEN) != DIGEST_LEN) {
  1945. log_warn(LD_DIR,"Invalid extra info digest");
  1946. }
  1947. } else {
  1948. log_warn(LD_DIR, "Invalid extra info digest %s", escaped(tok->args[0]));
  1949. }
  1950. if (tok->n_args >= 2) {
  1951. if (digest256_from_base64(router->cache_info.extra_info_digest256,
  1952. tok->args[1]) < 0) {
  1953. log_warn(LD_DIR, "Invalid extra info digest256 %s",
  1954. escaped(tok->args[1]));
  1955. }
  1956. }
  1957. }
  1958. if (find_opt_by_keyword(tokens, K_HIDDEN_SERVICE_DIR)) {
  1959. router->wants_to_be_hs_dir = 1;
  1960. }
  1961. /* This router accepts tunnelled directory requests via begindir if it has
  1962. * an open dirport or it included "tunnelled-dir-server". */
  1963. if (find_opt_by_keyword(tokens, K_DIR_TUNNELLED) || router->dir_port > 0) {
  1964. router->supports_tunnelled_dir_requests = 1;
  1965. }
  1966. tok = find_by_keyword(tokens, K_ROUTER_SIGNATURE);
  1967. note_crypto_pk_op(VERIFY_RTR);
  1968. #ifdef COUNT_DISTINCT_DIGESTS
  1969. if (!verified_digests)
  1970. verified_digests = digestmap_new();
  1971. digestmap_set(verified_digests, signed_digest, (void*)(uintptr_t)1);
  1972. #endif
  1973. if (!router->or_port) {
  1974. log_warn(LD_DIR,"or_port unreadable or 0. Failing.");
  1975. goto err;
  1976. }
  1977. /* We've checked everything that's covered by the hash. */
  1978. can_dl_again = 1;
  1979. if (check_signature_token(digest, DIGEST_LEN, tok, router->identity_pkey, 0,
  1980. "router descriptor") < 0)
  1981. goto err;
  1982. if (!router->platform) {
  1983. router->platform = tor_strdup("<unknown>");
  1984. }
  1985. goto done;
  1986. err:
  1987. dump_desc(s_dup, "router descriptor");
  1988. routerinfo_free(router);
  1989. router = NULL;
  1990. done:
  1991. tor_cert_free(ntor_cc_cert);
  1992. if (tokens) {
  1993. SMARTLIST_FOREACH(tokens, directory_token_t *, t, token_clear(t));
  1994. smartlist_free(tokens);
  1995. }
  1996. smartlist_free(exit_policy_tokens);
  1997. if (area) {
  1998. DUMP_AREA(area, "routerinfo");
  1999. memarea_drop_all(area);
  2000. }
  2001. if (can_dl_again_out)
  2002. *can_dl_again_out = can_dl_again;
  2003. return router;
  2004. }
  2005. /** Parse a single extrainfo entry from the string <b>s</b>, ending at
  2006. * <b>end</b>. (If <b>end</b> is NULL, parse up to the end of <b>s</b>.) If
  2007. * <b>cache_copy</b> is true, make a copy of the extra-info document in the
  2008. * cache_info fields of the result. If <b>routermap</b> is provided, use it
  2009. * as a map from router identity to routerinfo_t when looking up signing keys.
  2010. *
  2011. * If <b>can_dl_again_out</b> is provided, set *<b>can_dl_again_out</b> to 1
  2012. * if it's okay to try to download an extrainfo with this same digest again,
  2013. * and 0 if it isn't. (It might not be okay to download it again if part of
  2014. * the part covered by the digest is invalid.)
  2015. */
  2016. extrainfo_t *
  2017. extrainfo_parse_entry_from_string(const char *s, const char *end,
  2018. int cache_copy, struct digest_ri_map_t *routermap,
  2019. int *can_dl_again_out)
  2020. {
  2021. extrainfo_t *extrainfo = NULL;
  2022. char digest[128];
  2023. smartlist_t *tokens = NULL;
  2024. directory_token_t *tok;
  2025. crypto_pk_t *key = NULL;
  2026. routerinfo_t *router = NULL;
  2027. memarea_t *area = NULL;
  2028. const char *s_dup = s;
  2029. /* Do not set this to '1' until we have parsed everything that we intend to
  2030. * parse that's covered by the hash. */
  2031. int can_dl_again = 0;
  2032. if (!end) {
  2033. end = s + strlen(s);
  2034. }
  2035. /* point 'end' to a point immediately after the final newline. */
  2036. while (end > s+2 && *(end-1) == '\n' && *(end-2) == '\n')
  2037. --end;
  2038. if (router_get_extrainfo_hash(s, end-s, digest) < 0) {
  2039. log_warn(LD_DIR, "Couldn't compute router hash.");
  2040. goto err;
  2041. }
  2042. tokens = smartlist_new();
  2043. area = memarea_new();
  2044. if (tokenize_string(area,s,end,tokens,extrainfo_token_table,0)) {
  2045. log_warn(LD_DIR, "Error tokenizing extra-info document.");
  2046. goto err;
  2047. }
  2048. if (smartlist_len(tokens) < 2) {
  2049. log_warn(LD_DIR, "Impossibly short extra-info document.");
  2050. goto err;
  2051. }
  2052. /* XXXX Accept this in position 1 too, and ed identity in position 0. */
  2053. tok = smartlist_get(tokens,0);
  2054. if (tok->tp != K_EXTRA_INFO) {
  2055. log_warn(LD_DIR,"Entry does not start with \"extra-info\"");
  2056. goto err;
  2057. }
  2058. extrainfo = tor_malloc_zero(sizeof(extrainfo_t));
  2059. extrainfo->cache_info.is_extrainfo = 1;
  2060. if (cache_copy)
  2061. extrainfo->cache_info.signed_descriptor_body = tor_memdup_nulterm(s,end-s);
  2062. extrainfo->cache_info.signed_descriptor_len = end-s;
  2063. memcpy(extrainfo->cache_info.signed_descriptor_digest, digest, DIGEST_LEN);
  2064. crypto_digest256((char*)extrainfo->digest256, s, end-s, DIGEST_SHA256);
  2065. tor_assert(tok->n_args >= 2);
  2066. if (!is_legal_nickname(tok->args[0])) {
  2067. log_warn(LD_DIR,"Bad nickname %s on \"extra-info\"",escaped(tok->args[0]));
  2068. goto err;
  2069. }
  2070. strlcpy(extrainfo->nickname, tok->args[0], sizeof(extrainfo->nickname));
  2071. if (strlen(tok->args[1]) != HEX_DIGEST_LEN ||
  2072. base16_decode(extrainfo->cache_info.identity_digest, DIGEST_LEN,
  2073. tok->args[1], HEX_DIGEST_LEN) != DIGEST_LEN) {
  2074. log_warn(LD_DIR,"Invalid fingerprint %s on \"extra-info\"",
  2075. escaped(tok->args[1]));
  2076. goto err;
  2077. }
  2078. tok = find_by_keyword(tokens, K_PUBLISHED);
  2079. if (parse_iso_time(tok->args[0], &extrainfo->cache_info.published_on)) {
  2080. log_warn(LD_DIR,"Invalid published time %s on \"extra-info\"",
  2081. escaped(tok->args[0]));
  2082. goto err;
  2083. }
  2084. {
  2085. directory_token_t *ed_sig_tok, *ed_cert_tok;
  2086. ed_sig_tok = find_opt_by_keyword(tokens, K_ROUTER_SIG_ED25519);
  2087. ed_cert_tok = find_opt_by_keyword(tokens, K_IDENTITY_ED25519);
  2088. int n_ed_toks = !!ed_sig_tok + !!ed_cert_tok;
  2089. if (n_ed_toks != 0 && n_ed_toks != 2) {
  2090. log_warn(LD_DIR, "Router descriptor with only partial ed25519/"
  2091. "cross-certification support");
  2092. goto err;
  2093. }
  2094. if (ed_sig_tok) {
  2095. tor_assert(ed_cert_tok);
  2096. const int ed_cert_token_pos = smartlist_pos(tokens, ed_cert_tok);
  2097. if (ed_cert_token_pos != 1) {
  2098. /* Accept this in position 0 XXXX */
  2099. log_warn(LD_DIR, "Ed25519 certificate in wrong position");
  2100. goto err;
  2101. }
  2102. if (ed_sig_tok != smartlist_get(tokens, smartlist_len(tokens)-2)) {
  2103. log_warn(LD_DIR, "Ed25519 signature in wrong position");
  2104. goto err;
  2105. }
  2106. if (strcmp(ed_cert_tok->object_type, "ED25519 CERT")) {
  2107. log_warn(LD_DIR, "Wrong object type on identity-ed25519 in decriptor");
  2108. goto err;
  2109. }
  2110. uint8_t d256[DIGEST256_LEN];
  2111. const char *signed_start, *signed_end;
  2112. tor_cert_t *cert = tor_cert_parse(
  2113. (const uint8_t*)ed_cert_tok->object_body,
  2114. ed_cert_tok->object_size);
  2115. if (! cert) {
  2116. log_warn(LD_DIR, "Couldn't parse ed25519 cert");
  2117. goto err;
  2118. }
  2119. /* makes sure it gets freed. */
  2120. extrainfo->cache_info.signing_key_cert = cert;
  2121. if (cert->cert_type != CERT_TYPE_ID_SIGNING ||
  2122. ! cert->signing_key_included) {
  2123. log_warn(LD_DIR, "Invalid form for ed25519 cert");
  2124. goto err;
  2125. }
  2126. if (router_get_hash_impl_helper(s, end-s, "extra-info ",
  2127. "\nrouter-sig-ed25519",
  2128. ' ', &signed_start, &signed_end) < 0) {
  2129. log_warn(LD_DIR, "Can't find ed25519-signed portion of extrainfo");
  2130. goto err;
  2131. }
  2132. crypto_digest_t *d = crypto_digest256_new(DIGEST_SHA256);
  2133. crypto_digest_add_bytes(d, ED_DESC_SIGNATURE_PREFIX,
  2134. strlen(ED_DESC_SIGNATURE_PREFIX));
  2135. crypto_digest_add_bytes(d, signed_start, signed_end-signed_start);
  2136. crypto_digest_get_digest(d, (char*)d256, sizeof(d256));
  2137. crypto_digest_free(d);
  2138. ed25519_checkable_t check[2];
  2139. int check_ok[2];
  2140. if (tor_cert_get_checkable_sig(&check[0], cert, NULL) < 0) {
  2141. log_err(LD_BUG, "Couldn't create 'checkable' for cert.");
  2142. goto err;
  2143. }
  2144. if (ed25519_signature_from_base64(&check[1].signature,
  2145. ed_sig_tok->args[0])<0) {
  2146. log_warn(LD_DIR, "Couldn't decode ed25519 signature");
  2147. goto err;
  2148. }
  2149. check[1].pubkey = &cert->signed_key;
  2150. check[1].msg = d256;
  2151. check[1].len = DIGEST256_LEN;
  2152. if (ed25519_checksig_batch(check_ok, check, 2) < 0) {
  2153. log_warn(LD_DIR, "Incorrect ed25519 signature(s)");
  2154. goto err;
  2155. }
  2156. /* We don't check the certificate expiration time: checking that it
  2157. * matches the cert in the router descriptor is adequate. */
  2158. }
  2159. }
  2160. /* We've checked everything that's covered by the hash. */
  2161. can_dl_again = 1;
  2162. if (routermap &&
  2163. (router = digestmap_get((digestmap_t*)routermap,
  2164. extrainfo->cache_info.identity_digest))) {
  2165. key = router->identity_pkey;
  2166. }
  2167. tok = find_by_keyword(tokens, K_ROUTER_SIGNATURE);
  2168. if (strcmp(tok->object_type, "SIGNATURE") ||
  2169. tok->object_size < 128 || tok->object_size > 512) {
  2170. log_warn(LD_DIR, "Bad object type or length on extra-info signature");
  2171. goto err;
  2172. }
  2173. if (key) {
  2174. note_crypto_pk_op(VERIFY_RTR);
  2175. if (check_signature_token(digest, DIGEST_LEN, tok, key, 0,
  2176. "extra-info") < 0)
  2177. goto err;
  2178. if (router)
  2179. extrainfo->cache_info.send_unencrypted =
  2180. router->cache_info.send_unencrypted;
  2181. } else {
  2182. extrainfo->pending_sig = tor_memdup(tok->object_body,
  2183. tok->object_size);
  2184. extrainfo->pending_sig_len = tok->object_size;
  2185. }
  2186. goto done;
  2187. err:
  2188. dump_desc(s_dup, "extra-info descriptor");
  2189. extrainfo_free(extrainfo);
  2190. extrainfo = NULL;
  2191. done:
  2192. if (tokens) {
  2193. SMARTLIST_FOREACH(tokens, directory_token_t *, t, token_clear(t));
  2194. smartlist_free(tokens);
  2195. }
  2196. if (area) {
  2197. DUMP_AREA(area, "extrainfo");
  2198. memarea_drop_all(area);
  2199. }
  2200. if (can_dl_again_out)
  2201. *can_dl_again_out = can_dl_again;
  2202. return extrainfo;
  2203. }
  2204. /** Parse a key certificate from <b>s</b>; point <b>end-of-string</b> to
  2205. * the first character after the certificate. */
  2206. authority_cert_t *
  2207. authority_cert_parse_from_string(const char *s, const char **end_of_string)
  2208. {
  2209. /** Reject any certificate at least this big; it is probably an overflow, an
  2210. * attack, a bug, or some other nonsense. */
  2211. #define MAX_CERT_SIZE (128*1024)
  2212. authority_cert_t *cert = NULL, *old_cert;
  2213. smartlist_t *tokens = NULL;
  2214. char digest[DIGEST_LEN];
  2215. directory_token_t *tok;
  2216. char fp_declared[DIGEST_LEN];
  2217. char *eos;
  2218. size_t len;
  2219. int found;
  2220. memarea_t *area = NULL;
  2221. const char *s_dup = s;
  2222. s = eat_whitespace(s);
  2223. eos = strstr(s, "\ndir-key-certification");
  2224. if (! eos) {
  2225. log_warn(LD_DIR, "No signature found on key certificate");
  2226. return NULL;
  2227. }
  2228. eos = strstr(eos, "\n-----END SIGNATURE-----\n");
  2229. if (! eos) {
  2230. log_warn(LD_DIR, "No end-of-signature found on key certificate");
  2231. return NULL;
  2232. }
  2233. eos = strchr(eos+2, '\n');
  2234. tor_assert(eos);
  2235. ++eos;
  2236. len = eos - s;
  2237. if (len > MAX_CERT_SIZE) {
  2238. log_warn(LD_DIR, "Certificate is far too big (at %lu bytes long); "
  2239. "rejecting", (unsigned long)len);
  2240. return NULL;
  2241. }
  2242. tokens = smartlist_new();
  2243. area = memarea_new();
  2244. if (tokenize_string(area,s, eos, tokens, dir_key_certificate_table, 0) < 0) {
  2245. log_warn(LD_DIR, "Error tokenizing key certificate");
  2246. goto err;
  2247. }
  2248. if (router_get_hash_impl(s, strlen(s), digest, "dir-key-certificate-version",
  2249. "\ndir-key-certification", '\n', DIGEST_SHA1) < 0)
  2250. goto err;
  2251. tok = smartlist_get(tokens, 0);
  2252. if (tok->tp != K_DIR_KEY_CERTIFICATE_VERSION || strcmp(tok->args[0], "3")) {
  2253. log_warn(LD_DIR,
  2254. "Key certificate does not begin with a recognized version (3).");
  2255. goto err;
  2256. }
  2257. cert = tor_malloc_zero(sizeof(authority_cert_t));
  2258. memcpy(cert->cache_info.signed_descriptor_digest, digest, DIGEST_LEN);
  2259. tok = find_by_keyword(tokens, K_DIR_SIGNING_KEY);
  2260. tor_assert(tok->key);
  2261. cert->signing_key = tok->key;
  2262. tok->key = NULL;
  2263. if (crypto_pk_get_digest(cert->signing_key, cert->signing_key_digest))
  2264. goto err;
  2265. tok = find_by_keyword(tokens, K_DIR_IDENTITY_KEY);
  2266. tor_assert(tok->key);
  2267. cert->identity_key = tok->key;
  2268. tok->key = NULL;
  2269. tok = find_by_keyword(tokens, K_FINGERPRINT);
  2270. tor_assert(tok->n_args);
  2271. if (base16_decode(fp_declared, DIGEST_LEN, tok->args[0],
  2272. strlen(tok->args[0])) != DIGEST_LEN) {
  2273. log_warn(LD_DIR, "Couldn't decode key certificate fingerprint %s",
  2274. escaped(tok->args[0]));
  2275. goto err;
  2276. }
  2277. if (crypto_pk_get_digest(cert->identity_key,
  2278. cert->cache_info.identity_digest))
  2279. goto err;
  2280. if (tor_memneq(cert->cache_info.identity_digest, fp_declared, DIGEST_LEN)) {
  2281. log_warn(LD_DIR, "Digest of certificate key didn't match declared "
  2282. "fingerprint");
  2283. goto err;
  2284. }
  2285. tok = find_opt_by_keyword(tokens, K_DIR_ADDRESS);
  2286. if (tok) {
  2287. struct in_addr in;
  2288. char *address = NULL;
  2289. tor_assert(tok->n_args);
  2290. /* XXX++ use some tor_addr parse function below instead. -RD */
  2291. if (tor_addr_port_split(LOG_WARN, tok->args[0], &address,
  2292. &cert->dir_port) < 0 ||
  2293. tor_inet_aton(address, &in) == 0) {
  2294. log_warn(LD_DIR, "Couldn't parse dir-address in certificate");
  2295. tor_free(address);
  2296. goto err;
  2297. }
  2298. cert->addr = ntohl(in.s_addr);
  2299. tor_free(address);
  2300. }
  2301. tok = find_by_keyword(tokens, K_DIR_KEY_PUBLISHED);
  2302. if (parse_iso_time(tok->args[0], &cert->cache_info.published_on) < 0) {
  2303. goto err;
  2304. }
  2305. tok = find_by_keyword(tokens, K_DIR_KEY_EXPIRES);
  2306. if (parse_iso_time(tok->args[0], &cert->expires) < 0) {
  2307. goto err;
  2308. }
  2309. tok = smartlist_get(tokens, smartlist_len(tokens)-1);
  2310. if (tok->tp != K_DIR_KEY_CERTIFICATION) {
  2311. log_warn(LD_DIR, "Certificate didn't end with dir-key-certification.");
  2312. goto err;
  2313. }
  2314. /* If we already have this cert, don't bother checking the signature. */
  2315. old_cert = authority_cert_get_by_digests(
  2316. cert->cache_info.identity_digest,
  2317. cert->signing_key_digest);
  2318. found = 0;
  2319. if (old_cert) {
  2320. /* XXXX We could just compare signed_descriptor_digest, but that wouldn't
  2321. * buy us much. */
  2322. if (old_cert->cache_info.signed_descriptor_len == len &&
  2323. old_cert->cache_info.signed_descriptor_body &&
  2324. tor_memeq(s, old_cert->cache_info.signed_descriptor_body, len)) {
  2325. log_debug(LD_DIR, "We already checked the signature on this "
  2326. "certificate; no need to do so again.");
  2327. found = 1;
  2328. }
  2329. }
  2330. if (!found) {
  2331. if (check_signature_token(digest, DIGEST_LEN, tok, cert->identity_key, 0,
  2332. "key certificate")) {
  2333. goto err;
  2334. }
  2335. tok = find_by_keyword(tokens, K_DIR_KEY_CROSSCERT);
  2336. if (check_signature_token(cert->cache_info.identity_digest,
  2337. DIGEST_LEN,
  2338. tok,
  2339. cert->signing_key,
  2340. CST_NO_CHECK_OBJTYPE,
  2341. "key cross-certification")) {
  2342. goto err;
  2343. }
  2344. }
  2345. cert->cache_info.signed_descriptor_len = len;
  2346. cert->cache_info.signed_descriptor_body = tor_malloc(len+1);
  2347. memcpy(cert->cache_info.signed_descriptor_body, s, len);
  2348. cert->cache_info.signed_descriptor_body[len] = 0;
  2349. cert->cache_info.saved_location = SAVED_NOWHERE;
  2350. if (end_of_string) {
  2351. *end_of_string = eat_whitespace(eos);
  2352. }
  2353. SMARTLIST_FOREACH(tokens, directory_token_t *, t, token_clear(t));
  2354. smartlist_free(tokens);
  2355. if (area) {
  2356. DUMP_AREA(area, "authority cert");
  2357. memarea_drop_all(area);
  2358. }
  2359. return cert;
  2360. err:
  2361. dump_desc(s_dup, "authority cert");
  2362. authority_cert_free(cert);
  2363. SMARTLIST_FOREACH(tokens, directory_token_t *, t, token_clear(t));
  2364. smartlist_free(tokens);
  2365. if (area) {
  2366. DUMP_AREA(area, "authority cert");
  2367. memarea_drop_all(area);
  2368. }
  2369. return NULL;
  2370. }
  2371. /** Helper: given a string <b>s</b>, return the start of the next router-status
  2372. * object (starting with "r " at the start of a line). If none is found,
  2373. * return the start of the directory footer, or the next directory signature.
  2374. * If none is found, return the end of the string. */
  2375. static inline const char *
  2376. find_start_of_next_routerstatus(const char *s)
  2377. {
  2378. const char *eos, *footer, *sig;
  2379. if ((eos = strstr(s, "\nr ")))
  2380. ++eos;
  2381. else
  2382. eos = s + strlen(s);
  2383. footer = tor_memstr(s, eos-s, "\ndirectory-footer");
  2384. sig = tor_memstr(s, eos-s, "\ndirectory-signature");
  2385. if (footer && sig)
  2386. return MIN(footer, sig) + 1;
  2387. else if (footer)
  2388. return footer+1;
  2389. else if (sig)
  2390. return sig+1;
  2391. else
  2392. return eos;
  2393. }
  2394. /** Parse the GuardFraction string from a consensus or vote.
  2395. *
  2396. * If <b>vote</b> or <b>vote_rs</b> are set the document getting
  2397. * parsed is a vote routerstatus. Otherwise it's a consensus. This is
  2398. * the same semantic as in routerstatus_parse_entry_from_string(). */
  2399. STATIC int
  2400. routerstatus_parse_guardfraction(const char *guardfraction_str,
  2401. networkstatus_t *vote,
  2402. vote_routerstatus_t *vote_rs,
  2403. routerstatus_t *rs)
  2404. {
  2405. int ok;
  2406. const char *end_of_header = NULL;
  2407. int is_consensus = !vote_rs;
  2408. uint32_t guardfraction;
  2409. tor_assert(bool_eq(vote, vote_rs));
  2410. /* If this info comes from a consensus, but we should't apply
  2411. guardfraction, just exit. */
  2412. if (is_consensus && !should_apply_guardfraction(NULL)) {
  2413. return 0;
  2414. }
  2415. end_of_header = strchr(guardfraction_str, '=');
  2416. if (!end_of_header) {
  2417. return -1;
  2418. }
  2419. guardfraction = (uint32_t)tor_parse_ulong(end_of_header+1,
  2420. 10, 0, 100, &ok, NULL);
  2421. if (!ok) {
  2422. log_warn(LD_DIR, "Invalid GuardFraction %s", escaped(guardfraction_str));
  2423. return -1;
  2424. }
  2425. log_debug(LD_GENERAL, "[*] Parsed %s guardfraction '%s' for '%s'.",
  2426. is_consensus ? "consensus" : "vote",
  2427. guardfraction_str, rs->nickname);
  2428. if (!is_consensus) { /* We are parsing a vote */
  2429. vote_rs->status.guardfraction_percentage = guardfraction;
  2430. vote_rs->status.has_guardfraction = 1;
  2431. } else {
  2432. /* We are parsing a consensus. Only apply guardfraction to guards. */
  2433. if (rs->is_possible_guard) {
  2434. rs->guardfraction_percentage = guardfraction;
  2435. rs->has_guardfraction = 1;
  2436. } else {
  2437. log_warn(LD_BUG, "Got GuardFraction for non-guard %s. "
  2438. "This is not supposed to happen. Not applying. ", rs->nickname);
  2439. }
  2440. }
  2441. return 0;
  2442. }
  2443. /** Given a string at *<b>s</b>, containing a routerstatus object, and an
  2444. * empty smartlist at <b>tokens</b>, parse and return the first router status
  2445. * object in the string, and advance *<b>s</b> to just after the end of the
  2446. * router status. Return NULL and advance *<b>s</b> on error.
  2447. *
  2448. * If <b>vote</b> and <b>vote_rs</b> are provided, don't allocate a fresh
  2449. * routerstatus but use <b>vote_rs</b> instead.
  2450. *
  2451. * If <b>consensus_method</b> is nonzero, this routerstatus is part of a
  2452. * consensus, and we should parse it according to the method used to
  2453. * make that consensus.
  2454. *
  2455. * Parse according to the syntax used by the consensus flavor <b>flav</b>.
  2456. **/
  2457. static routerstatus_t *
  2458. routerstatus_parse_entry_from_string(memarea_t *area,
  2459. const char **s, smartlist_t *tokens,
  2460. networkstatus_t *vote,
  2461. vote_routerstatus_t *vote_rs,
  2462. int consensus_method,
  2463. consensus_flavor_t flav)
  2464. {
  2465. const char *eos, *s_dup = *s;
  2466. routerstatus_t *rs = NULL;
  2467. directory_token_t *tok;
  2468. char timebuf[ISO_TIME_LEN+1];
  2469. struct in_addr in;
  2470. int offset = 0;
  2471. tor_assert(tokens);
  2472. tor_assert(bool_eq(vote, vote_rs));
  2473. if (!consensus_method)
  2474. flav = FLAV_NS;
  2475. tor_assert(flav == FLAV_NS || flav == FLAV_MICRODESC);
  2476. eos = find_start_of_next_routerstatus(*s);
  2477. if (tokenize_string(area,*s, eos, tokens, rtrstatus_token_table,0)) {
  2478. log_warn(LD_DIR, "Error tokenizing router status");
  2479. goto err;
  2480. }
  2481. if (smartlist_len(tokens) < 1) {
  2482. log_warn(LD_DIR, "Impossibly short router status");
  2483. goto err;
  2484. }
  2485. tok = find_by_keyword(tokens, K_R);
  2486. tor_assert(tok->n_args >= 7); /* guaranteed by GE(7) in K_R setup */
  2487. if (flav == FLAV_NS) {
  2488. if (tok->n_args < 8) {
  2489. log_warn(LD_DIR, "Too few arguments to r");
  2490. goto err;
  2491. }
  2492. } else if (flav == FLAV_MICRODESC) {
  2493. offset = -1; /* There is no identity digest */
  2494. }
  2495. if (vote_rs) {
  2496. rs = &vote_rs->status;
  2497. } else {
  2498. rs = tor_malloc_zero(sizeof(routerstatus_t));
  2499. }
  2500. if (!is_legal_nickname(tok->args[0])) {
  2501. log_warn(LD_DIR,
  2502. "Invalid nickname %s in router status; skipping.",
  2503. escaped(tok->args[0]));
  2504. goto err;
  2505. }
  2506. strlcpy(rs->nickname, tok->args[0], sizeof(rs->nickname));
  2507. if (digest_from_base64(rs->identity_digest, tok->args[1])) {
  2508. log_warn(LD_DIR, "Error decoding identity digest %s",
  2509. escaped(tok->args[1]));
  2510. goto err;
  2511. }
  2512. if (flav == FLAV_NS) {
  2513. if (digest_from_base64(rs->descriptor_digest, tok->args[2])) {
  2514. log_warn(LD_DIR, "Error decoding descriptor digest %s",
  2515. escaped(tok->args[2]));
  2516. goto err;
  2517. }
  2518. }
  2519. if (tor_snprintf(timebuf, sizeof(timebuf), "%s %s",
  2520. tok->args[3+offset], tok->args[4+offset]) < 0 ||
  2521. parse_iso_time(timebuf, &rs->published_on)<0) {
  2522. log_warn(LD_DIR, "Error parsing time '%s %s' [%d %d]",
  2523. tok->args[3+offset], tok->args[4+offset],
  2524. offset, (int)flav);
  2525. goto err;
  2526. }
  2527. if (tor_inet_aton(tok->args[5+offset], &in) == 0) {
  2528. log_warn(LD_DIR, "Error parsing router address in network-status %s",
  2529. escaped(tok->args[5+offset]));
  2530. goto err;
  2531. }
  2532. rs->addr = ntohl(in.s_addr);
  2533. rs->or_port = (uint16_t) tor_parse_long(tok->args[6+offset],
  2534. 10,0,65535,NULL,NULL);
  2535. rs->dir_port = (uint16_t) tor_parse_long(tok->args[7+offset],
  2536. 10,0,65535,NULL,NULL);
  2537. {
  2538. smartlist_t *a_lines = find_all_by_keyword(tokens, K_A);
  2539. if (a_lines) {
  2540. find_single_ipv6_orport(a_lines, &rs->ipv6_addr, &rs->ipv6_orport);
  2541. smartlist_free(a_lines);
  2542. }
  2543. }
  2544. tok = find_opt_by_keyword(tokens, K_S);
  2545. if (tok && vote) {
  2546. int i;
  2547. vote_rs->flags = 0;
  2548. for (i=0; i < tok->n_args; ++i) {
  2549. int p = smartlist_string_pos(vote->known_flags, tok->args[i]);
  2550. if (p >= 0) {
  2551. vote_rs->flags |= (U64_LITERAL(1)<<p);
  2552. } else {
  2553. log_warn(LD_DIR, "Flags line had a flag %s not listed in known_flags.",
  2554. escaped(tok->args[i]));
  2555. goto err;
  2556. }
  2557. }
  2558. } else if (tok) {
  2559. int i;
  2560. for (i=0; i < tok->n_args; ++i) {
  2561. if (!strcmp(tok->args[i], "Exit"))
  2562. rs->is_exit = 1;
  2563. else if (!strcmp(tok->args[i], "Stable"))
  2564. rs->is_stable = 1;
  2565. else if (!strcmp(tok->args[i], "Fast"))
  2566. rs->is_fast = 1;
  2567. else if (!strcmp(tok->args[i], "Running"))
  2568. rs->is_flagged_running = 1;
  2569. else if (!strcmp(tok->args[i], "Named"))
  2570. rs->is_named = 1;
  2571. else if (!strcmp(tok->args[i], "Valid"))
  2572. rs->is_valid = 1;
  2573. else if (!strcmp(tok->args[i], "Guard"))
  2574. rs->is_possible_guard = 1;
  2575. else if (!strcmp(tok->args[i], "BadExit"))
  2576. rs->is_bad_exit = 1;
  2577. else if (!strcmp(tok->args[i], "Authority"))
  2578. rs->is_authority = 1;
  2579. else if (!strcmp(tok->args[i], "Unnamed") &&
  2580. consensus_method >= 2) {
  2581. /* Unnamed is computed right by consensus method 2 and later. */
  2582. rs->is_unnamed = 1;
  2583. } else if (!strcmp(tok->args[i], "HSDir")) {
  2584. rs->is_hs_dir = 1;
  2585. } else if (!strcmp(tok->args[i], "V2Dir")) {
  2586. rs->is_v2_dir = 1;
  2587. }
  2588. }
  2589. }
  2590. if ((tok = find_opt_by_keyword(tokens, K_V))) {
  2591. tor_assert(tok->n_args == 1);
  2592. rs->version_known = 1;
  2593. if (strcmpstart(tok->args[0], "Tor ")) {
  2594. } else {
  2595. rs->version_supports_extend2_cells =
  2596. tor_version_as_new_as(tok->args[0], "0.2.4.8-alpha");
  2597. }
  2598. if (vote_rs) {
  2599. vote_rs->version = tor_strdup(tok->args[0]);
  2600. }
  2601. }
  2602. /* handle weighting/bandwidth info */
  2603. if ((tok = find_opt_by_keyword(tokens, K_W))) {
  2604. int i;
  2605. for (i=0; i < tok->n_args; ++i) {
  2606. if (!strcmpstart(tok->args[i], "Bandwidth=")) {
  2607. int ok;
  2608. rs->bandwidth_kb =
  2609. (uint32_t)tor_parse_ulong(strchr(tok->args[i], '=')+1,
  2610. 10, 0, UINT32_MAX,
  2611. &ok, NULL);
  2612. if (!ok) {
  2613. log_warn(LD_DIR, "Invalid Bandwidth %s", escaped(tok->args[i]));
  2614. goto err;
  2615. }
  2616. rs->has_bandwidth = 1;
  2617. } else if (!strcmpstart(tok->args[i], "Measured=") && vote_rs) {
  2618. int ok;
  2619. vote_rs->measured_bw_kb =
  2620. (uint32_t)tor_parse_ulong(strchr(tok->args[i], '=')+1,
  2621. 10, 0, UINT32_MAX, &ok, NULL);
  2622. if (!ok) {
  2623. log_warn(LD_DIR, "Invalid Measured Bandwidth %s",
  2624. escaped(tok->args[i]));
  2625. goto err;
  2626. }
  2627. vote_rs->has_measured_bw = 1;
  2628. vote->has_measured_bws = 1;
  2629. } else if (!strcmpstart(tok->args[i], "Unmeasured=1")) {
  2630. rs->bw_is_unmeasured = 1;
  2631. } else if (!strcmpstart(tok->args[i], "GuardFraction=")) {
  2632. if (routerstatus_parse_guardfraction(tok->args[i],
  2633. vote, vote_rs, rs) < 0) {
  2634. goto err;
  2635. }
  2636. }
  2637. }
  2638. }
  2639. /* parse exit policy summaries */
  2640. if ((tok = find_opt_by_keyword(tokens, K_P))) {
  2641. tor_assert(tok->n_args == 1);
  2642. if (strcmpstart(tok->args[0], "accept ") &&
  2643. strcmpstart(tok->args[0], "reject ")) {
  2644. log_warn(LD_DIR, "Unknown exit policy summary type %s.",
  2645. escaped(tok->args[0]));
  2646. goto err;
  2647. }
  2648. /* XXX weasel: parse this into ports and represent them somehow smart,
  2649. * maybe not here but somewhere on if we need it for the client.
  2650. * we should still parse it here to check it's valid tho.
  2651. */
  2652. rs->exitsummary = tor_strdup(tok->args[0]);
  2653. rs->has_exitsummary = 1;
  2654. }
  2655. if (vote_rs) {
  2656. SMARTLIST_FOREACH_BEGIN(tokens, directory_token_t *, t) {
  2657. if (t->tp == K_M && t->n_args) {
  2658. vote_microdesc_hash_t *line =
  2659. tor_malloc(sizeof(vote_microdesc_hash_t));
  2660. line->next = vote_rs->microdesc;
  2661. line->microdesc_hash_line = tor_strdup(t->args[0]);
  2662. vote_rs->microdesc = line;
  2663. }
  2664. if (t->tp == K_ID) {
  2665. tor_assert(t->n_args >= 2);
  2666. if (!strcmp(t->args[0], "ed25519")) {
  2667. vote_rs->has_ed25519_listing = 1;
  2668. if (strcmp(t->args[1], "none") &&
  2669. digest256_from_base64((char*)vote_rs->ed25519_id,
  2670. t->args[1])<0) {
  2671. log_warn(LD_DIR, "Bogus ed25519 key in networkstatus vote");
  2672. goto err;
  2673. }
  2674. }
  2675. }
  2676. } SMARTLIST_FOREACH_END(t);
  2677. } else if (flav == FLAV_MICRODESC) {
  2678. tok = find_opt_by_keyword(tokens, K_M);
  2679. if (tok) {
  2680. tor_assert(tok->n_args);
  2681. if (digest256_from_base64(rs->descriptor_digest, tok->args[0])) {
  2682. log_warn(LD_DIR, "Error decoding microdescriptor digest %s",
  2683. escaped(tok->args[0]));
  2684. goto err;
  2685. }
  2686. } else {
  2687. log_info(LD_BUG, "Found an entry in networkstatus with no "
  2688. "microdescriptor digest. (Router %s ($%s) at %s:%d.)",
  2689. rs->nickname, hex_str(rs->identity_digest, DIGEST_LEN),
  2690. fmt_addr32(rs->addr), rs->or_port);
  2691. }
  2692. }
  2693. if (!strcasecmp(rs->nickname, UNNAMED_ROUTER_NICKNAME))
  2694. rs->is_named = 0;
  2695. goto done;
  2696. err:
  2697. dump_desc(s_dup, "routerstatus entry");
  2698. if (rs && !vote_rs)
  2699. routerstatus_free(rs);
  2700. rs = NULL;
  2701. done:
  2702. SMARTLIST_FOREACH(tokens, directory_token_t *, t, token_clear(t));
  2703. smartlist_clear(tokens);
  2704. if (area) {
  2705. DUMP_AREA(area, "routerstatus entry");
  2706. memarea_clear(area);
  2707. }
  2708. *s = eos;
  2709. return rs;
  2710. }
  2711. int
  2712. compare_vote_routerstatus_entries(const void **_a, const void **_b)
  2713. {
  2714. const vote_routerstatus_t *a = *_a, *b = *_b;
  2715. return fast_memcmp(a->status.identity_digest, b->status.identity_digest,
  2716. DIGEST_LEN);
  2717. }
  2718. /** Verify the bandwidth weights of a network status document */
  2719. int
  2720. networkstatus_verify_bw_weights(networkstatus_t *ns, int consensus_method)
  2721. {
  2722. int64_t weight_scale;
  2723. int64_t G=0, M=0, E=0, D=0, T=0;
  2724. double Wgg, Wgm, Wgd, Wmg, Wmm, Wme, Wmd, Weg, Wem, Wee, Wed;
  2725. double Gtotal=0, Mtotal=0, Etotal=0;
  2726. const char *casename = NULL;
  2727. int valid = 1;
  2728. (void) consensus_method;
  2729. weight_scale = networkstatus_get_weight_scale_param(ns);
  2730. Wgg = networkstatus_get_bw_weight(ns, "Wgg", -1);
  2731. Wgm = networkstatus_get_bw_weight(ns, "Wgm", -1);
  2732. Wgd = networkstatus_get_bw_weight(ns, "Wgd", -1);
  2733. Wmg = networkstatus_get_bw_weight(ns, "Wmg", -1);
  2734. Wmm = networkstatus_get_bw_weight(ns, "Wmm", -1);
  2735. Wme = networkstatus_get_bw_weight(ns, "Wme", -1);
  2736. Wmd = networkstatus_get_bw_weight(ns, "Wmd", -1);
  2737. Weg = networkstatus_get_bw_weight(ns, "Weg", -1);
  2738. Wem = networkstatus_get_bw_weight(ns, "Wem", -1);
  2739. Wee = networkstatus_get_bw_weight(ns, "Wee", -1);
  2740. Wed = networkstatus_get_bw_weight(ns, "Wed", -1);
  2741. if (Wgg<0 || Wgm<0 || Wgd<0 || Wmg<0 || Wmm<0 || Wme<0 || Wmd<0 || Weg<0
  2742. || Wem<0 || Wee<0 || Wed<0) {
  2743. log_warn(LD_BUG, "No bandwidth weights produced in consensus!");
  2744. return 0;
  2745. }
  2746. // First, sanity check basic summing properties that hold for all cases
  2747. // We use > 1 as the check for these because they are computed as integers.
  2748. // Sometimes there are rounding errors.
  2749. if (fabs(Wmm - weight_scale) > 1) {
  2750. log_warn(LD_BUG, "Wmm=%f != "I64_FORMAT,
  2751. Wmm, I64_PRINTF_ARG(weight_scale));
  2752. valid = 0;
  2753. }
  2754. if (fabs(Wem - Wee) > 1) {
  2755. log_warn(LD_BUG, "Wem=%f != Wee=%f", Wem, Wee);
  2756. valid = 0;
  2757. }
  2758. if (fabs(Wgm - Wgg) > 1) {
  2759. log_warn(LD_BUG, "Wgm=%f != Wgg=%f", Wgm, Wgg);
  2760. valid = 0;
  2761. }
  2762. if (fabs(Weg - Wed) > 1) {
  2763. log_warn(LD_BUG, "Wed=%f != Weg=%f", Wed, Weg);
  2764. valid = 0;
  2765. }
  2766. if (fabs(Wgg + Wmg - weight_scale) > 0.001*weight_scale) {
  2767. log_warn(LD_BUG, "Wgg=%f != "I64_FORMAT" - Wmg=%f", Wgg,
  2768. I64_PRINTF_ARG(weight_scale), Wmg);
  2769. valid = 0;
  2770. }
  2771. if (fabs(Wee + Wme - weight_scale) > 0.001*weight_scale) {
  2772. log_warn(LD_BUG, "Wee=%f != "I64_FORMAT" - Wme=%f", Wee,
  2773. I64_PRINTF_ARG(weight_scale), Wme);
  2774. valid = 0;
  2775. }
  2776. if (fabs(Wgd + Wmd + Wed - weight_scale) > 0.001*weight_scale) {
  2777. log_warn(LD_BUG, "Wgd=%f + Wmd=%f + Wed=%f != "I64_FORMAT,
  2778. Wgd, Wmd, Wed, I64_PRINTF_ARG(weight_scale));
  2779. valid = 0;
  2780. }
  2781. Wgg /= weight_scale;
  2782. Wgm /= weight_scale;
  2783. Wgd /= weight_scale;
  2784. Wmg /= weight_scale;
  2785. Wmm /= weight_scale;
  2786. Wme /= weight_scale;
  2787. Wmd /= weight_scale;
  2788. Weg /= weight_scale;
  2789. Wem /= weight_scale;
  2790. Wee /= weight_scale;
  2791. Wed /= weight_scale;
  2792. // Then, gather G, M, E, D, T to determine case
  2793. SMARTLIST_FOREACH_BEGIN(ns->routerstatus_list, routerstatus_t *, rs) {
  2794. int is_exit = 0;
  2795. /* Bug #2203: Don't count bad exits as exits for balancing */
  2796. is_exit = rs->is_exit && !rs->is_bad_exit;
  2797. if (rs->has_bandwidth) {
  2798. T += rs->bandwidth_kb;
  2799. if (is_exit && rs->is_possible_guard) {
  2800. D += rs->bandwidth_kb;
  2801. Gtotal += Wgd*rs->bandwidth_kb;
  2802. Mtotal += Wmd*rs->bandwidth_kb;
  2803. Etotal += Wed*rs->bandwidth_kb;
  2804. } else if (is_exit) {
  2805. E += rs->bandwidth_kb;
  2806. Mtotal += Wme*rs->bandwidth_kb;
  2807. Etotal += Wee*rs->bandwidth_kb;
  2808. } else if (rs->is_possible_guard) {
  2809. G += rs->bandwidth_kb;
  2810. Gtotal += Wgg*rs->bandwidth_kb;
  2811. Mtotal += Wmg*rs->bandwidth_kb;
  2812. } else {
  2813. M += rs->bandwidth_kb;
  2814. Mtotal += Wmm*rs->bandwidth_kb;
  2815. }
  2816. } else {
  2817. log_warn(LD_BUG, "Missing consensus bandwidth for router %s",
  2818. routerstatus_describe(rs));
  2819. }
  2820. } SMARTLIST_FOREACH_END(rs);
  2821. // Finally, check equality conditions depending upon case 1, 2 or 3
  2822. // Full equality cases: 1, 3b
  2823. // Partial equality cases: 2b (E=G), 3a (M=E)
  2824. // Fully unknown: 2a
  2825. if (3*E >= T && 3*G >= T) {
  2826. // Case 1: Neither are scarce
  2827. casename = "Case 1";
  2828. if (fabs(Etotal-Mtotal) > 0.01*MAX(Etotal,Mtotal)) {
  2829. log_warn(LD_DIR,
  2830. "Bw Weight Failure for %s: Etotal %f != Mtotal %f. "
  2831. "G="I64_FORMAT" M="I64_FORMAT" E="I64_FORMAT" D="I64_FORMAT
  2832. " T="I64_FORMAT". "
  2833. "Wgg=%f Wgd=%f Wmg=%f Wme=%f Wmd=%f Wee=%f Wed=%f",
  2834. casename, Etotal, Mtotal,
  2835. I64_PRINTF_ARG(G), I64_PRINTF_ARG(M), I64_PRINTF_ARG(E),
  2836. I64_PRINTF_ARG(D), I64_PRINTF_ARG(T),
  2837. Wgg, Wgd, Wmg, Wme, Wmd, Wee, Wed);
  2838. valid = 0;
  2839. }
  2840. if (fabs(Etotal-Gtotal) > 0.01*MAX(Etotal,Gtotal)) {
  2841. log_warn(LD_DIR,
  2842. "Bw Weight Failure for %s: Etotal %f != Gtotal %f. "
  2843. "G="I64_FORMAT" M="I64_FORMAT" E="I64_FORMAT" D="I64_FORMAT
  2844. " T="I64_FORMAT". "
  2845. "Wgg=%f Wgd=%f Wmg=%f Wme=%f Wmd=%f Wee=%f Wed=%f",
  2846. casename, Etotal, Gtotal,
  2847. I64_PRINTF_ARG(G), I64_PRINTF_ARG(M), I64_PRINTF_ARG(E),
  2848. I64_PRINTF_ARG(D), I64_PRINTF_ARG(T),
  2849. Wgg, Wgd, Wmg, Wme, Wmd, Wee, Wed);
  2850. valid = 0;
  2851. }
  2852. if (fabs(Gtotal-Mtotal) > 0.01*MAX(Gtotal,Mtotal)) {
  2853. log_warn(LD_DIR,
  2854. "Bw Weight Failure for %s: Mtotal %f != Gtotal %f. "
  2855. "G="I64_FORMAT" M="I64_FORMAT" E="I64_FORMAT" D="I64_FORMAT
  2856. " T="I64_FORMAT". "
  2857. "Wgg=%f Wgd=%f Wmg=%f Wme=%f Wmd=%f Wee=%f Wed=%f",
  2858. casename, Mtotal, Gtotal,
  2859. I64_PRINTF_ARG(G), I64_PRINTF_ARG(M), I64_PRINTF_ARG(E),
  2860. I64_PRINTF_ARG(D), I64_PRINTF_ARG(T),
  2861. Wgg, Wgd, Wmg, Wme, Wmd, Wee, Wed);
  2862. valid = 0;
  2863. }
  2864. } else if (3*E < T && 3*G < T) {
  2865. int64_t R = MIN(E, G);
  2866. int64_t S = MAX(E, G);
  2867. /*
  2868. * Case 2: Both Guards and Exits are scarce
  2869. * Balance D between E and G, depending upon
  2870. * D capacity and scarcity. Devote no extra
  2871. * bandwidth to middle nodes.
  2872. */
  2873. if (R+D < S) { // Subcase a
  2874. double Rtotal, Stotal;
  2875. if (E < G) {
  2876. Rtotal = Etotal;
  2877. Stotal = Gtotal;
  2878. } else {
  2879. Rtotal = Gtotal;
  2880. Stotal = Etotal;
  2881. }
  2882. casename = "Case 2a";
  2883. // Rtotal < Stotal
  2884. if (Rtotal > Stotal) {
  2885. log_warn(LD_DIR,
  2886. "Bw Weight Failure for %s: Rtotal %f > Stotal %f. "
  2887. "G="I64_FORMAT" M="I64_FORMAT" E="I64_FORMAT" D="I64_FORMAT
  2888. " T="I64_FORMAT". "
  2889. "Wgg=%f Wgd=%f Wmg=%f Wme=%f Wmd=%f Wee=%f Wed=%f",
  2890. casename, Rtotal, Stotal,
  2891. I64_PRINTF_ARG(G), I64_PRINTF_ARG(M), I64_PRINTF_ARG(E),
  2892. I64_PRINTF_ARG(D), I64_PRINTF_ARG(T),
  2893. Wgg, Wgd, Wmg, Wme, Wmd, Wee, Wed);
  2894. valid = 0;
  2895. }
  2896. // Rtotal < T/3
  2897. if (3*Rtotal > T) {
  2898. log_warn(LD_DIR,
  2899. "Bw Weight Failure for %s: 3*Rtotal %f > T "
  2900. I64_FORMAT". G="I64_FORMAT" M="I64_FORMAT" E="I64_FORMAT
  2901. " D="I64_FORMAT" T="I64_FORMAT". "
  2902. "Wgg=%f Wgd=%f Wmg=%f Wme=%f Wmd=%f Wee=%f Wed=%f",
  2903. casename, Rtotal*3, I64_PRINTF_ARG(T),
  2904. I64_PRINTF_ARG(G), I64_PRINTF_ARG(M), I64_PRINTF_ARG(E),
  2905. I64_PRINTF_ARG(D), I64_PRINTF_ARG(T),
  2906. Wgg, Wgd, Wmg, Wme, Wmd, Wee, Wed);
  2907. valid = 0;
  2908. }
  2909. // Stotal < T/3
  2910. if (3*Stotal > T) {
  2911. log_warn(LD_DIR,
  2912. "Bw Weight Failure for %s: 3*Stotal %f > T "
  2913. I64_FORMAT". G="I64_FORMAT" M="I64_FORMAT" E="I64_FORMAT
  2914. " D="I64_FORMAT" T="I64_FORMAT". "
  2915. "Wgg=%f Wgd=%f Wmg=%f Wme=%f Wmd=%f Wee=%f Wed=%f",
  2916. casename, Stotal*3, I64_PRINTF_ARG(T),
  2917. I64_PRINTF_ARG(G), I64_PRINTF_ARG(M), I64_PRINTF_ARG(E),
  2918. I64_PRINTF_ARG(D), I64_PRINTF_ARG(T),
  2919. Wgg, Wgd, Wmg, Wme, Wmd, Wee, Wed);
  2920. valid = 0;
  2921. }
  2922. // Mtotal > T/3
  2923. if (3*Mtotal < T) {
  2924. log_warn(LD_DIR,
  2925. "Bw Weight Failure for %s: 3*Mtotal %f < T "
  2926. I64_FORMAT". "
  2927. "G="I64_FORMAT" M="I64_FORMAT" E="I64_FORMAT" D="I64_FORMAT
  2928. " T="I64_FORMAT". "
  2929. "Wgg=%f Wgd=%f Wmg=%f Wme=%f Wmd=%f Wee=%f Wed=%f",
  2930. casename, Mtotal*3, I64_PRINTF_ARG(T),
  2931. I64_PRINTF_ARG(G), I64_PRINTF_ARG(M), I64_PRINTF_ARG(E),
  2932. I64_PRINTF_ARG(D), I64_PRINTF_ARG(T),
  2933. Wgg, Wgd, Wmg, Wme, Wmd, Wee, Wed);
  2934. valid = 0;
  2935. }
  2936. } else { // Subcase b: R+D > S
  2937. casename = "Case 2b";
  2938. /* Check the rare-M redirect case. */
  2939. if (D != 0 && 3*M < T) {
  2940. casename = "Case 2b (balanced)";
  2941. if (fabs(Etotal-Mtotal) > 0.01*MAX(Etotal,Mtotal)) {
  2942. log_warn(LD_DIR,
  2943. "Bw Weight Failure for %s: Etotal %f != Mtotal %f. "
  2944. "G="I64_FORMAT" M="I64_FORMAT" E="I64_FORMAT" D="I64_FORMAT
  2945. " T="I64_FORMAT". "
  2946. "Wgg=%f Wgd=%f Wmg=%f Wme=%f Wmd=%f Wee=%f Wed=%f",
  2947. casename, Etotal, Mtotal,
  2948. I64_PRINTF_ARG(G), I64_PRINTF_ARG(M), I64_PRINTF_ARG(E),
  2949. I64_PRINTF_ARG(D), I64_PRINTF_ARG(T),
  2950. Wgg, Wgd, Wmg, Wme, Wmd, Wee, Wed);
  2951. valid = 0;
  2952. }
  2953. if (fabs(Etotal-Gtotal) > 0.01*MAX(Etotal,Gtotal)) {
  2954. log_warn(LD_DIR,
  2955. "Bw Weight Failure for %s: Etotal %f != Gtotal %f. "
  2956. "G="I64_FORMAT" M="I64_FORMAT" E="I64_FORMAT" D="I64_FORMAT
  2957. " T="I64_FORMAT". "
  2958. "Wgg=%f Wgd=%f Wmg=%f Wme=%f Wmd=%f Wee=%f Wed=%f",
  2959. casename, Etotal, Gtotal,
  2960. I64_PRINTF_ARG(G), I64_PRINTF_ARG(M), I64_PRINTF_ARG(E),
  2961. I64_PRINTF_ARG(D), I64_PRINTF_ARG(T),
  2962. Wgg, Wgd, Wmg, Wme, Wmd, Wee, Wed);
  2963. valid = 0;
  2964. }
  2965. if (fabs(Gtotal-Mtotal) > 0.01*MAX(Gtotal,Mtotal)) {
  2966. log_warn(LD_DIR,
  2967. "Bw Weight Failure for %s: Mtotal %f != Gtotal %f. "
  2968. "G="I64_FORMAT" M="I64_FORMAT" E="I64_FORMAT" D="I64_FORMAT
  2969. " T="I64_FORMAT". "
  2970. "Wgg=%f Wgd=%f Wmg=%f Wme=%f Wmd=%f Wee=%f Wed=%f",
  2971. casename, Mtotal, Gtotal,
  2972. I64_PRINTF_ARG(G), I64_PRINTF_ARG(M), I64_PRINTF_ARG(E),
  2973. I64_PRINTF_ARG(D), I64_PRINTF_ARG(T),
  2974. Wgg, Wgd, Wmg, Wme, Wmd, Wee, Wed);
  2975. valid = 0;
  2976. }
  2977. } else {
  2978. if (fabs(Etotal-Gtotal) > 0.01*MAX(Etotal,Gtotal)) {
  2979. log_warn(LD_DIR,
  2980. "Bw Weight Failure for %s: Etotal %f != Gtotal %f. "
  2981. "G="I64_FORMAT" M="I64_FORMAT" E="I64_FORMAT" D="I64_FORMAT
  2982. " T="I64_FORMAT". "
  2983. "Wgg=%f Wgd=%f Wmg=%f Wme=%f Wmd=%f Wee=%f Wed=%f",
  2984. casename, Etotal, Gtotal,
  2985. I64_PRINTF_ARG(G), I64_PRINTF_ARG(M), I64_PRINTF_ARG(E),
  2986. I64_PRINTF_ARG(D), I64_PRINTF_ARG(T),
  2987. Wgg, Wgd, Wmg, Wme, Wmd, Wee, Wed);
  2988. valid = 0;
  2989. }
  2990. }
  2991. }
  2992. } else { // if (E < T/3 || G < T/3) {
  2993. int64_t S = MIN(E, G);
  2994. int64_t NS = MAX(E, G);
  2995. if (3*(S+D) < T) { // Subcase a:
  2996. double Stotal;
  2997. double NStotal;
  2998. if (G < E) {
  2999. casename = "Case 3a (G scarce)";
  3000. Stotal = Gtotal;
  3001. NStotal = Etotal;
  3002. } else { // if (G >= E) {
  3003. casename = "Case 3a (E scarce)";
  3004. NStotal = Gtotal;
  3005. Stotal = Etotal;
  3006. }
  3007. // Stotal < T/3
  3008. if (3*Stotal > T) {
  3009. log_warn(LD_DIR,
  3010. "Bw Weight Failure for %s: 3*Stotal %f > T "
  3011. I64_FORMAT". G="I64_FORMAT" M="I64_FORMAT" E="I64_FORMAT
  3012. " D="I64_FORMAT" T="I64_FORMAT". "
  3013. "Wgg=%f Wgd=%f Wmg=%f Wme=%f Wmd=%f Wee=%f Wed=%f",
  3014. casename, Stotal*3, I64_PRINTF_ARG(T),
  3015. I64_PRINTF_ARG(G), I64_PRINTF_ARG(M), I64_PRINTF_ARG(E),
  3016. I64_PRINTF_ARG(D), I64_PRINTF_ARG(T),
  3017. Wgg, Wgd, Wmg, Wme, Wmd, Wee, Wed);
  3018. valid = 0;
  3019. }
  3020. if (NS >= M) {
  3021. if (fabs(NStotal-Mtotal) > 0.01*MAX(NStotal,Mtotal)) {
  3022. log_warn(LD_DIR,
  3023. "Bw Weight Failure for %s: NStotal %f != Mtotal %f. "
  3024. "G="I64_FORMAT" M="I64_FORMAT" E="I64_FORMAT" D="I64_FORMAT
  3025. " T="I64_FORMAT". "
  3026. "Wgg=%f Wgd=%f Wmg=%f Wme=%f Wmd=%f Wee=%f Wed=%f",
  3027. casename, NStotal, Mtotal,
  3028. I64_PRINTF_ARG(G), I64_PRINTF_ARG(M), I64_PRINTF_ARG(E),
  3029. I64_PRINTF_ARG(D), I64_PRINTF_ARG(T),
  3030. Wgg, Wgd, Wmg, Wme, Wmd, Wee, Wed);
  3031. valid = 0;
  3032. }
  3033. } else {
  3034. // if NS < M, NStotal > T/3 because only one of G or E is scarce
  3035. if (3*NStotal < T) {
  3036. log_warn(LD_DIR,
  3037. "Bw Weight Failure for %s: 3*NStotal %f < T "
  3038. I64_FORMAT". G="I64_FORMAT" M="I64_FORMAT
  3039. " E="I64_FORMAT" D="I64_FORMAT" T="I64_FORMAT". "
  3040. "Wgg=%f Wgd=%f Wmg=%f Wme=%f Wmd=%f Wee=%f Wed=%f",
  3041. casename, NStotal*3, I64_PRINTF_ARG(T),
  3042. I64_PRINTF_ARG(G), I64_PRINTF_ARG(M), I64_PRINTF_ARG(E),
  3043. I64_PRINTF_ARG(D), I64_PRINTF_ARG(T),
  3044. Wgg, Wgd, Wmg, Wme, Wmd, Wee, Wed);
  3045. valid = 0;
  3046. }
  3047. }
  3048. } else { // Subcase b: S+D >= T/3
  3049. casename = "Case 3b";
  3050. if (fabs(Etotal-Mtotal) > 0.01*MAX(Etotal,Mtotal)) {
  3051. log_warn(LD_DIR,
  3052. "Bw Weight Failure for %s: Etotal %f != Mtotal %f. "
  3053. "G="I64_FORMAT" M="I64_FORMAT" E="I64_FORMAT" D="I64_FORMAT
  3054. " T="I64_FORMAT". "
  3055. "Wgg=%f Wgd=%f Wmg=%f Wme=%f Wmd=%f Wee=%f Wed=%f",
  3056. casename, Etotal, Mtotal,
  3057. I64_PRINTF_ARG(G), I64_PRINTF_ARG(M), I64_PRINTF_ARG(E),
  3058. I64_PRINTF_ARG(D), I64_PRINTF_ARG(T),
  3059. Wgg, Wgd, Wmg, Wme, Wmd, Wee, Wed);
  3060. valid = 0;
  3061. }
  3062. if (fabs(Etotal-Gtotal) > 0.01*MAX(Etotal,Gtotal)) {
  3063. log_warn(LD_DIR,
  3064. "Bw Weight Failure for %s: Etotal %f != Gtotal %f. "
  3065. "G="I64_FORMAT" M="I64_FORMAT" E="I64_FORMAT" D="I64_FORMAT
  3066. " T="I64_FORMAT". "
  3067. "Wgg=%f Wgd=%f Wmg=%f Wme=%f Wmd=%f Wee=%f Wed=%f",
  3068. casename, Etotal, Gtotal,
  3069. I64_PRINTF_ARG(G), I64_PRINTF_ARG(M), I64_PRINTF_ARG(E),
  3070. I64_PRINTF_ARG(D), I64_PRINTF_ARG(T),
  3071. Wgg, Wgd, Wmg, Wme, Wmd, Wee, Wed);
  3072. valid = 0;
  3073. }
  3074. if (fabs(Gtotal-Mtotal) > 0.01*MAX(Gtotal,Mtotal)) {
  3075. log_warn(LD_DIR,
  3076. "Bw Weight Failure for %s: Mtotal %f != Gtotal %f. "
  3077. "G="I64_FORMAT" M="I64_FORMAT" E="I64_FORMAT" D="I64_FORMAT
  3078. " T="I64_FORMAT". "
  3079. "Wgg=%f Wgd=%f Wmg=%f Wme=%f Wmd=%f Wee=%f Wed=%f",
  3080. casename, Mtotal, Gtotal,
  3081. I64_PRINTF_ARG(G), I64_PRINTF_ARG(M), I64_PRINTF_ARG(E),
  3082. I64_PRINTF_ARG(D), I64_PRINTF_ARG(T),
  3083. Wgg, Wgd, Wmg, Wme, Wmd, Wee, Wed);
  3084. valid = 0;
  3085. }
  3086. }
  3087. }
  3088. if (valid)
  3089. log_notice(LD_DIR, "Bandwidth-weight %s is verified and valid.",
  3090. casename);
  3091. return valid;
  3092. }
  3093. /** Parse and extract all SR commits from <b>tokens</b> and place them in
  3094. * <b>ns</b>. */
  3095. static void
  3096. extract_shared_random_commits(networkstatus_t *ns, smartlist_t *tokens)
  3097. {
  3098. smartlist_t *chunks = NULL;
  3099. tor_assert(ns);
  3100. tor_assert(tokens);
  3101. /* Commits are only present in a vote. */
  3102. tor_assert(ns->type == NS_TYPE_VOTE);
  3103. ns->sr_info.commits = smartlist_new();
  3104. smartlist_t *commits = find_all_by_keyword(tokens, K_COMMIT);
  3105. /* It's normal that a vote might contain no commits even if it participates
  3106. * in the SR protocol. Don't treat it as an error. */
  3107. if (commits == NULL) {
  3108. goto end;
  3109. }
  3110. /* Parse the commit. We do NO validation of number of arguments or ordering
  3111. * for forward compatibility, it's the parse commit job to inform us if it's
  3112. * supported or not. */
  3113. chunks = smartlist_new();
  3114. SMARTLIST_FOREACH_BEGIN(commits, directory_token_t *, tok) {
  3115. /* Extract all arguments and put them in the chunks list. */
  3116. for (int i = 0; i < tok->n_args; i++) {
  3117. smartlist_add(chunks, tok->args[i]);
  3118. }
  3119. sr_commit_t *commit = sr_parse_commit(chunks);
  3120. smartlist_clear(chunks);
  3121. if (commit == NULL) {
  3122. /* Get voter identity so we can warn that this dirauth vote contains
  3123. * commit we can't parse. */
  3124. networkstatus_voter_info_t *voter = smartlist_get(ns->voters, 0);
  3125. tor_assert(voter);
  3126. log_warn(LD_DIR, "SR: Unable to parse commit %s from vote of voter %s.",
  3127. escaped(tok->object_body),
  3128. hex_str(voter->identity_digest,
  3129. sizeof(voter->identity_digest)));
  3130. /* Commitment couldn't be parsed. Continue onto the next commit because
  3131. * this one could be unsupported for instance. */
  3132. continue;
  3133. }
  3134. /* Add newly created commit object to the vote. */
  3135. smartlist_add(ns->sr_info.commits, commit);
  3136. } SMARTLIST_FOREACH_END(tok);
  3137. end:
  3138. smartlist_free(chunks);
  3139. smartlist_free(commits);
  3140. }
  3141. /** Check if a shared random value of type <b>srv_type</b> is in
  3142. * <b>tokens</b>. If there is, parse it and set it to <b>srv_out</b>. Return
  3143. * -1 on failure, 0 on success. The resulting srv is allocated on the heap and
  3144. * it's the responsibility of the caller to free it. */
  3145. static int
  3146. extract_one_srv(smartlist_t *tokens, directory_keyword srv_type,
  3147. sr_srv_t **srv_out)
  3148. {
  3149. int ret = -1;
  3150. directory_token_t *tok;
  3151. sr_srv_t *srv = NULL;
  3152. smartlist_t *chunks;
  3153. tor_assert(tokens);
  3154. chunks = smartlist_new();
  3155. tok = find_opt_by_keyword(tokens, srv_type);
  3156. if (!tok) {
  3157. /* That's fine, no SRV is allowed. */
  3158. ret = 0;
  3159. goto end;
  3160. }
  3161. for (int i = 0; i < tok->n_args; i++) {
  3162. smartlist_add(chunks, tok->args[i]);
  3163. }
  3164. srv = sr_parse_srv(chunks);
  3165. if (srv == NULL) {
  3166. log_warn(LD_DIR, "SR: Unparseable SRV %s", escaped(tok->object_body));
  3167. goto end;
  3168. }
  3169. /* All is good. */
  3170. *srv_out = srv;
  3171. ret = 0;
  3172. end:
  3173. smartlist_free(chunks);
  3174. return ret;
  3175. }
  3176. /** Extract any shared random values found in <b>tokens</b> and place them in
  3177. * the networkstatus <b>ns</b>. */
  3178. static void
  3179. extract_shared_random_srvs(networkstatus_t *ns, smartlist_t *tokens)
  3180. {
  3181. const char *voter_identity;
  3182. networkstatus_voter_info_t *voter;
  3183. tor_assert(ns);
  3184. tor_assert(tokens);
  3185. /* Can be only one of them else code flow. */
  3186. tor_assert(ns->type == NS_TYPE_VOTE || ns->type == NS_TYPE_CONSENSUS);
  3187. if (ns->type == NS_TYPE_VOTE) {
  3188. voter = smartlist_get(ns->voters, 0);
  3189. tor_assert(voter);
  3190. voter_identity = hex_str(voter->identity_digest,
  3191. sizeof(voter->identity_digest));
  3192. } else {
  3193. /* Consensus has multiple voters so no specific voter. */
  3194. voter_identity = "consensus";
  3195. }
  3196. /* We extract both and on error, everything is stopped because it means
  3197. * the votes is malformed for the shared random value(s). */
  3198. if (extract_one_srv(tokens, K_PREVIOUS_SRV, &ns->sr_info.previous_srv) < 0) {
  3199. log_warn(LD_DIR, "SR: Unable to parse previous SRV from %s",
  3200. voter_identity);
  3201. /* Maybe we have a chance with the current SRV so let's try it anyway. */
  3202. }
  3203. if (extract_one_srv(tokens, K_CURRENT_SRV, &ns->sr_info.current_srv) < 0) {
  3204. log_warn(LD_DIR, "SR: Unable to parse current SRV from %s",
  3205. voter_identity);
  3206. }
  3207. }
  3208. /** Parse a v3 networkstatus vote, opinion, or consensus (depending on
  3209. * ns_type), from <b>s</b>, and return the result. Return NULL on failure. */
  3210. networkstatus_t *
  3211. networkstatus_parse_vote_from_string(const char *s, const char **eos_out,
  3212. networkstatus_type_t ns_type)
  3213. {
  3214. smartlist_t *tokens = smartlist_new();
  3215. smartlist_t *rs_tokens = NULL, *footer_tokens = NULL;
  3216. networkstatus_voter_info_t *voter = NULL;
  3217. networkstatus_t *ns = NULL;
  3218. common_digests_t ns_digests;
  3219. const char *cert, *end_of_header, *end_of_footer, *s_dup = s;
  3220. directory_token_t *tok;
  3221. int ok;
  3222. struct in_addr in;
  3223. int i, inorder, n_signatures = 0;
  3224. memarea_t *area = NULL, *rs_area = NULL;
  3225. consensus_flavor_t flav = FLAV_NS;
  3226. char *last_kwd=NULL;
  3227. tor_assert(s);
  3228. if (eos_out)
  3229. *eos_out = NULL;
  3230. if (router_get_networkstatus_v3_hashes(s, &ns_digests)) {
  3231. log_warn(LD_DIR, "Unable to compute digest of network-status");
  3232. goto err;
  3233. }
  3234. area = memarea_new();
  3235. end_of_header = find_start_of_next_routerstatus(s);
  3236. if (tokenize_string(area, s, end_of_header, tokens,
  3237. (ns_type == NS_TYPE_CONSENSUS) ?
  3238. networkstatus_consensus_token_table :
  3239. networkstatus_token_table, 0)) {
  3240. log_warn(LD_DIR, "Error tokenizing network-status header");
  3241. goto err;
  3242. }
  3243. ns = tor_malloc_zero(sizeof(networkstatus_t));
  3244. memcpy(&ns->digests, &ns_digests, sizeof(ns_digests));
  3245. tok = find_by_keyword(tokens, K_NETWORK_STATUS_VERSION);
  3246. tor_assert(tok);
  3247. if (tok->n_args > 1) {
  3248. int flavor = networkstatus_parse_flavor_name(tok->args[1]);
  3249. if (flavor < 0) {
  3250. log_warn(LD_DIR, "Can't parse document with unknown flavor %s",
  3251. escaped(tok->args[1]));
  3252. goto err;
  3253. }
  3254. ns->flavor = flav = flavor;
  3255. }
  3256. if (flav != FLAV_NS && ns_type != NS_TYPE_CONSENSUS) {
  3257. log_warn(LD_DIR, "Flavor found on non-consensus networkstatus.");
  3258. goto err;
  3259. }
  3260. if (ns_type != NS_TYPE_CONSENSUS) {
  3261. const char *end_of_cert = NULL;
  3262. if (!(cert = strstr(s, "\ndir-key-certificate-version")))
  3263. goto err;
  3264. ++cert;
  3265. ns->cert = authority_cert_parse_from_string(cert, &end_of_cert);
  3266. if (!ns->cert || !end_of_cert || end_of_cert > end_of_header)
  3267. goto err;
  3268. }
  3269. tok = find_by_keyword(tokens, K_VOTE_STATUS);
  3270. tor_assert(tok->n_args);
  3271. if (!strcmp(tok->args[0], "vote")) {
  3272. ns->type = NS_TYPE_VOTE;
  3273. } else if (!strcmp(tok->args[0], "consensus")) {
  3274. ns->type = NS_TYPE_CONSENSUS;
  3275. } else if (!strcmp(tok->args[0], "opinion")) {
  3276. ns->type = NS_TYPE_OPINION;
  3277. } else {
  3278. log_warn(LD_DIR, "Unrecognized vote status %s in network-status",
  3279. escaped(tok->args[0]));
  3280. goto err;
  3281. }
  3282. if (ns_type != ns->type) {
  3283. log_warn(LD_DIR, "Got the wrong kind of v3 networkstatus.");
  3284. goto err;
  3285. }
  3286. if (ns->type == NS_TYPE_VOTE || ns->type == NS_TYPE_OPINION) {
  3287. tok = find_by_keyword(tokens, K_PUBLISHED);
  3288. if (parse_iso_time(tok->args[0], &ns->published))
  3289. goto err;
  3290. ns->supported_methods = smartlist_new();
  3291. tok = find_opt_by_keyword(tokens, K_CONSENSUS_METHODS);
  3292. if (tok) {
  3293. for (i=0; i < tok->n_args; ++i)
  3294. smartlist_add(ns->supported_methods, tor_strdup(tok->args[i]));
  3295. } else {
  3296. smartlist_add(ns->supported_methods, tor_strdup("1"));
  3297. }
  3298. } else {
  3299. tok = find_opt_by_keyword(tokens, K_CONSENSUS_METHOD);
  3300. if (tok) {
  3301. ns->consensus_method = (int)tor_parse_long(tok->args[0], 10, 1, INT_MAX,
  3302. &ok, NULL);
  3303. if (!ok)
  3304. goto err;
  3305. } else {
  3306. ns->consensus_method = 1;
  3307. }
  3308. }
  3309. tok = find_by_keyword(tokens, K_VALID_AFTER);
  3310. if (parse_iso_time(tok->args[0], &ns->valid_after))
  3311. goto err;
  3312. tok = find_by_keyword(tokens, K_FRESH_UNTIL);
  3313. if (parse_iso_time(tok->args[0], &ns->fresh_until))
  3314. goto err;
  3315. tok = find_by_keyword(tokens, K_VALID_UNTIL);
  3316. if (parse_iso_time(tok->args[0], &ns->valid_until))
  3317. goto err;
  3318. tok = find_by_keyword(tokens, K_VOTING_DELAY);
  3319. tor_assert(tok->n_args >= 2);
  3320. ns->vote_seconds =
  3321. (int) tor_parse_long(tok->args[0], 10, 0, INT_MAX, &ok, NULL);
  3322. if (!ok)
  3323. goto err;
  3324. ns->dist_seconds =
  3325. (int) tor_parse_long(tok->args[1], 10, 0, INT_MAX, &ok, NULL);
  3326. if (!ok)
  3327. goto err;
  3328. if (ns->valid_after +
  3329. (get_options()->TestingTorNetwork ?
  3330. MIN_VOTE_INTERVAL_TESTING : MIN_VOTE_INTERVAL) > ns->fresh_until) {
  3331. log_warn(LD_DIR, "Vote/consensus freshness interval is too short");
  3332. goto err;
  3333. }
  3334. if (ns->valid_after +
  3335. (get_options()->TestingTorNetwork ?
  3336. MIN_VOTE_INTERVAL_TESTING : MIN_VOTE_INTERVAL)*2 > ns->valid_until) {
  3337. log_warn(LD_DIR, "Vote/consensus liveness interval is too short");
  3338. goto err;
  3339. }
  3340. if (ns->vote_seconds < MIN_VOTE_SECONDS) {
  3341. log_warn(LD_DIR, "Vote seconds is too short");
  3342. goto err;
  3343. }
  3344. if (ns->dist_seconds < MIN_DIST_SECONDS) {
  3345. log_warn(LD_DIR, "Dist seconds is too short");
  3346. goto err;
  3347. }
  3348. if ((tok = find_opt_by_keyword(tokens, K_CLIENT_VERSIONS))) {
  3349. ns->client_versions = tor_strdup(tok->args[0]);
  3350. }
  3351. if ((tok = find_opt_by_keyword(tokens, K_SERVER_VERSIONS))) {
  3352. ns->server_versions = tor_strdup(tok->args[0]);
  3353. }
  3354. {
  3355. smartlist_t *package_lst = find_all_by_keyword(tokens, K_PACKAGE);
  3356. ns->package_lines = smartlist_new();
  3357. if (package_lst) {
  3358. SMARTLIST_FOREACH(package_lst, directory_token_t *, t,
  3359. smartlist_add(ns->package_lines, tor_strdup(t->args[0])));
  3360. }
  3361. smartlist_free(package_lst);
  3362. }
  3363. tok = find_by_keyword(tokens, K_KNOWN_FLAGS);
  3364. ns->known_flags = smartlist_new();
  3365. inorder = 1;
  3366. for (i = 0; i < tok->n_args; ++i) {
  3367. smartlist_add(ns->known_flags, tor_strdup(tok->args[i]));
  3368. if (i>0 && strcmp(tok->args[i-1], tok->args[i])>= 0) {
  3369. log_warn(LD_DIR, "%s >= %s", tok->args[i-1], tok->args[i]);
  3370. inorder = 0;
  3371. }
  3372. }
  3373. if (!inorder) {
  3374. log_warn(LD_DIR, "known-flags not in order");
  3375. goto err;
  3376. }
  3377. if (ns->type != NS_TYPE_CONSENSUS &&
  3378. smartlist_len(ns->known_flags) > MAX_KNOWN_FLAGS_IN_VOTE) {
  3379. /* If we allowed more than 64 flags in votes, then parsing them would make
  3380. * us invoke undefined behavior whenever we used 1<<flagnum to do a
  3381. * bit-shift. This is only for votes and opinions: consensus users don't
  3382. * care about flags they don't recognize, and so don't build a bitfield
  3383. * for them. */
  3384. log_warn(LD_DIR, "Too many known-flags in consensus vote or opinion");
  3385. goto err;
  3386. }
  3387. tok = find_opt_by_keyword(tokens, K_PARAMS);
  3388. if (tok) {
  3389. int any_dups = 0;
  3390. inorder = 1;
  3391. ns->net_params = smartlist_new();
  3392. for (i = 0; i < tok->n_args; ++i) {
  3393. int ok=0;
  3394. char *eq = strchr(tok->args[i], '=');
  3395. size_t eq_pos;
  3396. if (!eq) {
  3397. log_warn(LD_DIR, "Bad element '%s' in params", escaped(tok->args[i]));
  3398. goto err;
  3399. }
  3400. eq_pos = eq-tok->args[i];
  3401. tor_parse_long(eq+1, 10, INT32_MIN, INT32_MAX, &ok, NULL);
  3402. if (!ok) {
  3403. log_warn(LD_DIR, "Bad element '%s' in params", escaped(tok->args[i]));
  3404. goto err;
  3405. }
  3406. if (i > 0 && strcmp(tok->args[i-1], tok->args[i]) >= 0) {
  3407. log_warn(LD_DIR, "%s >= %s", tok->args[i-1], tok->args[i]);
  3408. inorder = 0;
  3409. }
  3410. if (last_kwd && eq_pos == strlen(last_kwd) &&
  3411. fast_memeq(last_kwd, tok->args[i], eq_pos)) {
  3412. log_warn(LD_DIR, "Duplicate value for %s parameter",
  3413. escaped(tok->args[i]));
  3414. any_dups = 1;
  3415. }
  3416. tor_free(last_kwd);
  3417. last_kwd = tor_strndup(tok->args[i], eq_pos);
  3418. smartlist_add(ns->net_params, tor_strdup(tok->args[i]));
  3419. }
  3420. if (!inorder) {
  3421. log_warn(LD_DIR, "params not in order");
  3422. goto err;
  3423. }
  3424. if (any_dups) {
  3425. log_warn(LD_DIR, "Duplicate in parameters");
  3426. goto err;
  3427. }
  3428. }
  3429. ns->voters = smartlist_new();
  3430. SMARTLIST_FOREACH_BEGIN(tokens, directory_token_t *, _tok) {
  3431. tok = _tok;
  3432. if (tok->tp == K_DIR_SOURCE) {
  3433. tor_assert(tok->n_args >= 6);
  3434. if (voter)
  3435. smartlist_add(ns->voters, voter);
  3436. voter = tor_malloc_zero(sizeof(networkstatus_voter_info_t));
  3437. voter->sigs = smartlist_new();
  3438. if (ns->type != NS_TYPE_CONSENSUS)
  3439. memcpy(voter->vote_digest, ns_digests.d[DIGEST_SHA1], DIGEST_LEN);
  3440. voter->nickname = tor_strdup(tok->args[0]);
  3441. if (strlen(tok->args[1]) != HEX_DIGEST_LEN ||
  3442. base16_decode(voter->identity_digest, sizeof(voter->identity_digest),
  3443. tok->args[1], HEX_DIGEST_LEN)
  3444. != sizeof(voter->identity_digest)) {
  3445. log_warn(LD_DIR, "Error decoding identity digest %s in "
  3446. "network-status document.", escaped(tok->args[1]));
  3447. goto err;
  3448. }
  3449. if (ns->type != NS_TYPE_CONSENSUS &&
  3450. tor_memneq(ns->cert->cache_info.identity_digest,
  3451. voter->identity_digest, DIGEST_LEN)) {
  3452. log_warn(LD_DIR,"Mismatch between identities in certificate and vote");
  3453. goto err;
  3454. }
  3455. if (ns->type != NS_TYPE_CONSENSUS) {
  3456. if (authority_cert_is_blacklisted(ns->cert)) {
  3457. log_warn(LD_DIR, "Rejecting vote signature made with blacklisted "
  3458. "signing key %s",
  3459. hex_str(ns->cert->signing_key_digest, DIGEST_LEN));
  3460. goto err;
  3461. }
  3462. }
  3463. voter->address = tor_strdup(tok->args[2]);
  3464. if (!tor_inet_aton(tok->args[3], &in)) {
  3465. log_warn(LD_DIR, "Error decoding IP address %s in network-status.",
  3466. escaped(tok->args[3]));
  3467. goto err;
  3468. }
  3469. voter->addr = ntohl(in.s_addr);
  3470. voter->dir_port = (uint16_t)
  3471. tor_parse_long(tok->args[4], 10, 0, 65535, &ok, NULL);
  3472. if (!ok)
  3473. goto err;
  3474. voter->or_port = (uint16_t)
  3475. tor_parse_long(tok->args[5], 10, 0, 65535, &ok, NULL);
  3476. if (!ok)
  3477. goto err;
  3478. } else if (tok->tp == K_CONTACT) {
  3479. if (!voter || voter->contact) {
  3480. log_warn(LD_DIR, "contact element is out of place.");
  3481. goto err;
  3482. }
  3483. voter->contact = tor_strdup(tok->args[0]);
  3484. } else if (tok->tp == K_VOTE_DIGEST) {
  3485. tor_assert(ns->type == NS_TYPE_CONSENSUS);
  3486. tor_assert(tok->n_args >= 1);
  3487. if (!voter || ! tor_digest_is_zero(voter->vote_digest)) {
  3488. log_warn(LD_DIR, "vote-digest element is out of place.");
  3489. goto err;
  3490. }
  3491. if (strlen(tok->args[0]) != HEX_DIGEST_LEN ||
  3492. base16_decode(voter->vote_digest, sizeof(voter->vote_digest),
  3493. tok->args[0], HEX_DIGEST_LEN)
  3494. != sizeof(voter->vote_digest)) {
  3495. log_warn(LD_DIR, "Error decoding vote digest %s in "
  3496. "network-status consensus.", escaped(tok->args[0]));
  3497. goto err;
  3498. }
  3499. }
  3500. } SMARTLIST_FOREACH_END(_tok);
  3501. if (voter) {
  3502. smartlist_add(ns->voters, voter);
  3503. voter = NULL;
  3504. }
  3505. if (smartlist_len(ns->voters) == 0) {
  3506. log_warn(LD_DIR, "Missing dir-source elements in a networkstatus.");
  3507. goto err;
  3508. } else if (ns->type != NS_TYPE_CONSENSUS && smartlist_len(ns->voters) != 1) {
  3509. log_warn(LD_DIR, "Too many dir-source elements in a vote networkstatus.");
  3510. goto err;
  3511. }
  3512. if (ns->type != NS_TYPE_CONSENSUS &&
  3513. (tok = find_opt_by_keyword(tokens, K_LEGACY_DIR_KEY))) {
  3514. int bad = 1;
  3515. if (strlen(tok->args[0]) == HEX_DIGEST_LEN) {
  3516. networkstatus_voter_info_t *voter = smartlist_get(ns->voters, 0);
  3517. if (base16_decode(voter->legacy_id_digest, DIGEST_LEN,
  3518. tok->args[0], HEX_DIGEST_LEN) != DIGEST_LEN)
  3519. bad = 1;
  3520. else
  3521. bad = 0;
  3522. }
  3523. if (bad) {
  3524. log_warn(LD_DIR, "Invalid legacy key digest %s on vote.",
  3525. escaped(tok->args[0]));
  3526. }
  3527. }
  3528. /* If this is a vote document, check if information about the shared
  3529. randomness protocol is included, and extract it. */
  3530. if (ns->type == NS_TYPE_VOTE) {
  3531. /* Does this authority participates in the SR protocol? */
  3532. tok = find_opt_by_keyword(tokens, K_SR_FLAG);
  3533. if (tok) {
  3534. ns->sr_info.participate = 1;
  3535. /* Get the SR commitments and reveals from the vote. */
  3536. extract_shared_random_commits(ns, tokens);
  3537. }
  3538. }
  3539. /* For both a vote and consensus, extract the shared random values. */
  3540. if (ns->type == NS_TYPE_VOTE || ns->type == NS_TYPE_CONSENSUS) {
  3541. extract_shared_random_srvs(ns, tokens);
  3542. }
  3543. /* Parse routerstatus lines. */
  3544. rs_tokens = smartlist_new();
  3545. rs_area = memarea_new();
  3546. s = end_of_header;
  3547. ns->routerstatus_list = smartlist_new();
  3548. while (!strcmpstart(s, "r ")) {
  3549. if (ns->type != NS_TYPE_CONSENSUS) {
  3550. vote_routerstatus_t *rs = tor_malloc_zero(sizeof(vote_routerstatus_t));
  3551. if (routerstatus_parse_entry_from_string(rs_area, &s, rs_tokens, ns,
  3552. rs, 0, 0))
  3553. smartlist_add(ns->routerstatus_list, rs);
  3554. else {
  3555. tor_free(rs->version);
  3556. tor_free(rs);
  3557. }
  3558. } else {
  3559. routerstatus_t *rs;
  3560. if ((rs = routerstatus_parse_entry_from_string(rs_area, &s, rs_tokens,
  3561. NULL, NULL,
  3562. ns->consensus_method,
  3563. flav))) {
  3564. /* Use exponential-backoff scheduling when downloading microdescs */
  3565. rs->dl_status.backoff = DL_SCHED_RANDOM_EXPONENTIAL;
  3566. smartlist_add(ns->routerstatus_list, rs);
  3567. }
  3568. }
  3569. }
  3570. for (i = 1; i < smartlist_len(ns->routerstatus_list); ++i) {
  3571. routerstatus_t *rs1, *rs2;
  3572. if (ns->type != NS_TYPE_CONSENSUS) {
  3573. vote_routerstatus_t *a = smartlist_get(ns->routerstatus_list, i-1);
  3574. vote_routerstatus_t *b = smartlist_get(ns->routerstatus_list, i);
  3575. rs1 = &a->status; rs2 = &b->status;
  3576. } else {
  3577. rs1 = smartlist_get(ns->routerstatus_list, i-1);
  3578. rs2 = smartlist_get(ns->routerstatus_list, i);
  3579. }
  3580. if (fast_memcmp(rs1->identity_digest, rs2->identity_digest, DIGEST_LEN)
  3581. >= 0) {
  3582. log_warn(LD_DIR, "Networkstatus entries not sorted by identity digest");
  3583. goto err;
  3584. }
  3585. }
  3586. if (ns_type != NS_TYPE_CONSENSUS) {
  3587. digest256map_t *ed_id_map = digest256map_new();
  3588. SMARTLIST_FOREACH_BEGIN(ns->routerstatus_list, vote_routerstatus_t *,
  3589. vrs) {
  3590. if (! vrs->has_ed25519_listing ||
  3591. tor_mem_is_zero((const char *)vrs->ed25519_id, DIGEST256_LEN))
  3592. continue;
  3593. if (digest256map_get(ed_id_map, vrs->ed25519_id) != NULL) {
  3594. log_warn(LD_DIR, "Vote networkstatus ed25519 identities were not "
  3595. "unique");
  3596. digest256map_free(ed_id_map, NULL);
  3597. goto err;
  3598. }
  3599. digest256map_set(ed_id_map, vrs->ed25519_id, (void*)1);
  3600. } SMARTLIST_FOREACH_END(vrs);
  3601. digest256map_free(ed_id_map, NULL);
  3602. }
  3603. /* Parse footer; check signature. */
  3604. footer_tokens = smartlist_new();
  3605. if ((end_of_footer = strstr(s, "\nnetwork-status-version ")))
  3606. ++end_of_footer;
  3607. else
  3608. end_of_footer = s + strlen(s);
  3609. if (tokenize_string(area,s, end_of_footer, footer_tokens,
  3610. networkstatus_vote_footer_token_table, 0)) {
  3611. log_warn(LD_DIR, "Error tokenizing network-status vote footer.");
  3612. goto err;
  3613. }
  3614. {
  3615. int found_sig = 0;
  3616. SMARTLIST_FOREACH_BEGIN(footer_tokens, directory_token_t *, _tok) {
  3617. tok = _tok;
  3618. if (tok->tp == K_DIRECTORY_SIGNATURE)
  3619. found_sig = 1;
  3620. else if (found_sig) {
  3621. log_warn(LD_DIR, "Extraneous token after first directory-signature");
  3622. goto err;
  3623. }
  3624. } SMARTLIST_FOREACH_END(_tok);
  3625. }
  3626. if ((tok = find_opt_by_keyword(footer_tokens, K_DIRECTORY_FOOTER))) {
  3627. if (tok != smartlist_get(footer_tokens, 0)) {
  3628. log_warn(LD_DIR, "Misplaced directory-footer token");
  3629. goto err;
  3630. }
  3631. }
  3632. tok = find_opt_by_keyword(footer_tokens, K_BW_WEIGHTS);
  3633. if (tok) {
  3634. ns->weight_params = smartlist_new();
  3635. for (i = 0; i < tok->n_args; ++i) {
  3636. int ok=0;
  3637. char *eq = strchr(tok->args[i], '=');
  3638. if (!eq) {
  3639. log_warn(LD_DIR, "Bad element '%s' in weight params",
  3640. escaped(tok->args[i]));
  3641. goto err;
  3642. }
  3643. tor_parse_long(eq+1, 10, INT32_MIN, INT32_MAX, &ok, NULL);
  3644. if (!ok) {
  3645. log_warn(LD_DIR, "Bad element '%s' in params", escaped(tok->args[i]));
  3646. goto err;
  3647. }
  3648. smartlist_add(ns->weight_params, tor_strdup(tok->args[i]));
  3649. }
  3650. }
  3651. SMARTLIST_FOREACH_BEGIN(footer_tokens, directory_token_t *, _tok) {
  3652. char declared_identity[DIGEST_LEN];
  3653. networkstatus_voter_info_t *v;
  3654. document_signature_t *sig;
  3655. const char *id_hexdigest = NULL;
  3656. const char *sk_hexdigest = NULL;
  3657. digest_algorithm_t alg = DIGEST_SHA1;
  3658. tok = _tok;
  3659. if (tok->tp != K_DIRECTORY_SIGNATURE)
  3660. continue;
  3661. tor_assert(tok->n_args >= 2);
  3662. if (tok->n_args == 2) {
  3663. id_hexdigest = tok->args[0];
  3664. sk_hexdigest = tok->args[1];
  3665. } else {
  3666. const char *algname = tok->args[0];
  3667. int a;
  3668. id_hexdigest = tok->args[1];
  3669. sk_hexdigest = tok->args[2];
  3670. a = crypto_digest_algorithm_parse_name(algname);
  3671. if (a<0) {
  3672. log_warn(LD_DIR, "Unknown digest algorithm %s; skipping",
  3673. escaped(algname));
  3674. continue;
  3675. }
  3676. alg = a;
  3677. }
  3678. if (!tok->object_type ||
  3679. strcmp(tok->object_type, "SIGNATURE") ||
  3680. tok->object_size < 128 || tok->object_size > 512) {
  3681. log_warn(LD_DIR, "Bad object type or length on directory-signature");
  3682. goto err;
  3683. }
  3684. if (strlen(id_hexdigest) != HEX_DIGEST_LEN ||
  3685. base16_decode(declared_identity, sizeof(declared_identity),
  3686. id_hexdigest, HEX_DIGEST_LEN)
  3687. != sizeof(declared_identity)) {
  3688. log_warn(LD_DIR, "Error decoding declared identity %s in "
  3689. "network-status document.", escaped(id_hexdigest));
  3690. goto err;
  3691. }
  3692. if (!(v = networkstatus_get_voter_by_id(ns, declared_identity))) {
  3693. log_warn(LD_DIR, "ID on signature on network-status document does "
  3694. "not match any declared directory source.");
  3695. goto err;
  3696. }
  3697. sig = tor_malloc_zero(sizeof(document_signature_t));
  3698. memcpy(sig->identity_digest, v->identity_digest, DIGEST_LEN);
  3699. sig->alg = alg;
  3700. if (strlen(sk_hexdigest) != HEX_DIGEST_LEN ||
  3701. base16_decode(sig->signing_key_digest, sizeof(sig->signing_key_digest),
  3702. sk_hexdigest, HEX_DIGEST_LEN)
  3703. != sizeof(sig->signing_key_digest)) {
  3704. log_warn(LD_DIR, "Error decoding declared signing key digest %s in "
  3705. "network-status document.", escaped(sk_hexdigest));
  3706. tor_free(sig);
  3707. goto err;
  3708. }
  3709. if (ns->type != NS_TYPE_CONSENSUS) {
  3710. if (tor_memneq(declared_identity, ns->cert->cache_info.identity_digest,
  3711. DIGEST_LEN)) {
  3712. log_warn(LD_DIR, "Digest mismatch between declared and actual on "
  3713. "network-status vote.");
  3714. tor_free(sig);
  3715. goto err;
  3716. }
  3717. }
  3718. if (voter_get_sig_by_algorithm(v, sig->alg)) {
  3719. /* We already parsed a vote with this algorithm from this voter. Use the
  3720. first one. */
  3721. log_fn(LOG_PROTOCOL_WARN, LD_DIR, "We received a networkstatus "
  3722. "that contains two signatures from the same voter with the same "
  3723. "algorithm. Ignoring the second signature.");
  3724. tor_free(sig);
  3725. continue;
  3726. }
  3727. if (ns->type != NS_TYPE_CONSENSUS) {
  3728. if (check_signature_token(ns_digests.d[DIGEST_SHA1], DIGEST_LEN,
  3729. tok, ns->cert->signing_key, 0,
  3730. "network-status document")) {
  3731. tor_free(sig);
  3732. goto err;
  3733. }
  3734. sig->good_signature = 1;
  3735. } else {
  3736. if (tok->object_size >= INT_MAX || tok->object_size >= SIZE_T_CEILING) {
  3737. tor_free(sig);
  3738. goto err;
  3739. }
  3740. sig->signature = tor_memdup(tok->object_body, tok->object_size);
  3741. sig->signature_len = (int) tok->object_size;
  3742. }
  3743. smartlist_add(v->sigs, sig);
  3744. ++n_signatures;
  3745. } SMARTLIST_FOREACH_END(_tok);
  3746. if (! n_signatures) {
  3747. log_warn(LD_DIR, "No signatures on networkstatus document.");
  3748. goto err;
  3749. } else if (ns->type == NS_TYPE_VOTE && n_signatures != 1) {
  3750. log_warn(LD_DIR, "Received more than one signature on a "
  3751. "network-status vote.");
  3752. goto err;
  3753. }
  3754. if (eos_out)
  3755. *eos_out = end_of_footer;
  3756. goto done;
  3757. err:
  3758. dump_desc(s_dup, "v3 networkstatus");
  3759. networkstatus_vote_free(ns);
  3760. ns = NULL;
  3761. done:
  3762. if (tokens) {
  3763. SMARTLIST_FOREACH(tokens, directory_token_t *, t, token_clear(t));
  3764. smartlist_free(tokens);
  3765. }
  3766. if (voter) {
  3767. if (voter->sigs) {
  3768. SMARTLIST_FOREACH(voter->sigs, document_signature_t *, sig,
  3769. document_signature_free(sig));
  3770. smartlist_free(voter->sigs);
  3771. }
  3772. tor_free(voter->nickname);
  3773. tor_free(voter->address);
  3774. tor_free(voter->contact);
  3775. tor_free(voter);
  3776. }
  3777. if (rs_tokens) {
  3778. SMARTLIST_FOREACH(rs_tokens, directory_token_t *, t, token_clear(t));
  3779. smartlist_free(rs_tokens);
  3780. }
  3781. if (footer_tokens) {
  3782. SMARTLIST_FOREACH(footer_tokens, directory_token_t *, t, token_clear(t));
  3783. smartlist_free(footer_tokens);
  3784. }
  3785. if (area) {
  3786. DUMP_AREA(area, "v3 networkstatus");
  3787. memarea_drop_all(area);
  3788. }
  3789. if (rs_area)
  3790. memarea_drop_all(rs_area);
  3791. tor_free(last_kwd);
  3792. return ns;
  3793. }
  3794. /** Return the common_digests_t that holds the digests of the
  3795. * <b>flavor_name</b>-flavored networkstatus according to the detached
  3796. * signatures document <b>sigs</b>, allocating a new common_digests_t as
  3797. * neeeded. */
  3798. static common_digests_t *
  3799. detached_get_digests(ns_detached_signatures_t *sigs, const char *flavor_name)
  3800. {
  3801. common_digests_t *d = strmap_get(sigs->digests, flavor_name);
  3802. if (!d) {
  3803. d = tor_malloc_zero(sizeof(common_digests_t));
  3804. strmap_set(sigs->digests, flavor_name, d);
  3805. }
  3806. return d;
  3807. }
  3808. /** Return the list of signatures of the <b>flavor_name</b>-flavored
  3809. * networkstatus according to the detached signatures document <b>sigs</b>,
  3810. * allocating a new common_digests_t as neeeded. */
  3811. static smartlist_t *
  3812. detached_get_signatures(ns_detached_signatures_t *sigs,
  3813. const char *flavor_name)
  3814. {
  3815. smartlist_t *sl = strmap_get(sigs->signatures, flavor_name);
  3816. if (!sl) {
  3817. sl = smartlist_new();
  3818. strmap_set(sigs->signatures, flavor_name, sl);
  3819. }
  3820. return sl;
  3821. }
  3822. /** Parse a detached v3 networkstatus signature document between <b>s</b> and
  3823. * <b>eos</b> and return the result. Return -1 on failure. */
  3824. ns_detached_signatures_t *
  3825. networkstatus_parse_detached_signatures(const char *s, const char *eos)
  3826. {
  3827. /* XXXX there is too much duplicate shared between this function and
  3828. * networkstatus_parse_vote_from_string(). */
  3829. directory_token_t *tok;
  3830. memarea_t *area = NULL;
  3831. common_digests_t *digests;
  3832. smartlist_t *tokens = smartlist_new();
  3833. ns_detached_signatures_t *sigs =
  3834. tor_malloc_zero(sizeof(ns_detached_signatures_t));
  3835. sigs->digests = strmap_new();
  3836. sigs->signatures = strmap_new();
  3837. if (!eos)
  3838. eos = s + strlen(s);
  3839. area = memarea_new();
  3840. if (tokenize_string(area,s, eos, tokens,
  3841. networkstatus_detached_signature_token_table, 0)) {
  3842. log_warn(LD_DIR, "Error tokenizing detached networkstatus signatures");
  3843. goto err;
  3844. }
  3845. /* Grab all the digest-like tokens. */
  3846. SMARTLIST_FOREACH_BEGIN(tokens, directory_token_t *, _tok) {
  3847. const char *algname;
  3848. digest_algorithm_t alg;
  3849. const char *flavor;
  3850. const char *hexdigest;
  3851. size_t expected_length, digest_length;
  3852. tok = _tok;
  3853. if (tok->tp == K_CONSENSUS_DIGEST) {
  3854. algname = "sha1";
  3855. alg = DIGEST_SHA1;
  3856. flavor = "ns";
  3857. hexdigest = tok->args[0];
  3858. } else if (tok->tp == K_ADDITIONAL_DIGEST) {
  3859. int a = crypto_digest_algorithm_parse_name(tok->args[1]);
  3860. if (a<0) {
  3861. log_warn(LD_DIR, "Unrecognized algorithm name %s", tok->args[0]);
  3862. continue;
  3863. }
  3864. alg = (digest_algorithm_t) a;
  3865. flavor = tok->args[0];
  3866. algname = tok->args[1];
  3867. hexdigest = tok->args[2];
  3868. } else {
  3869. continue;
  3870. }
  3871. digest_length = crypto_digest_algorithm_get_length(alg);
  3872. expected_length = digest_length * 2; /* hex encoding */
  3873. if (strlen(hexdigest) != expected_length) {
  3874. log_warn(LD_DIR, "Wrong length on consensus-digest in detached "
  3875. "networkstatus signatures");
  3876. goto err;
  3877. }
  3878. digests = detached_get_digests(sigs, flavor);
  3879. tor_assert(digests);
  3880. if (!tor_mem_is_zero(digests->d[alg], digest_length)) {
  3881. log_warn(LD_DIR, "Multiple digests for %s with %s on detached "
  3882. "signatures document", flavor, algname);
  3883. continue;
  3884. }
  3885. if (base16_decode(digests->d[alg], digest_length,
  3886. hexdigest, strlen(hexdigest)) != (int) digest_length) {
  3887. log_warn(LD_DIR, "Bad encoding on consensus-digest in detached "
  3888. "networkstatus signatures");
  3889. goto err;
  3890. }
  3891. } SMARTLIST_FOREACH_END(_tok);
  3892. tok = find_by_keyword(tokens, K_VALID_AFTER);
  3893. if (parse_iso_time(tok->args[0], &sigs->valid_after)) {
  3894. log_warn(LD_DIR, "Bad valid-after in detached networkstatus signatures");
  3895. goto err;
  3896. }
  3897. tok = find_by_keyword(tokens, K_FRESH_UNTIL);
  3898. if (parse_iso_time(tok->args[0], &sigs->fresh_until)) {
  3899. log_warn(LD_DIR, "Bad fresh-until in detached networkstatus signatures");
  3900. goto err;
  3901. }
  3902. tok = find_by_keyword(tokens, K_VALID_UNTIL);
  3903. if (parse_iso_time(tok->args[0], &sigs->valid_until)) {
  3904. log_warn(LD_DIR, "Bad valid-until in detached networkstatus signatures");
  3905. goto err;
  3906. }
  3907. SMARTLIST_FOREACH_BEGIN(tokens, directory_token_t *, _tok) {
  3908. const char *id_hexdigest;
  3909. const char *sk_hexdigest;
  3910. const char *algname;
  3911. const char *flavor;
  3912. digest_algorithm_t alg;
  3913. char id_digest[DIGEST_LEN];
  3914. char sk_digest[DIGEST_LEN];
  3915. smartlist_t *siglist;
  3916. document_signature_t *sig;
  3917. int is_duplicate;
  3918. tok = _tok;
  3919. if (tok->tp == K_DIRECTORY_SIGNATURE) {
  3920. tor_assert(tok->n_args >= 2);
  3921. flavor = "ns";
  3922. algname = "sha1";
  3923. id_hexdigest = tok->args[0];
  3924. sk_hexdigest = tok->args[1];
  3925. } else if (tok->tp == K_ADDITIONAL_SIGNATURE) {
  3926. tor_assert(tok->n_args >= 4);
  3927. flavor = tok->args[0];
  3928. algname = tok->args[1];
  3929. id_hexdigest = tok->args[2];
  3930. sk_hexdigest = tok->args[3];
  3931. } else {
  3932. continue;
  3933. }
  3934. {
  3935. int a = crypto_digest_algorithm_parse_name(algname);
  3936. if (a<0) {
  3937. log_warn(LD_DIR, "Unrecognized algorithm name %s", algname);
  3938. continue;
  3939. }
  3940. alg = (digest_algorithm_t) a;
  3941. }
  3942. if (!tok->object_type ||
  3943. strcmp(tok->object_type, "SIGNATURE") ||
  3944. tok->object_size < 128 || tok->object_size > 512) {
  3945. log_warn(LD_DIR, "Bad object type or length on directory-signature");
  3946. goto err;
  3947. }
  3948. if (strlen(id_hexdigest) != HEX_DIGEST_LEN ||
  3949. base16_decode(id_digest, sizeof(id_digest),
  3950. id_hexdigest, HEX_DIGEST_LEN) != sizeof(id_digest)) {
  3951. log_warn(LD_DIR, "Error decoding declared identity %s in "
  3952. "network-status vote.", escaped(id_hexdigest));
  3953. goto err;
  3954. }
  3955. if (strlen(sk_hexdigest) != HEX_DIGEST_LEN ||
  3956. base16_decode(sk_digest, sizeof(sk_digest),
  3957. sk_hexdigest, HEX_DIGEST_LEN) != sizeof(sk_digest)) {
  3958. log_warn(LD_DIR, "Error decoding declared signing key digest %s in "
  3959. "network-status vote.", escaped(sk_hexdigest));
  3960. goto err;
  3961. }
  3962. siglist = detached_get_signatures(sigs, flavor);
  3963. is_duplicate = 0;
  3964. SMARTLIST_FOREACH(siglist, document_signature_t *, dsig, {
  3965. if (dsig->alg == alg &&
  3966. tor_memeq(id_digest, dsig->identity_digest, DIGEST_LEN) &&
  3967. tor_memeq(sk_digest, dsig->signing_key_digest, DIGEST_LEN)) {
  3968. is_duplicate = 1;
  3969. }
  3970. });
  3971. if (is_duplicate) {
  3972. log_warn(LD_DIR, "Two signatures with identical keys and algorithm "
  3973. "found.");
  3974. continue;
  3975. }
  3976. sig = tor_malloc_zero(sizeof(document_signature_t));
  3977. sig->alg = alg;
  3978. memcpy(sig->identity_digest, id_digest, DIGEST_LEN);
  3979. memcpy(sig->signing_key_digest, sk_digest, DIGEST_LEN);
  3980. if (tok->object_size >= INT_MAX || tok->object_size >= SIZE_T_CEILING) {
  3981. tor_free(sig);
  3982. goto err;
  3983. }
  3984. sig->signature = tor_memdup(tok->object_body, tok->object_size);
  3985. sig->signature_len = (int) tok->object_size;
  3986. smartlist_add(siglist, sig);
  3987. } SMARTLIST_FOREACH_END(_tok);
  3988. goto done;
  3989. err:
  3990. ns_detached_signatures_free(sigs);
  3991. sigs = NULL;
  3992. done:
  3993. SMARTLIST_FOREACH(tokens, directory_token_t *, t, token_clear(t));
  3994. smartlist_free(tokens);
  3995. if (area) {
  3996. DUMP_AREA(area, "detached signatures");
  3997. memarea_drop_all(area);
  3998. }
  3999. return sigs;
  4000. }
  4001. /** Parse the addr policy in the string <b>s</b> and return it. If
  4002. * assume_action is nonnegative, then insert its action (ADDR_POLICY_ACCEPT or
  4003. * ADDR_POLICY_REJECT) for items that specify no action.
  4004. *
  4005. * Returns NULL on policy errors.
  4006. *
  4007. * Set *<b>malformed_list</b> to true if the entire policy list should be
  4008. * discarded. Otherwise, set it to false, and only this item should be ignored
  4009. * on error - the rest of the policy list can continue to be processed and
  4010. * used.
  4011. *
  4012. * The addr_policy_t returned by this function can have its address set to
  4013. * AF_UNSPEC for '*'. Use policy_expand_unspec() to turn this into a pair
  4014. * of AF_INET and AF_INET6 items.
  4015. */
  4016. MOCK_IMPL(addr_policy_t *,
  4017. router_parse_addr_policy_item_from_string,(const char *s, int assume_action,
  4018. int *malformed_list))
  4019. {
  4020. directory_token_t *tok = NULL;
  4021. const char *cp, *eos;
  4022. /* Longest possible policy is
  4023. * "accept6 [ffff:ffff:..255]/128:10000-65535",
  4024. * which contains a max-length IPv6 address, plus 26 characters.
  4025. * But note that there can be an arbitrary amount of space between the
  4026. * accept and the address:mask/port element.
  4027. * We don't need to multiply TOR_ADDR_BUF_LEN by 2, as there is only one
  4028. * IPv6 address. But making the buffer shorter might cause valid long lines,
  4029. * which parsed in previous versions, to fail to parse in new versions.
  4030. * (These lines would have to have excessive amounts of whitespace.) */
  4031. char line[TOR_ADDR_BUF_LEN*2 + 32];
  4032. addr_policy_t *r;
  4033. memarea_t *area = NULL;
  4034. tor_assert(malformed_list);
  4035. *malformed_list = 0;
  4036. s = eat_whitespace(s);
  4037. /* We can only do assume_action on []-quoted IPv6, as "a" (accept)
  4038. * and ":" (port separator) are ambiguous */
  4039. if ((*s == '*' || *s == '[' || TOR_ISDIGIT(*s)) && assume_action >= 0) {
  4040. if (tor_snprintf(line, sizeof(line), "%s %s",
  4041. assume_action == ADDR_POLICY_ACCEPT?"accept":"reject", s)<0) {
  4042. log_warn(LD_DIR, "Policy %s is too long.", escaped(s));
  4043. return NULL;
  4044. }
  4045. cp = line;
  4046. tor_strlower(line);
  4047. } else { /* assume an already well-formed address policy line */
  4048. cp = s;
  4049. }
  4050. eos = cp + strlen(cp);
  4051. area = memarea_new();
  4052. tok = get_next_token(area, &cp, eos, routerdesc_token_table);
  4053. if (tok->tp == ERR_) {
  4054. log_warn(LD_DIR, "Error reading address policy: %s", tok->error);
  4055. goto err;
  4056. }
  4057. if (tok->tp != K_ACCEPT && tok->tp != K_ACCEPT6 &&
  4058. tok->tp != K_REJECT && tok->tp != K_REJECT6) {
  4059. log_warn(LD_DIR, "Expected 'accept' or 'reject'.");
  4060. goto err;
  4061. }
  4062. /* Use the extended interpretation of accept/reject *,
  4063. * expanding it into an IPv4 wildcard and an IPv6 wildcard.
  4064. * Also permit *4 and *6 for IPv4 and IPv6 only wildcards. */
  4065. r = router_parse_addr_policy(tok, TAPMP_EXTENDED_STAR);
  4066. if (!r) {
  4067. goto err;
  4068. }
  4069. /* Ensure that accept6/reject6 fields are followed by IPv6 addresses.
  4070. * AF_UNSPEC addresses are only permitted on the accept/reject field type.
  4071. * Unlike descriptors, torrcs exit policy accept/reject can be followed by
  4072. * either an IPv4 or IPv6 address. */
  4073. if ((tok->tp == K_ACCEPT6 || tok->tp == K_REJECT6) &&
  4074. tor_addr_family(&r->addr) != AF_INET6) {
  4075. /* This is a non-fatal error, just ignore this one entry. */
  4076. *malformed_list = 0;
  4077. log_warn(LD_DIR, "IPv4 address '%s' with accept6/reject6 field type in "
  4078. "exit policy. Ignoring, but continuing to parse rules. (Use "
  4079. "accept/reject with IPv4 addresses.)",
  4080. tok->n_args == 1 ? tok->args[0] : "");
  4081. addr_policy_free(r);
  4082. r = NULL;
  4083. goto done;
  4084. }
  4085. goto done;
  4086. err:
  4087. *malformed_list = 1;
  4088. r = NULL;
  4089. done:
  4090. token_clear(tok);
  4091. if (area) {
  4092. DUMP_AREA(area, "policy item");
  4093. memarea_drop_all(area);
  4094. }
  4095. return r;
  4096. }
  4097. /** Add an exit policy stored in the token <b>tok</b> to the router info in
  4098. * <b>router</b>. Return 0 on success, -1 on failure. */
  4099. static int
  4100. router_add_exit_policy(routerinfo_t *router, directory_token_t *tok)
  4101. {
  4102. addr_policy_t *newe;
  4103. /* Use the standard interpretation of accept/reject *, an IPv4 wildcard. */
  4104. newe = router_parse_addr_policy(tok, 0);
  4105. if (!newe)
  4106. return -1;
  4107. if (! router->exit_policy)
  4108. router->exit_policy = smartlist_new();
  4109. /* Ensure that in descriptors, accept/reject fields are followed by
  4110. * IPv4 addresses, and accept6/reject6 fields are followed by
  4111. * IPv6 addresses. Unlike torrcs, descriptor exit policies do not permit
  4112. * accept/reject followed by IPv6. */
  4113. if (((tok->tp == K_ACCEPT6 || tok->tp == K_REJECT6) &&
  4114. tor_addr_family(&newe->addr) == AF_INET)
  4115. ||
  4116. ((tok->tp == K_ACCEPT || tok->tp == K_REJECT) &&
  4117. tor_addr_family(&newe->addr) == AF_INET6)) {
  4118. /* There's nothing the user can do about other relays' descriptors,
  4119. * so we don't provide usage advice here. */
  4120. log_warn(LD_DIR, "Mismatch between field type and address type in exit "
  4121. "policy '%s'. Discarding entire router descriptor.",
  4122. tok->n_args == 1 ? tok->args[0] : "");
  4123. addr_policy_free(newe);
  4124. return -1;
  4125. }
  4126. smartlist_add(router->exit_policy, newe);
  4127. return 0;
  4128. }
  4129. /** Given a K_ACCEPT[6] or K_REJECT[6] token and a router, create and return
  4130. * a new exit_policy_t corresponding to the token. If TAPMP_EXTENDED_STAR
  4131. * is set in fmt_flags, K_ACCEPT6 and K_REJECT6 tokens followed by *
  4132. * expand to IPv6-only policies, otherwise they expand to IPv4 and IPv6
  4133. * policies */
  4134. static addr_policy_t *
  4135. router_parse_addr_policy(directory_token_t *tok, unsigned fmt_flags)
  4136. {
  4137. addr_policy_t newe;
  4138. char *arg;
  4139. tor_assert(tok->tp == K_REJECT || tok->tp == K_REJECT6 ||
  4140. tok->tp == K_ACCEPT || tok->tp == K_ACCEPT6);
  4141. if (tok->n_args != 1)
  4142. return NULL;
  4143. arg = tok->args[0];
  4144. if (!strcmpstart(arg,"private"))
  4145. return router_parse_addr_policy_private(tok);
  4146. memset(&newe, 0, sizeof(newe));
  4147. if (tok->tp == K_REJECT || tok->tp == K_REJECT6)
  4148. newe.policy_type = ADDR_POLICY_REJECT;
  4149. else
  4150. newe.policy_type = ADDR_POLICY_ACCEPT;
  4151. /* accept6/reject6 * produces an IPv6 wildcard address only.
  4152. * (accept/reject * produces rules for IPv4 and IPv6 wildcard addresses.) */
  4153. if ((fmt_flags & TAPMP_EXTENDED_STAR)
  4154. && (tok->tp == K_ACCEPT6 || tok->tp == K_REJECT6)) {
  4155. fmt_flags |= TAPMP_STAR_IPV6_ONLY;
  4156. }
  4157. if (tor_addr_parse_mask_ports(arg, fmt_flags, &newe.addr, &newe.maskbits,
  4158. &newe.prt_min, &newe.prt_max) < 0) {
  4159. log_warn(LD_DIR,"Couldn't parse line %s. Dropping", escaped(arg));
  4160. return NULL;
  4161. }
  4162. return addr_policy_get_canonical_entry(&newe);
  4163. }
  4164. /** Parse an exit policy line of the format "accept[6]/reject[6] private:...".
  4165. * This didn't exist until Tor 0.1.1.15, so nobody should generate it in
  4166. * router descriptors until earlier versions are obsolete.
  4167. *
  4168. * accept/reject and accept6/reject6 private all produce rules for both
  4169. * IPv4 and IPv6 addresses.
  4170. */
  4171. static addr_policy_t *
  4172. router_parse_addr_policy_private(directory_token_t *tok)
  4173. {
  4174. const char *arg;
  4175. uint16_t port_min, port_max;
  4176. addr_policy_t result;
  4177. arg = tok->args[0];
  4178. if (strcmpstart(arg, "private"))
  4179. return NULL;
  4180. arg += strlen("private");
  4181. arg = (char*) eat_whitespace(arg);
  4182. if (!arg || *arg != ':')
  4183. return NULL;
  4184. if (parse_port_range(arg+1, &port_min, &port_max)<0)
  4185. return NULL;
  4186. memset(&result, 0, sizeof(result));
  4187. if (tok->tp == K_REJECT || tok->tp == K_REJECT6)
  4188. result.policy_type = ADDR_POLICY_REJECT;
  4189. else
  4190. result.policy_type = ADDR_POLICY_ACCEPT;
  4191. result.is_private = 1;
  4192. result.prt_min = port_min;
  4193. result.prt_max = port_max;
  4194. if (tok->tp == K_ACCEPT6 || tok->tp == K_REJECT6) {
  4195. log_warn(LD_GENERAL,
  4196. "'%s' expands into rules which apply to all private IPv4 and "
  4197. "IPv6 addresses. (Use accept/reject private:* for IPv4 and "
  4198. "IPv6.)", tok->n_args == 1 ? tok->args[0] : "");
  4199. }
  4200. return addr_policy_get_canonical_entry(&result);
  4201. }
  4202. /** Log and exit if <b>t</b> is malformed */
  4203. void
  4204. assert_addr_policy_ok(smartlist_t *lst)
  4205. {
  4206. if (!lst) return;
  4207. SMARTLIST_FOREACH(lst, addr_policy_t *, t, {
  4208. tor_assert(t->policy_type == ADDR_POLICY_REJECT ||
  4209. t->policy_type == ADDR_POLICY_ACCEPT);
  4210. tor_assert(t->prt_min <= t->prt_max);
  4211. });
  4212. }
  4213. /*
  4214. * Low-level tokenizer for router descriptors and directories.
  4215. */
  4216. /** Free all resources allocated for <b>tok</b> */
  4217. static void
  4218. token_clear(directory_token_t *tok)
  4219. {
  4220. if (tok->key)
  4221. crypto_pk_free(tok->key);
  4222. }
  4223. #define ALLOC_ZERO(sz) memarea_alloc_zero(area,sz)
  4224. #define ALLOC(sz) memarea_alloc(area,sz)
  4225. #define STRDUP(str) memarea_strdup(area,str)
  4226. #define STRNDUP(str,n) memarea_strndup(area,(str),(n))
  4227. #define RET_ERR(msg) \
  4228. STMT_BEGIN \
  4229. if (tok) token_clear(tok); \
  4230. tok = ALLOC_ZERO(sizeof(directory_token_t)); \
  4231. tok->tp = ERR_; \
  4232. tok->error = STRDUP(msg); \
  4233. goto done_tokenizing; \
  4234. STMT_END
  4235. /** Helper: make sure that the token <b>tok</b> with keyword <b>kwd</b> obeys
  4236. * the object syntax of <b>o_syn</b>. Allocate all storage in <b>area</b>.
  4237. * Return <b>tok</b> on success, or a new ERR_ token if the token didn't
  4238. * conform to the syntax we wanted.
  4239. **/
  4240. static inline directory_token_t *
  4241. token_check_object(memarea_t *area, const char *kwd,
  4242. directory_token_t *tok, obj_syntax o_syn)
  4243. {
  4244. char ebuf[128];
  4245. switch (o_syn) {
  4246. case NO_OBJ:
  4247. /* No object is allowed for this token. */
  4248. if (tok->object_body) {
  4249. tor_snprintf(ebuf, sizeof(ebuf), "Unexpected object for %s", kwd);
  4250. RET_ERR(ebuf);
  4251. }
  4252. if (tok->key) {
  4253. tor_snprintf(ebuf, sizeof(ebuf), "Unexpected public key for %s", kwd);
  4254. RET_ERR(ebuf);
  4255. }
  4256. break;
  4257. case NEED_OBJ:
  4258. /* There must be a (non-key) object. */
  4259. if (!tok->object_body) {
  4260. tor_snprintf(ebuf, sizeof(ebuf), "Missing object for %s", kwd);
  4261. RET_ERR(ebuf);
  4262. }
  4263. break;
  4264. case NEED_KEY_1024: /* There must be a 1024-bit public key. */
  4265. case NEED_SKEY_1024: /* There must be a 1024-bit private key. */
  4266. if (tok->key && crypto_pk_num_bits(tok->key) != PK_BYTES*8) {
  4267. tor_snprintf(ebuf, sizeof(ebuf), "Wrong size on key for %s: %d bits",
  4268. kwd, crypto_pk_num_bits(tok->key));
  4269. RET_ERR(ebuf);
  4270. }
  4271. /* fall through */
  4272. case NEED_KEY: /* There must be some kind of key. */
  4273. if (!tok->key) {
  4274. tor_snprintf(ebuf, sizeof(ebuf), "Missing public key for %s", kwd);
  4275. RET_ERR(ebuf);
  4276. }
  4277. if (o_syn != NEED_SKEY_1024) {
  4278. if (crypto_pk_key_is_private(tok->key)) {
  4279. tor_snprintf(ebuf, sizeof(ebuf),
  4280. "Private key given for %s, which wants a public key", kwd);
  4281. RET_ERR(ebuf);
  4282. }
  4283. } else { /* o_syn == NEED_SKEY_1024 */
  4284. if (!crypto_pk_key_is_private(tok->key)) {
  4285. tor_snprintf(ebuf, sizeof(ebuf),
  4286. "Public key given for %s, which wants a private key", kwd);
  4287. RET_ERR(ebuf);
  4288. }
  4289. }
  4290. break;
  4291. case OBJ_OK:
  4292. /* Anything goes with this token. */
  4293. break;
  4294. }
  4295. done_tokenizing:
  4296. return tok;
  4297. }
  4298. /** Helper: parse space-separated arguments from the string <b>s</b> ending at
  4299. * <b>eol</b>, and store them in the args field of <b>tok</b>. Store the
  4300. * number of parsed elements into the n_args field of <b>tok</b>. Allocate
  4301. * all storage in <b>area</b>. Return the number of arguments parsed, or
  4302. * return -1 if there was an insanely high number of arguments. */
  4303. static inline int
  4304. get_token_arguments(memarea_t *area, directory_token_t *tok,
  4305. const char *s, const char *eol)
  4306. {
  4307. /** Largest number of arguments we'll accept to any token, ever. */
  4308. #define MAX_ARGS 512
  4309. char *mem = memarea_strndup(area, s, eol-s);
  4310. char *cp = mem;
  4311. int j = 0;
  4312. char *args[MAX_ARGS];
  4313. while (*cp) {
  4314. if (j == MAX_ARGS)
  4315. return -1;
  4316. args[j++] = cp;
  4317. cp = (char*)find_whitespace(cp);
  4318. if (!cp || !*cp)
  4319. break; /* End of the line. */
  4320. *cp++ = '\0';
  4321. cp = (char*)eat_whitespace(cp);
  4322. }
  4323. tok->n_args = j;
  4324. tok->args = memarea_memdup(area, args, j*sizeof(char*));
  4325. return j;
  4326. #undef MAX_ARGS
  4327. }
  4328. /** Helper function: read the next token from *s, advance *s to the end of the
  4329. * token, and return the parsed token. Parse *<b>s</b> according to the list
  4330. * of tokens in <b>table</b>.
  4331. */
  4332. static directory_token_t *
  4333. get_next_token(memarea_t *area,
  4334. const char **s, const char *eos, token_rule_t *table)
  4335. {
  4336. /** Reject any object at least this big; it is probably an overflow, an
  4337. * attack, a bug, or some other nonsense. */
  4338. #define MAX_UNPARSED_OBJECT_SIZE (128*1024)
  4339. /** Reject any line at least this big; it is probably an overflow, an
  4340. * attack, a bug, or some other nonsense. */
  4341. #define MAX_LINE_LENGTH (128*1024)
  4342. const char *next, *eol, *obstart;
  4343. size_t obname_len;
  4344. int i;
  4345. directory_token_t *tok;
  4346. obj_syntax o_syn = NO_OBJ;
  4347. char ebuf[128];
  4348. const char *kwd = "";
  4349. tor_assert(area);
  4350. tok = ALLOC_ZERO(sizeof(directory_token_t));
  4351. tok->tp = ERR_;
  4352. /* Set *s to first token, eol to end-of-line, next to after first token */
  4353. *s = eat_whitespace_eos(*s, eos); /* eat multi-line whitespace */
  4354. tor_assert(eos >= *s);
  4355. eol = memchr(*s, '\n', eos-*s);
  4356. if (!eol)
  4357. eol = eos;
  4358. if (eol - *s > MAX_LINE_LENGTH) {
  4359. RET_ERR("Line far too long");
  4360. }
  4361. next = find_whitespace_eos(*s, eol);
  4362. if (!strcmp_len(*s, "opt", next-*s)) {
  4363. /* Skip past an "opt" at the start of the line. */
  4364. *s = eat_whitespace_eos_no_nl(next, eol);
  4365. next = find_whitespace_eos(*s, eol);
  4366. } else if (*s == eos) { /* If no "opt", and end-of-line, line is invalid */
  4367. RET_ERR("Unexpected EOF");
  4368. }
  4369. /* Search the table for the appropriate entry. (I tried a binary search
  4370. * instead, but it wasn't any faster.) */
  4371. for (i = 0; table[i].t ; ++i) {
  4372. if (!strcmp_len(*s, table[i].t, next-*s)) {
  4373. /* We've found the keyword. */
  4374. kwd = table[i].t;
  4375. tok->tp = table[i].v;
  4376. o_syn = table[i].os;
  4377. *s = eat_whitespace_eos_no_nl(next, eol);
  4378. /* We go ahead whether there are arguments or not, so that tok->args is
  4379. * always set if we want arguments. */
  4380. if (table[i].concat_args) {
  4381. /* The keyword takes the line as a single argument */
  4382. tok->args = ALLOC(sizeof(char*));
  4383. tok->args[0] = STRNDUP(*s,eol-*s); /* Grab everything on line */
  4384. tok->n_args = 1;
  4385. } else {
  4386. /* This keyword takes multiple arguments. */
  4387. if (get_token_arguments(area, tok, *s, eol)<0) {
  4388. tor_snprintf(ebuf, sizeof(ebuf),"Far too many arguments to %s", kwd);
  4389. RET_ERR(ebuf);
  4390. }
  4391. *s = eol;
  4392. }
  4393. if (tok->n_args < table[i].min_args) {
  4394. tor_snprintf(ebuf, sizeof(ebuf), "Too few arguments to %s", kwd);
  4395. RET_ERR(ebuf);
  4396. } else if (tok->n_args > table[i].max_args) {
  4397. tor_snprintf(ebuf, sizeof(ebuf), "Too many arguments to %s", kwd);
  4398. RET_ERR(ebuf);
  4399. }
  4400. break;
  4401. }
  4402. }
  4403. if (tok->tp == ERR_) {
  4404. /* No keyword matched; call it an "K_opt" or "A_unrecognized" */
  4405. if (**s == '@')
  4406. tok->tp = A_UNKNOWN_;
  4407. else
  4408. tok->tp = K_OPT;
  4409. tok->args = ALLOC(sizeof(char*));
  4410. tok->args[0] = STRNDUP(*s, eol-*s);
  4411. tok->n_args = 1;
  4412. o_syn = OBJ_OK;
  4413. }
  4414. /* Check whether there's an object present */
  4415. *s = eat_whitespace_eos(eol, eos); /* Scan from end of first line */
  4416. tor_assert(eos >= *s);
  4417. eol = memchr(*s, '\n', eos-*s);
  4418. if (!eol || eol-*s<11 || strcmpstart(*s, "-----BEGIN ")) /* No object. */
  4419. goto check_object;
  4420. obstart = *s; /* Set obstart to start of object spec */
  4421. if (*s+16 >= eol || memchr(*s+11,'\0',eol-*s-16) || /* no short lines, */
  4422. strcmp_len(eol-5, "-----", 5) || /* nuls or invalid endings */
  4423. (eol-*s) > MAX_UNPARSED_OBJECT_SIZE) { /* name too long */
  4424. RET_ERR("Malformed object: bad begin line");
  4425. }
  4426. tok->object_type = STRNDUP(*s+11, eol-*s-16);
  4427. obname_len = eol-*s-16; /* store objname length here to avoid a strlen() */
  4428. *s = eol+1; /* Set *s to possible start of object data (could be eos) */
  4429. /* Go to the end of the object */
  4430. next = tor_memstr(*s, eos-*s, "-----END ");
  4431. if (!next) {
  4432. RET_ERR("Malformed object: missing object end line");
  4433. }
  4434. tor_assert(eos >= next);
  4435. eol = memchr(next, '\n', eos-next);
  4436. if (!eol) /* end-of-line marker, or eos if there's no '\n' */
  4437. eol = eos;
  4438. /* Validate the ending tag, which should be 9 + NAME + 5 + eol */
  4439. if ((size_t)(eol-next) != 9+obname_len+5 ||
  4440. strcmp_len(next+9, tok->object_type, obname_len) ||
  4441. strcmp_len(eol-5, "-----", 5)) {
  4442. tor_snprintf(ebuf, sizeof(ebuf), "Malformed object: mismatched end tag %s",
  4443. tok->object_type);
  4444. ebuf[sizeof(ebuf)-1] = '\0';
  4445. RET_ERR(ebuf);
  4446. }
  4447. if (next - *s > MAX_UNPARSED_OBJECT_SIZE)
  4448. RET_ERR("Couldn't parse object: missing footer or object much too big.");
  4449. if (!strcmp(tok->object_type, "RSA PUBLIC KEY")) { /* If it's a public key */
  4450. tok->key = crypto_pk_new();
  4451. if (crypto_pk_read_public_key_from_string(tok->key, obstart, eol-obstart))
  4452. RET_ERR("Couldn't parse public key.");
  4453. } else if (!strcmp(tok->object_type, "RSA PRIVATE KEY")) { /* private key */
  4454. tok->key = crypto_pk_new();
  4455. if (crypto_pk_read_private_key_from_string(tok->key, obstart, eol-obstart))
  4456. RET_ERR("Couldn't parse private key.");
  4457. } else { /* If it's something else, try to base64-decode it */
  4458. int r;
  4459. tok->object_body = ALLOC(next-*s); /* really, this is too much RAM. */
  4460. r = base64_decode(tok->object_body, next-*s, *s, next-*s);
  4461. if (r<0)
  4462. RET_ERR("Malformed object: bad base64-encoded data");
  4463. tok->object_size = r;
  4464. }
  4465. *s = eol;
  4466. check_object:
  4467. tok = token_check_object(area, kwd, tok, o_syn);
  4468. done_tokenizing:
  4469. return tok;
  4470. #undef RET_ERR
  4471. #undef ALLOC
  4472. #undef ALLOC_ZERO
  4473. #undef STRDUP
  4474. #undef STRNDUP
  4475. }
  4476. /** Read all tokens from a string between <b>start</b> and <b>end</b>, and add
  4477. * them to <b>out</b>. Parse according to the token rules in <b>table</b>.
  4478. * Caller must free tokens in <b>out</b>. If <b>end</b> is NULL, use the
  4479. * entire string.
  4480. */
  4481. static int
  4482. tokenize_string(memarea_t *area,
  4483. const char *start, const char *end, smartlist_t *out,
  4484. token_rule_t *table, int flags)
  4485. {
  4486. const char **s;
  4487. directory_token_t *tok = NULL;
  4488. int counts[NIL_];
  4489. int i;
  4490. int first_nonannotation;
  4491. int prev_len = smartlist_len(out);
  4492. tor_assert(area);
  4493. s = &start;
  4494. if (!end) {
  4495. end = start+strlen(start);
  4496. } else {
  4497. /* it's only meaningful to check for nuls if we got an end-of-string ptr */
  4498. if (memchr(start, '\0', end-start)) {
  4499. log_warn(LD_DIR, "parse error: internal NUL character.");
  4500. return -1;
  4501. }
  4502. }
  4503. for (i = 0; i < NIL_; ++i)
  4504. counts[i] = 0;
  4505. SMARTLIST_FOREACH(out, const directory_token_t *, t, ++counts[t->tp]);
  4506. while (*s < end && (!tok || tok->tp != EOF_)) {
  4507. tok = get_next_token(area, s, end, table);
  4508. if (tok->tp == ERR_) {
  4509. log_warn(LD_DIR, "parse error: %s", tok->error);
  4510. token_clear(tok);
  4511. return -1;
  4512. }
  4513. ++counts[tok->tp];
  4514. smartlist_add(out, tok);
  4515. *s = eat_whitespace_eos(*s, end);
  4516. }
  4517. if (flags & TS_NOCHECK)
  4518. return 0;
  4519. if ((flags & TS_ANNOTATIONS_OK)) {
  4520. first_nonannotation = -1;
  4521. for (i = 0; i < smartlist_len(out); ++i) {
  4522. tok = smartlist_get(out, i);
  4523. if (tok->tp < MIN_ANNOTATION || tok->tp > MAX_ANNOTATION) {
  4524. first_nonannotation = i;
  4525. break;
  4526. }
  4527. }
  4528. if (first_nonannotation < 0) {
  4529. log_warn(LD_DIR, "parse error: item contains only annotations");
  4530. return -1;
  4531. }
  4532. for (i=first_nonannotation; i < smartlist_len(out); ++i) {
  4533. tok = smartlist_get(out, i);
  4534. if (tok->tp >= MIN_ANNOTATION && tok->tp <= MAX_ANNOTATION) {
  4535. log_warn(LD_DIR, "parse error: Annotations mixed with keywords");
  4536. return -1;
  4537. }
  4538. }
  4539. if ((flags & TS_NO_NEW_ANNOTATIONS)) {
  4540. if (first_nonannotation != prev_len) {
  4541. log_warn(LD_DIR, "parse error: Unexpected annotations.");
  4542. return -1;
  4543. }
  4544. }
  4545. } else {
  4546. for (i=0; i < smartlist_len(out); ++i) {
  4547. tok = smartlist_get(out, i);
  4548. if (tok->tp >= MIN_ANNOTATION && tok->tp <= MAX_ANNOTATION) {
  4549. log_warn(LD_DIR, "parse error: no annotations allowed.");
  4550. return -1;
  4551. }
  4552. }
  4553. first_nonannotation = 0;
  4554. }
  4555. for (i = 0; table[i].t; ++i) {
  4556. if (counts[table[i].v] < table[i].min_cnt) {
  4557. log_warn(LD_DIR, "Parse error: missing %s element.", table[i].t);
  4558. return -1;
  4559. }
  4560. if (counts[table[i].v] > table[i].max_cnt) {
  4561. log_warn(LD_DIR, "Parse error: too many %s elements.", table[i].t);
  4562. return -1;
  4563. }
  4564. if (table[i].pos & AT_START) {
  4565. if (smartlist_len(out) < 1 ||
  4566. (tok = smartlist_get(out, first_nonannotation))->tp != table[i].v) {
  4567. log_warn(LD_DIR, "Parse error: first item is not %s.", table[i].t);
  4568. return -1;
  4569. }
  4570. }
  4571. if (table[i].pos & AT_END) {
  4572. if (smartlist_len(out) < 1 ||
  4573. (tok = smartlist_get(out, smartlist_len(out)-1))->tp != table[i].v) {
  4574. log_warn(LD_DIR, "Parse error: last item is not %s.", table[i].t);
  4575. return -1;
  4576. }
  4577. }
  4578. }
  4579. return 0;
  4580. }
  4581. /** Find the first token in <b>s</b> whose keyword is <b>keyword</b>; return
  4582. * NULL if no such keyword is found.
  4583. */
  4584. static directory_token_t *
  4585. find_opt_by_keyword(smartlist_t *s, directory_keyword keyword)
  4586. {
  4587. SMARTLIST_FOREACH(s, directory_token_t *, t, if (t->tp == keyword) return t);
  4588. return NULL;
  4589. }
  4590. /** Find the first token in <b>s</b> whose keyword is <b>keyword</b>; fail
  4591. * with an assert if no such keyword is found.
  4592. */
  4593. static directory_token_t *
  4594. find_by_keyword_(smartlist_t *s, directory_keyword keyword,
  4595. const char *keyword_as_string)
  4596. {
  4597. directory_token_t *tok = find_opt_by_keyword(s, keyword);
  4598. if (PREDICT_UNLIKELY(!tok)) {
  4599. log_err(LD_BUG, "Missing %s [%d] in directory object that should have "
  4600. "been validated. Internal error.", keyword_as_string, (int)keyword);
  4601. tor_assert(tok);
  4602. }
  4603. return tok;
  4604. }
  4605. /** If there are any directory_token_t entries in <b>s</b> whose keyword is
  4606. * <b>k</b>, return a newly allocated smartlist_t containing all such entries,
  4607. * in the same order in which they occur in <b>s</b>. Otherwise return
  4608. * NULL. */
  4609. static smartlist_t *
  4610. find_all_by_keyword(smartlist_t *s, directory_keyword k)
  4611. {
  4612. smartlist_t *out = NULL;
  4613. SMARTLIST_FOREACH(s, directory_token_t *, t,
  4614. if (t->tp == k) {
  4615. if (!out)
  4616. out = smartlist_new();
  4617. smartlist_add(out, t);
  4618. });
  4619. return out;
  4620. }
  4621. /** Return a newly allocated smartlist of all accept or reject tokens in
  4622. * <b>s</b>.
  4623. */
  4624. static smartlist_t *
  4625. find_all_exitpolicy(smartlist_t *s)
  4626. {
  4627. smartlist_t *out = smartlist_new();
  4628. SMARTLIST_FOREACH(s, directory_token_t *, t,
  4629. if (t->tp == K_ACCEPT || t->tp == K_ACCEPT6 ||
  4630. t->tp == K_REJECT || t->tp == K_REJECT6)
  4631. smartlist_add(out,t));
  4632. return out;
  4633. }
  4634. /** Helper function for <b>router_get_hash_impl</b>: given <b>s</b>,
  4635. * <b>s_len</b>, <b>start_str</b>, <b>end_str</b>, and <b>end_c</b> with the
  4636. * same semantics as in that function, set *<b>start_out</b> (inclusive) and
  4637. * *<b>end_out</b> (exclusive) to the boundaries of the string to be hashed.
  4638. *
  4639. * Return 0 on success and -1 on failure.
  4640. */
  4641. static int
  4642. router_get_hash_impl_helper(const char *s, size_t s_len,
  4643. const char *start_str,
  4644. const char *end_str, char end_c,
  4645. const char **start_out, const char **end_out)
  4646. {
  4647. const char *start, *end;
  4648. start = tor_memstr(s, s_len, start_str);
  4649. if (!start) {
  4650. log_warn(LD_DIR,"couldn't find start of hashed material \"%s\"",start_str);
  4651. return -1;
  4652. }
  4653. if (start != s && *(start-1) != '\n') {
  4654. log_warn(LD_DIR,
  4655. "first occurrence of \"%s\" is not at the start of a line",
  4656. start_str);
  4657. return -1;
  4658. }
  4659. end = tor_memstr(start+strlen(start_str),
  4660. s_len - (start-s) - strlen(start_str), end_str);
  4661. if (!end) {
  4662. log_warn(LD_DIR,"couldn't find end of hashed material \"%s\"",end_str);
  4663. return -1;
  4664. }
  4665. end = memchr(end+strlen(end_str), end_c, s_len - (end-s) - strlen(end_str));
  4666. if (!end) {
  4667. log_warn(LD_DIR,"couldn't find EOL");
  4668. return -1;
  4669. }
  4670. ++end;
  4671. *start_out = start;
  4672. *end_out = end;
  4673. return 0;
  4674. }
  4675. /** Compute the digest of the substring of <b>s</b> taken from the first
  4676. * occurrence of <b>start_str</b> through the first instance of c after the
  4677. * first subsequent occurrence of <b>end_str</b>; store the 20-byte or 32-byte
  4678. * result in <b>digest</b>; return 0 on success.
  4679. *
  4680. * If no such substring exists, return -1.
  4681. */
  4682. static int
  4683. router_get_hash_impl(const char *s, size_t s_len, char *digest,
  4684. const char *start_str,
  4685. const char *end_str, char end_c,
  4686. digest_algorithm_t alg)
  4687. {
  4688. const char *start=NULL, *end=NULL;
  4689. if (router_get_hash_impl_helper(s,s_len,start_str,end_str,end_c,
  4690. &start,&end)<0)
  4691. return -1;
  4692. if (alg == DIGEST_SHA1) {
  4693. if (crypto_digest(digest, start, end-start)) {
  4694. log_warn(LD_BUG,"couldn't compute digest");
  4695. return -1;
  4696. }
  4697. } else {
  4698. if (crypto_digest256(digest, start, end-start, alg)) {
  4699. log_warn(LD_BUG,"couldn't compute digest");
  4700. return -1;
  4701. }
  4702. }
  4703. return 0;
  4704. }
  4705. /** As router_get_hash_impl, but compute all hashes. */
  4706. static int
  4707. router_get_hashes_impl(const char *s, size_t s_len, common_digests_t *digests,
  4708. const char *start_str,
  4709. const char *end_str, char end_c)
  4710. {
  4711. const char *start=NULL, *end=NULL;
  4712. if (router_get_hash_impl_helper(s,s_len,start_str,end_str,end_c,
  4713. &start,&end)<0)
  4714. return -1;
  4715. if (crypto_common_digests(digests, start, end-start)) {
  4716. log_warn(LD_BUG,"couldn't compute digests");
  4717. return -1;
  4718. }
  4719. return 0;
  4720. }
  4721. /** Assuming that s starts with a microdesc, return the start of the
  4722. * *NEXT* one. Return NULL on "not found." */
  4723. static const char *
  4724. find_start_of_next_microdesc(const char *s, const char *eos)
  4725. {
  4726. int started_with_annotations;
  4727. s = eat_whitespace_eos(s, eos);
  4728. if (!s)
  4729. return NULL;
  4730. #define CHECK_LENGTH() STMT_BEGIN \
  4731. if (s+32 > eos) \
  4732. return NULL; \
  4733. STMT_END
  4734. #define NEXT_LINE() STMT_BEGIN \
  4735. s = memchr(s, '\n', eos-s); \
  4736. if (!s || s+1 >= eos) \
  4737. return NULL; \
  4738. s++; \
  4739. STMT_END
  4740. CHECK_LENGTH();
  4741. started_with_annotations = (*s == '@');
  4742. if (started_with_annotations) {
  4743. /* Start by advancing to the first non-annotation line. */
  4744. while (*s == '@')
  4745. NEXT_LINE();
  4746. }
  4747. CHECK_LENGTH();
  4748. /* Now we should be pointed at an onion-key line. If we are, then skip
  4749. * it. */
  4750. if (!strcmpstart(s, "onion-key"))
  4751. NEXT_LINE();
  4752. /* Okay, now we're pointed at the first line of the microdescriptor which is
  4753. not an annotation or onion-key. The next line that _is_ an annotation or
  4754. onion-key is the start of the next microdescriptor. */
  4755. while (s+32 < eos) {
  4756. if (*s == '@' || !strcmpstart(s, "onion-key"))
  4757. return s;
  4758. NEXT_LINE();
  4759. }
  4760. return NULL;
  4761. #undef CHECK_LENGTH
  4762. #undef NEXT_LINE
  4763. }
  4764. /** Parse as many microdescriptors as are found from the string starting at
  4765. * <b>s</b> and ending at <b>eos</b>. If allow_annotations is set, read any
  4766. * annotations we recognize and ignore ones we don't.
  4767. *
  4768. * If <b>saved_location</b> isn't SAVED_IN_CACHE, make a local copy of each
  4769. * descriptor in the body field of each microdesc_t.
  4770. *
  4771. * Return all newly parsed microdescriptors in a newly allocated
  4772. * smartlist_t. If <b>invalid_disgests_out</b> is provided, add a SHA256
  4773. * microdesc digest to it for every microdesc that we found to be badly
  4774. * formed. (This may cause duplicates) */
  4775. smartlist_t *
  4776. microdescs_parse_from_string(const char *s, const char *eos,
  4777. int allow_annotations,
  4778. saved_location_t where,
  4779. smartlist_t *invalid_digests_out)
  4780. {
  4781. smartlist_t *tokens;
  4782. smartlist_t *result;
  4783. microdesc_t *md = NULL;
  4784. memarea_t *area;
  4785. const char *start = s;
  4786. const char *start_of_next_microdesc;
  4787. int flags = allow_annotations ? TS_ANNOTATIONS_OK : 0;
  4788. const int copy_body = (where != SAVED_IN_CACHE);
  4789. directory_token_t *tok;
  4790. if (!eos)
  4791. eos = s + strlen(s);
  4792. s = eat_whitespace_eos(s, eos);
  4793. area = memarea_new();
  4794. result = smartlist_new();
  4795. tokens = smartlist_new();
  4796. while (s < eos) {
  4797. int okay = 0;
  4798. start_of_next_microdesc = find_start_of_next_microdesc(s, eos);
  4799. if (!start_of_next_microdesc)
  4800. start_of_next_microdesc = eos;
  4801. md = tor_malloc_zero(sizeof(microdesc_t));
  4802. {
  4803. const char *cp = tor_memstr(s, start_of_next_microdesc-s,
  4804. "onion-key");
  4805. const int no_onion_key = (cp == NULL);
  4806. if (no_onion_key) {
  4807. cp = s; /* So that we have *some* junk to put in the body */
  4808. }
  4809. md->bodylen = start_of_next_microdesc - cp;
  4810. md->saved_location = where;
  4811. if (copy_body)
  4812. md->body = tor_memdup_nulterm(cp, md->bodylen);
  4813. else
  4814. md->body = (char*)cp;
  4815. md->off = cp - start;
  4816. crypto_digest256(md->digest, md->body, md->bodylen, DIGEST_SHA256);
  4817. if (no_onion_key) {
  4818. log_fn(LOG_PROTOCOL_WARN, LD_DIR, "Malformed or truncated descriptor");
  4819. goto next;
  4820. }
  4821. }
  4822. if (tokenize_string(area, s, start_of_next_microdesc, tokens,
  4823. microdesc_token_table, flags)) {
  4824. log_warn(LD_DIR, "Unparseable microdescriptor");
  4825. goto next;
  4826. }
  4827. if ((tok = find_opt_by_keyword(tokens, A_LAST_LISTED))) {
  4828. if (parse_iso_time(tok->args[0], &md->last_listed)) {
  4829. log_warn(LD_DIR, "Bad last-listed time in microdescriptor");
  4830. goto next;
  4831. }
  4832. }
  4833. tok = find_by_keyword(tokens, K_ONION_KEY);
  4834. if (!crypto_pk_public_exponent_ok(tok->key)) {
  4835. log_warn(LD_DIR,
  4836. "Relay's onion key had invalid exponent.");
  4837. goto next;
  4838. }
  4839. md->onion_pkey = tok->key;
  4840. tok->key = NULL;
  4841. if ((tok = find_opt_by_keyword(tokens, K_ONION_KEY_NTOR))) {
  4842. curve25519_public_key_t k;
  4843. tor_assert(tok->n_args >= 1);
  4844. if (curve25519_public_from_base64(&k, tok->args[0]) < 0) {
  4845. log_warn(LD_DIR, "Bogus ntor-onion-key in microdesc");
  4846. goto next;
  4847. }
  4848. md->onion_curve25519_pkey =
  4849. tor_memdup(&k, sizeof(curve25519_public_key_t));
  4850. }
  4851. smartlist_t *id_lines = find_all_by_keyword(tokens, K_ID);
  4852. if (id_lines) {
  4853. SMARTLIST_FOREACH_BEGIN(id_lines, directory_token_t *, t) {
  4854. tor_assert(t->n_args >= 2);
  4855. if (!strcmp(t->args[0], "ed25519")) {
  4856. if (md->ed25519_identity_pkey) {
  4857. log_warn(LD_DIR, "Extra ed25519 key in microdesc");
  4858. goto next;
  4859. }
  4860. ed25519_public_key_t k;
  4861. if (ed25519_public_from_base64(&k, t->args[1])<0) {
  4862. log_warn(LD_DIR, "Bogus ed25519 key in microdesc");
  4863. goto next;
  4864. }
  4865. md->ed25519_identity_pkey = tor_memdup(&k, sizeof(k));
  4866. }
  4867. } SMARTLIST_FOREACH_END(t);
  4868. smartlist_free(id_lines);
  4869. }
  4870. {
  4871. smartlist_t *a_lines = find_all_by_keyword(tokens, K_A);
  4872. if (a_lines) {
  4873. find_single_ipv6_orport(a_lines, &md->ipv6_addr, &md->ipv6_orport);
  4874. smartlist_free(a_lines);
  4875. }
  4876. }
  4877. if ((tok = find_opt_by_keyword(tokens, K_FAMILY))) {
  4878. int i;
  4879. md->family = smartlist_new();
  4880. for (i=0;i<tok->n_args;++i) {
  4881. if (!is_legal_nickname_or_hexdigest(tok->args[i])) {
  4882. log_warn(LD_DIR, "Illegal nickname %s in family line",
  4883. escaped(tok->args[i]));
  4884. goto next;
  4885. }
  4886. smartlist_add(md->family, tor_strdup(tok->args[i]));
  4887. }
  4888. }
  4889. if ((tok = find_opt_by_keyword(tokens, K_P))) {
  4890. md->exit_policy = parse_short_policy(tok->args[0]);
  4891. }
  4892. if ((tok = find_opt_by_keyword(tokens, K_P6))) {
  4893. md->ipv6_exit_policy = parse_short_policy(tok->args[0]);
  4894. }
  4895. smartlist_add(result, md);
  4896. okay = 1;
  4897. md = NULL;
  4898. next:
  4899. if (! okay && invalid_digests_out) {
  4900. smartlist_add(invalid_digests_out,
  4901. tor_memdup(md->digest, DIGEST256_LEN));
  4902. }
  4903. microdesc_free(md);
  4904. md = NULL;
  4905. SMARTLIST_FOREACH(tokens, directory_token_t *, t, token_clear(t));
  4906. memarea_clear(area);
  4907. smartlist_clear(tokens);
  4908. s = start_of_next_microdesc;
  4909. }
  4910. SMARTLIST_FOREACH(tokens, directory_token_t *, t, token_clear(t));
  4911. memarea_drop_all(area);
  4912. smartlist_free(tokens);
  4913. return result;
  4914. }
  4915. /** Parse the Tor version of the platform string <b>platform</b>,
  4916. * and compare it to the version in <b>cutoff</b>. Return 1 if
  4917. * the router is at least as new as the cutoff, else return 0.
  4918. */
  4919. int
  4920. tor_version_as_new_as(const char *platform, const char *cutoff)
  4921. {
  4922. tor_version_t cutoff_version, router_version;
  4923. char *s, *s2, *start;
  4924. char tmp[128];
  4925. tor_assert(platform);
  4926. if (tor_version_parse(cutoff, &cutoff_version)<0) {
  4927. log_warn(LD_BUG,"cutoff version '%s' unparseable.",cutoff);
  4928. return 0;
  4929. }
  4930. if (strcmpstart(platform,"Tor ")) /* nonstandard Tor; be safe and say yes */
  4931. return 1;
  4932. start = (char *)eat_whitespace(platform+3);
  4933. if (!*start) return 0;
  4934. s = (char *)find_whitespace(start); /* also finds '\0', which is fine */
  4935. s2 = (char*)eat_whitespace(s);
  4936. if (!strcmpstart(s2, "(r") || !strcmpstart(s2, "(git-"))
  4937. s = (char*)find_whitespace(s2);
  4938. if ((size_t)(s-start+1) >= sizeof(tmp)) /* too big, no */
  4939. return 0;
  4940. strlcpy(tmp, start, s-start+1);
  4941. if (tor_version_parse(tmp, &router_version)<0) {
  4942. log_info(LD_DIR,"Router version '%s' unparseable.",tmp);
  4943. return 1; /* be safe and say yes */
  4944. }
  4945. /* Here's why we don't need to do any special handling for svn revisions:
  4946. * - If neither has an svn revision, we're fine.
  4947. * - If the router doesn't have an svn revision, we can't assume that it
  4948. * is "at least" any svn revision, so we need to return 0.
  4949. * - If the target version doesn't have an svn revision, any svn revision
  4950. * (or none at all) is good enough, so return 1.
  4951. * - If both target and router have an svn revision, we compare them.
  4952. */
  4953. return tor_version_compare(&router_version, &cutoff_version) >= 0;
  4954. }
  4955. /** Parse a tor version from <b>s</b>, and store the result in <b>out</b>.
  4956. * Return 0 on success, -1 on failure. */
  4957. int
  4958. tor_version_parse(const char *s, tor_version_t *out)
  4959. {
  4960. char *eos=NULL;
  4961. const char *cp=NULL;
  4962. /* Format is:
  4963. * "Tor " ? NUM dot NUM [ dot NUM [ ( pre | rc | dot ) NUM ] ] [ - tag ]
  4964. */
  4965. tor_assert(s);
  4966. tor_assert(out);
  4967. memset(out, 0, sizeof(tor_version_t));
  4968. out->status = VER_RELEASE;
  4969. if (!strcasecmpstart(s, "Tor "))
  4970. s += 4;
  4971. cp = s;
  4972. #define NUMBER(m) \
  4973. do { \
  4974. out->m = (int)strtol(cp, &eos, 10); \
  4975. if (!eos || eos == cp) \
  4976. return -1; \
  4977. cp = eos; \
  4978. } while (0)
  4979. #define DOT() \
  4980. do { \
  4981. if (*cp != '.') \
  4982. return -1; \
  4983. ++cp; \
  4984. } while (0)
  4985. NUMBER(major);
  4986. DOT();
  4987. NUMBER(minor);
  4988. if (*cp == 0)
  4989. return 0;
  4990. else if (*cp == '-')
  4991. goto status_tag;
  4992. DOT();
  4993. NUMBER(micro);
  4994. /* Get status */
  4995. if (*cp == 0) {
  4996. return 0;
  4997. } else if (*cp == '.') {
  4998. ++cp;
  4999. } else if (*cp == '-') {
  5000. goto status_tag;
  5001. } else if (0==strncmp(cp, "pre", 3)) {
  5002. out->status = VER_PRE;
  5003. cp += 3;
  5004. } else if (0==strncmp(cp, "rc", 2)) {
  5005. out->status = VER_RC;
  5006. cp += 2;
  5007. } else {
  5008. return -1;
  5009. }
  5010. NUMBER(patchlevel);
  5011. status_tag:
  5012. /* Get status tag. */
  5013. if (*cp == '-' || *cp == '.')
  5014. ++cp;
  5015. eos = (char*) find_whitespace(cp);
  5016. if (eos-cp >= (int)sizeof(out->status_tag))
  5017. strlcpy(out->status_tag, cp, sizeof(out->status_tag));
  5018. else {
  5019. memcpy(out->status_tag, cp, eos-cp);
  5020. out->status_tag[eos-cp] = 0;
  5021. }
  5022. cp = eat_whitespace(eos);
  5023. if (!strcmpstart(cp, "(r")) {
  5024. cp += 2;
  5025. out->svn_revision = (int) strtol(cp,&eos,10);
  5026. } else if (!strcmpstart(cp, "(git-")) {
  5027. char *close_paren = strchr(cp, ')');
  5028. int hexlen;
  5029. char digest[DIGEST_LEN];
  5030. if (! close_paren)
  5031. return -1;
  5032. cp += 5;
  5033. if (close_paren-cp > HEX_DIGEST_LEN)
  5034. return -1;
  5035. hexlen = (int)(close_paren-cp);
  5036. memwipe(digest, 0, sizeof(digest));
  5037. if ( hexlen == 0 || (hexlen % 2) == 1)
  5038. return -1;
  5039. if (base16_decode(digest, hexlen/2, cp, hexlen) != hexlen/2)
  5040. return -1;
  5041. memcpy(out->git_tag, digest, hexlen/2);
  5042. out->git_tag_len = hexlen/2;
  5043. }
  5044. return 0;
  5045. #undef NUMBER
  5046. #undef DOT
  5047. }
  5048. /** Compare two tor versions; Return <0 if a < b; 0 if a ==b, >0 if a >
  5049. * b. */
  5050. int
  5051. tor_version_compare(tor_version_t *a, tor_version_t *b)
  5052. {
  5053. int i;
  5054. tor_assert(a);
  5055. tor_assert(b);
  5056. if ((i = a->major - b->major))
  5057. return i;
  5058. else if ((i = a->minor - b->minor))
  5059. return i;
  5060. else if ((i = a->micro - b->micro))
  5061. return i;
  5062. else if ((i = a->status - b->status))
  5063. return i;
  5064. else if ((i = a->patchlevel - b->patchlevel))
  5065. return i;
  5066. else if ((i = strcmp(a->status_tag, b->status_tag)))
  5067. return i;
  5068. else if ((i = a->svn_revision - b->svn_revision))
  5069. return i;
  5070. else if ((i = a->git_tag_len - b->git_tag_len))
  5071. return i;
  5072. else if (a->git_tag_len)
  5073. return fast_memcmp(a->git_tag, b->git_tag, a->git_tag_len);
  5074. else
  5075. return 0;
  5076. }
  5077. /** Return true iff versions <b>a</b> and <b>b</b> belong to the same series.
  5078. */
  5079. int
  5080. tor_version_same_series(tor_version_t *a, tor_version_t *b)
  5081. {
  5082. tor_assert(a);
  5083. tor_assert(b);
  5084. return ((a->major == b->major) &&
  5085. (a->minor == b->minor) &&
  5086. (a->micro == b->micro));
  5087. }
  5088. /** Helper: Given pointers to two strings describing tor versions, return -1
  5089. * if _a precedes _b, 1 if _b precedes _a, and 0 if they are equivalent.
  5090. * Used to sort a list of versions. */
  5091. static int
  5092. compare_tor_version_str_ptr_(const void **_a, const void **_b)
  5093. {
  5094. const char *a = *_a, *b = *_b;
  5095. int ca, cb;
  5096. tor_version_t va, vb;
  5097. ca = tor_version_parse(a, &va);
  5098. cb = tor_version_parse(b, &vb);
  5099. /* If they both parse, compare them. */
  5100. if (!ca && !cb)
  5101. return tor_version_compare(&va,&vb);
  5102. /* If one parses, it comes first. */
  5103. if (!ca && cb)
  5104. return -1;
  5105. if (ca && !cb)
  5106. return 1;
  5107. /* If neither parses, compare strings. Also, the directory server admin
  5108. ** needs to be smacked upside the head. But Tor is tolerant and gentle. */
  5109. return strcmp(a,b);
  5110. }
  5111. /** Sort a list of string-representations of versions in ascending order. */
  5112. void
  5113. sort_version_list(smartlist_t *versions, int remove_duplicates)
  5114. {
  5115. smartlist_sort(versions, compare_tor_version_str_ptr_);
  5116. if (remove_duplicates)
  5117. smartlist_uniq(versions, compare_tor_version_str_ptr_, tor_free_);
  5118. }
  5119. /** Parse and validate the ASCII-encoded v2 descriptor in <b>desc</b>,
  5120. * write the parsed descriptor to the newly allocated *<b>parsed_out</b>, the
  5121. * binary descriptor ID of length DIGEST_LEN to <b>desc_id_out</b>, the
  5122. * encrypted introduction points to the newly allocated
  5123. * *<b>intro_points_encrypted_out</b>, their encrypted size to
  5124. * *<b>intro_points_encrypted_size_out</b>, the size of the encoded descriptor
  5125. * to *<b>encoded_size_out</b>, and a pointer to the possibly next
  5126. * descriptor to *<b>next_out</b>; return 0 for success (including validation)
  5127. * and -1 for failure.
  5128. *
  5129. * If <b>as_hsdir</b> is 1, we're parsing this as an HSDir, and we should
  5130. * be strict about time formats.
  5131. */
  5132. int
  5133. rend_parse_v2_service_descriptor(rend_service_descriptor_t **parsed_out,
  5134. char *desc_id_out,
  5135. char **intro_points_encrypted_out,
  5136. size_t *intro_points_encrypted_size_out,
  5137. size_t *encoded_size_out,
  5138. const char **next_out, const char *desc,
  5139. int as_hsdir)
  5140. {
  5141. rend_service_descriptor_t *result =
  5142. tor_malloc_zero(sizeof(rend_service_descriptor_t));
  5143. char desc_hash[DIGEST_LEN];
  5144. const char *eos;
  5145. smartlist_t *tokens = smartlist_new();
  5146. directory_token_t *tok;
  5147. char secret_id_part[DIGEST_LEN];
  5148. int i, version, num_ok=1;
  5149. smartlist_t *versions;
  5150. char public_key_hash[DIGEST_LEN];
  5151. char test_desc_id[DIGEST_LEN];
  5152. memarea_t *area = NULL;
  5153. const int strict_time_fmt = as_hsdir;
  5154. tor_assert(desc);
  5155. /* Check if desc starts correctly. */
  5156. if (strncmp(desc, "rendezvous-service-descriptor ",
  5157. strlen("rendezvous-service-descriptor "))) {
  5158. log_info(LD_REND, "Descriptor does not start correctly.");
  5159. goto err;
  5160. }
  5161. /* Compute descriptor hash for later validation. */
  5162. if (router_get_hash_impl(desc, strlen(desc), desc_hash,
  5163. "rendezvous-service-descriptor ",
  5164. "\nsignature", '\n', DIGEST_SHA1) < 0) {
  5165. log_warn(LD_REND, "Couldn't compute descriptor hash.");
  5166. goto err;
  5167. }
  5168. /* Determine end of string. */
  5169. eos = strstr(desc, "\nrendezvous-service-descriptor ");
  5170. if (!eos)
  5171. eos = desc + strlen(desc);
  5172. else
  5173. eos = eos + 1;
  5174. /* Check length. */
  5175. if (eos-desc > REND_DESC_MAX_SIZE) {
  5176. /* XXXX+ If we are parsing this descriptor as a server, this
  5177. * should be a protocol warning. */
  5178. log_warn(LD_REND, "Descriptor length is %d which exceeds "
  5179. "maximum rendezvous descriptor size of %d bytes.",
  5180. (int)(eos-desc), REND_DESC_MAX_SIZE);
  5181. goto err;
  5182. }
  5183. /* Tokenize descriptor. */
  5184. area = memarea_new();
  5185. if (tokenize_string(area, desc, eos, tokens, desc_token_table, 0)) {
  5186. log_warn(LD_REND, "Error tokenizing descriptor.");
  5187. goto err;
  5188. }
  5189. /* Set next to next descriptor, if available. */
  5190. *next_out = eos;
  5191. /* Set length of encoded descriptor. */
  5192. *encoded_size_out = eos - desc;
  5193. /* Check min allowed length of token list. */
  5194. if (smartlist_len(tokens) < 7) {
  5195. log_warn(LD_REND, "Impossibly short descriptor.");
  5196. goto err;
  5197. }
  5198. /* Parse base32-encoded descriptor ID. */
  5199. tok = find_by_keyword(tokens, R_RENDEZVOUS_SERVICE_DESCRIPTOR);
  5200. tor_assert(tok == smartlist_get(tokens, 0));
  5201. tor_assert(tok->n_args == 1);
  5202. if (!rend_valid_descriptor_id(tok->args[0])) {
  5203. log_warn(LD_REND, "Invalid descriptor ID: '%s'", tok->args[0]);
  5204. goto err;
  5205. }
  5206. if (base32_decode(desc_id_out, DIGEST_LEN,
  5207. tok->args[0], REND_DESC_ID_V2_LEN_BASE32) < 0) {
  5208. log_warn(LD_REND, "Descriptor ID contains illegal characters: %s",
  5209. tok->args[0]);
  5210. goto err;
  5211. }
  5212. /* Parse descriptor version. */
  5213. tok = find_by_keyword(tokens, R_VERSION);
  5214. tor_assert(tok->n_args == 1);
  5215. result->version =
  5216. (int) tor_parse_long(tok->args[0], 10, 0, INT_MAX, &num_ok, NULL);
  5217. if (result->version != 2 || !num_ok) {
  5218. /* If it's <2, it shouldn't be under this format. If the number
  5219. * is greater than 2, we bumped it because we broke backward
  5220. * compatibility. See how version numbers in our other formats
  5221. * work. */
  5222. log_warn(LD_REND, "Unrecognized descriptor version: %s",
  5223. escaped(tok->args[0]));
  5224. goto err;
  5225. }
  5226. /* Parse public key. */
  5227. tok = find_by_keyword(tokens, R_PERMANENT_KEY);
  5228. result->pk = tok->key;
  5229. tok->key = NULL; /* Prevent free */
  5230. /* Parse secret ID part. */
  5231. tok = find_by_keyword(tokens, R_SECRET_ID_PART);
  5232. tor_assert(tok->n_args == 1);
  5233. if (strlen(tok->args[0]) != REND_SECRET_ID_PART_LEN_BASE32 ||
  5234. strspn(tok->args[0], BASE32_CHARS) != REND_SECRET_ID_PART_LEN_BASE32) {
  5235. log_warn(LD_REND, "Invalid secret ID part: '%s'", tok->args[0]);
  5236. goto err;
  5237. }
  5238. if (base32_decode(secret_id_part, DIGEST_LEN, tok->args[0], 32) < 0) {
  5239. log_warn(LD_REND, "Secret ID part contains illegal characters: %s",
  5240. tok->args[0]);
  5241. goto err;
  5242. }
  5243. /* Parse publication time -- up-to-date check is done when storing the
  5244. * descriptor. */
  5245. tok = find_by_keyword(tokens, R_PUBLICATION_TIME);
  5246. tor_assert(tok->n_args == 1);
  5247. if (parse_iso_time_(tok->args[0], &result->timestamp, strict_time_fmt) < 0) {
  5248. log_warn(LD_REND, "Invalid publication time: '%s'", tok->args[0]);
  5249. goto err;
  5250. }
  5251. /* Parse protocol versions. */
  5252. tok = find_by_keyword(tokens, R_PROTOCOL_VERSIONS);
  5253. tor_assert(tok->n_args == 1);
  5254. versions = smartlist_new();
  5255. smartlist_split_string(versions, tok->args[0], ",",
  5256. SPLIT_SKIP_SPACE|SPLIT_IGNORE_BLANK, 0);
  5257. for (i = 0; i < smartlist_len(versions); i++) {
  5258. version = (int) tor_parse_long(smartlist_get(versions, i),
  5259. 10, 0, INT_MAX, &num_ok, NULL);
  5260. if (!num_ok) /* It's a string; let's ignore it. */
  5261. continue;
  5262. if (version >= REND_PROTOCOL_VERSION_BITMASK_WIDTH)
  5263. /* Avoid undefined left-shift behaviour. */
  5264. continue;
  5265. result->protocols |= 1 << version;
  5266. }
  5267. SMARTLIST_FOREACH(versions, char *, cp, tor_free(cp));
  5268. smartlist_free(versions);
  5269. /* Parse encrypted introduction points. Don't verify. */
  5270. tok = find_opt_by_keyword(tokens, R_INTRODUCTION_POINTS);
  5271. if (tok) {
  5272. if (strcmp(tok->object_type, "MESSAGE")) {
  5273. log_warn(LD_DIR, "Bad object type: introduction points should be of "
  5274. "type MESSAGE");
  5275. goto err;
  5276. }
  5277. *intro_points_encrypted_out = tor_memdup(tok->object_body,
  5278. tok->object_size);
  5279. *intro_points_encrypted_size_out = tok->object_size;
  5280. } else {
  5281. *intro_points_encrypted_out = NULL;
  5282. *intro_points_encrypted_size_out = 0;
  5283. }
  5284. /* Parse and verify signature. */
  5285. tok = find_by_keyword(tokens, R_SIGNATURE);
  5286. note_crypto_pk_op(VERIFY_RTR);
  5287. if (check_signature_token(desc_hash, DIGEST_LEN, tok, result->pk, 0,
  5288. "v2 rendezvous service descriptor") < 0)
  5289. goto err;
  5290. /* Verify that descriptor ID belongs to public key and secret ID part. */
  5291. crypto_pk_get_digest(result->pk, public_key_hash);
  5292. rend_get_descriptor_id_bytes(test_desc_id, public_key_hash,
  5293. secret_id_part);
  5294. if (tor_memneq(desc_id_out, test_desc_id, DIGEST_LEN)) {
  5295. log_warn(LD_REND, "Parsed descriptor ID does not match "
  5296. "computed descriptor ID.");
  5297. goto err;
  5298. }
  5299. goto done;
  5300. err:
  5301. rend_service_descriptor_free(result);
  5302. result = NULL;
  5303. done:
  5304. if (tokens) {
  5305. SMARTLIST_FOREACH(tokens, directory_token_t *, t, token_clear(t));
  5306. smartlist_free(tokens);
  5307. }
  5308. if (area)
  5309. memarea_drop_all(area);
  5310. *parsed_out = result;
  5311. if (result)
  5312. return 0;
  5313. return -1;
  5314. }
  5315. /** Decrypt the encrypted introduction points in <b>ipos_encrypted</b> of
  5316. * length <b>ipos_encrypted_size</b> using <b>descriptor_cookie</b> and
  5317. * write the result to a newly allocated string that is pointed to by
  5318. * <b>ipos_decrypted</b> and its length to <b>ipos_decrypted_size</b>.
  5319. * Return 0 if decryption was successful and -1 otherwise. */
  5320. int
  5321. rend_decrypt_introduction_points(char **ipos_decrypted,
  5322. size_t *ipos_decrypted_size,
  5323. const char *descriptor_cookie,
  5324. const char *ipos_encrypted,
  5325. size_t ipos_encrypted_size)
  5326. {
  5327. tor_assert(ipos_encrypted);
  5328. tor_assert(descriptor_cookie);
  5329. if (ipos_encrypted_size < 2) {
  5330. log_warn(LD_REND, "Size of encrypted introduction points is too "
  5331. "small.");
  5332. return -1;
  5333. }
  5334. if (ipos_encrypted[0] == (int)REND_BASIC_AUTH) {
  5335. char iv[CIPHER_IV_LEN], client_id[REND_BASIC_AUTH_CLIENT_ID_LEN],
  5336. session_key[CIPHER_KEY_LEN], *dec;
  5337. int declen, client_blocks;
  5338. size_t pos = 0, len, client_entries_len;
  5339. crypto_digest_t *digest;
  5340. crypto_cipher_t *cipher;
  5341. client_blocks = (int) ipos_encrypted[1];
  5342. client_entries_len = client_blocks * REND_BASIC_AUTH_CLIENT_MULTIPLE *
  5343. REND_BASIC_AUTH_CLIENT_ENTRY_LEN;
  5344. if (ipos_encrypted_size < 2 + client_entries_len + CIPHER_IV_LEN + 1) {
  5345. log_warn(LD_REND, "Size of encrypted introduction points is too "
  5346. "small.");
  5347. return -1;
  5348. }
  5349. memcpy(iv, ipos_encrypted + 2 + client_entries_len, CIPHER_IV_LEN);
  5350. digest = crypto_digest_new();
  5351. crypto_digest_add_bytes(digest, descriptor_cookie, REND_DESC_COOKIE_LEN);
  5352. crypto_digest_add_bytes(digest, iv, CIPHER_IV_LEN);
  5353. crypto_digest_get_digest(digest, client_id,
  5354. REND_BASIC_AUTH_CLIENT_ID_LEN);
  5355. crypto_digest_free(digest);
  5356. for (pos = 2; pos < 2 + client_entries_len;
  5357. pos += REND_BASIC_AUTH_CLIENT_ENTRY_LEN) {
  5358. if (tor_memeq(ipos_encrypted + pos, client_id,
  5359. REND_BASIC_AUTH_CLIENT_ID_LEN)) {
  5360. /* Attempt to decrypt introduction points. */
  5361. cipher = crypto_cipher_new(descriptor_cookie);
  5362. if (crypto_cipher_decrypt(cipher, session_key, ipos_encrypted
  5363. + pos + REND_BASIC_AUTH_CLIENT_ID_LEN,
  5364. CIPHER_KEY_LEN) < 0) {
  5365. log_warn(LD_REND, "Could not decrypt session key for client.");
  5366. crypto_cipher_free(cipher);
  5367. return -1;
  5368. }
  5369. crypto_cipher_free(cipher);
  5370. len = ipos_encrypted_size - 2 - client_entries_len - CIPHER_IV_LEN;
  5371. dec = tor_malloc(len);
  5372. declen = crypto_cipher_decrypt_with_iv(session_key, dec, len,
  5373. ipos_encrypted + 2 + client_entries_len,
  5374. ipos_encrypted_size - 2 - client_entries_len);
  5375. if (declen < 0) {
  5376. log_warn(LD_REND, "Could not decrypt introduction point string.");
  5377. tor_free(dec);
  5378. return -1;
  5379. }
  5380. if (fast_memcmpstart(dec, declen, "introduction-point ")) {
  5381. log_warn(LD_REND, "Decrypted introduction points don't "
  5382. "look like we could parse them.");
  5383. tor_free(dec);
  5384. continue;
  5385. }
  5386. *ipos_decrypted = dec;
  5387. *ipos_decrypted_size = declen;
  5388. return 0;
  5389. }
  5390. }
  5391. log_warn(LD_REND, "Could not decrypt introduction points. Please "
  5392. "check your authorization for this service!");
  5393. return -1;
  5394. } else if (ipos_encrypted[0] == (int)REND_STEALTH_AUTH) {
  5395. char *dec;
  5396. int declen;
  5397. if (ipos_encrypted_size < CIPHER_IV_LEN + 2) {
  5398. log_warn(LD_REND, "Size of encrypted introduction points is too "
  5399. "small.");
  5400. return -1;
  5401. }
  5402. dec = tor_malloc_zero(ipos_encrypted_size - CIPHER_IV_LEN - 1);
  5403. declen = crypto_cipher_decrypt_with_iv(descriptor_cookie, dec,
  5404. ipos_encrypted_size -
  5405. CIPHER_IV_LEN - 1,
  5406. ipos_encrypted + 1,
  5407. ipos_encrypted_size - 1);
  5408. if (declen < 0) {
  5409. log_warn(LD_REND, "Decrypting introduction points failed!");
  5410. tor_free(dec);
  5411. return -1;
  5412. }
  5413. *ipos_decrypted = dec;
  5414. *ipos_decrypted_size = declen;
  5415. return 0;
  5416. } else {
  5417. log_warn(LD_REND, "Unknown authorization type number: %d",
  5418. ipos_encrypted[0]);
  5419. return -1;
  5420. }
  5421. }
  5422. /** Parse the encoded introduction points in <b>intro_points_encoded</b> of
  5423. * length <b>intro_points_encoded_size</b> and write the result to the
  5424. * descriptor in <b>parsed</b>; return the number of successfully parsed
  5425. * introduction points or -1 in case of a failure. */
  5426. int
  5427. rend_parse_introduction_points(rend_service_descriptor_t *parsed,
  5428. const char *intro_points_encoded,
  5429. size_t intro_points_encoded_size)
  5430. {
  5431. const char *current_ipo, *end_of_intro_points;
  5432. smartlist_t *tokens = NULL;
  5433. directory_token_t *tok;
  5434. rend_intro_point_t *intro;
  5435. extend_info_t *info;
  5436. int result, num_ok=1;
  5437. memarea_t *area = NULL;
  5438. tor_assert(parsed);
  5439. /** Function may only be invoked once. */
  5440. tor_assert(!parsed->intro_nodes);
  5441. if (!intro_points_encoded || intro_points_encoded_size == 0) {
  5442. log_warn(LD_REND, "Empty or zero size introduction point list");
  5443. goto err;
  5444. }
  5445. /* Consider one intro point after the other. */
  5446. current_ipo = intro_points_encoded;
  5447. end_of_intro_points = intro_points_encoded + intro_points_encoded_size;
  5448. tokens = smartlist_new();
  5449. parsed->intro_nodes = smartlist_new();
  5450. area = memarea_new();
  5451. while (!fast_memcmpstart(current_ipo, end_of_intro_points-current_ipo,
  5452. "introduction-point ")) {
  5453. /* Determine end of string. */
  5454. const char *eos = tor_memstr(current_ipo, end_of_intro_points-current_ipo,
  5455. "\nintroduction-point ");
  5456. if (!eos)
  5457. eos = end_of_intro_points;
  5458. else
  5459. eos = eos+1;
  5460. tor_assert(eos <= intro_points_encoded+intro_points_encoded_size);
  5461. /* Free tokens and clear token list. */
  5462. SMARTLIST_FOREACH(tokens, directory_token_t *, t, token_clear(t));
  5463. smartlist_clear(tokens);
  5464. memarea_clear(area);
  5465. /* Tokenize string. */
  5466. if (tokenize_string(area, current_ipo, eos, tokens, ipo_token_table, 0)) {
  5467. log_warn(LD_REND, "Error tokenizing introduction point");
  5468. goto err;
  5469. }
  5470. /* Advance to next introduction point, if available. */
  5471. current_ipo = eos;
  5472. /* Check minimum allowed length of introduction point. */
  5473. if (smartlist_len(tokens) < 5) {
  5474. log_warn(LD_REND, "Impossibly short introduction point.");
  5475. goto err;
  5476. }
  5477. /* Allocate new intro point and extend info. */
  5478. intro = tor_malloc_zero(sizeof(rend_intro_point_t));
  5479. info = intro->extend_info = tor_malloc_zero(sizeof(extend_info_t));
  5480. /* Parse identifier. */
  5481. tok = find_by_keyword(tokens, R_IPO_IDENTIFIER);
  5482. if (base32_decode(info->identity_digest, DIGEST_LEN,
  5483. tok->args[0], REND_INTRO_POINT_ID_LEN_BASE32) < 0) {
  5484. log_warn(LD_REND, "Identity digest contains illegal characters: %s",
  5485. tok->args[0]);
  5486. rend_intro_point_free(intro);
  5487. goto err;
  5488. }
  5489. /* Write identifier to nickname. */
  5490. info->nickname[0] = '$';
  5491. base16_encode(info->nickname + 1, sizeof(info->nickname) - 1,
  5492. info->identity_digest, DIGEST_LEN);
  5493. /* Parse IP address. */
  5494. tok = find_by_keyword(tokens, R_IPO_IP_ADDRESS);
  5495. if (tor_addr_parse(&info->addr, tok->args[0])<0) {
  5496. log_warn(LD_REND, "Could not parse introduction point address.");
  5497. rend_intro_point_free(intro);
  5498. goto err;
  5499. }
  5500. if (tor_addr_family(&info->addr) != AF_INET) {
  5501. log_warn(LD_REND, "Introduction point address was not ipv4.");
  5502. rend_intro_point_free(intro);
  5503. goto err;
  5504. }
  5505. /* Parse onion port. */
  5506. tok = find_by_keyword(tokens, R_IPO_ONION_PORT);
  5507. info->port = (uint16_t) tor_parse_long(tok->args[0],10,1,65535,
  5508. &num_ok,NULL);
  5509. if (!info->port || !num_ok) {
  5510. log_warn(LD_REND, "Introduction point onion port %s is invalid",
  5511. escaped(tok->args[0]));
  5512. rend_intro_point_free(intro);
  5513. goto err;
  5514. }
  5515. /* Parse onion key. */
  5516. tok = find_by_keyword(tokens, R_IPO_ONION_KEY);
  5517. if (!crypto_pk_public_exponent_ok(tok->key)) {
  5518. log_warn(LD_REND,
  5519. "Introduction point's onion key had invalid exponent.");
  5520. rend_intro_point_free(intro);
  5521. goto err;
  5522. }
  5523. info->onion_key = tok->key;
  5524. tok->key = NULL; /* Prevent free */
  5525. /* Parse service key. */
  5526. tok = find_by_keyword(tokens, R_IPO_SERVICE_KEY);
  5527. if (!crypto_pk_public_exponent_ok(tok->key)) {
  5528. log_warn(LD_REND,
  5529. "Introduction point key had invalid exponent.");
  5530. rend_intro_point_free(intro);
  5531. goto err;
  5532. }
  5533. intro->intro_key = tok->key;
  5534. tok->key = NULL; /* Prevent free */
  5535. /* Add extend info to list of introduction points. */
  5536. smartlist_add(parsed->intro_nodes, intro);
  5537. }
  5538. result = smartlist_len(parsed->intro_nodes);
  5539. goto done;
  5540. err:
  5541. result = -1;
  5542. done:
  5543. /* Free tokens and clear token list. */
  5544. if (tokens) {
  5545. SMARTLIST_FOREACH(tokens, directory_token_t *, t, token_clear(t));
  5546. smartlist_free(tokens);
  5547. }
  5548. if (area)
  5549. memarea_drop_all(area);
  5550. return result;
  5551. }
  5552. /** Parse the content of a client_key file in <b>ckstr</b> and add
  5553. * rend_authorized_client_t's for each parsed client to
  5554. * <b>parsed_clients</b>. Return the number of parsed clients as result
  5555. * or -1 for failure. */
  5556. int
  5557. rend_parse_client_keys(strmap_t *parsed_clients, const char *ckstr)
  5558. {
  5559. int result = -1;
  5560. smartlist_t *tokens;
  5561. directory_token_t *tok;
  5562. const char *current_entry = NULL;
  5563. memarea_t *area = NULL;
  5564. char *err_msg = NULL;
  5565. if (!ckstr || strlen(ckstr) == 0)
  5566. return -1;
  5567. tokens = smartlist_new();
  5568. /* Begin parsing with first entry, skipping comments or whitespace at the
  5569. * beginning. */
  5570. area = memarea_new();
  5571. current_entry = eat_whitespace(ckstr);
  5572. while (!strcmpstart(current_entry, "client-name ")) {
  5573. rend_authorized_client_t *parsed_entry;
  5574. /* Determine end of string. */
  5575. const char *eos = strstr(current_entry, "\nclient-name ");
  5576. if (!eos)
  5577. eos = current_entry + strlen(current_entry);
  5578. else
  5579. eos = eos + 1;
  5580. /* Free tokens and clear token list. */
  5581. SMARTLIST_FOREACH(tokens, directory_token_t *, t, token_clear(t));
  5582. smartlist_clear(tokens);
  5583. memarea_clear(area);
  5584. /* Tokenize string. */
  5585. if (tokenize_string(area, current_entry, eos, tokens,
  5586. client_keys_token_table, 0)) {
  5587. log_warn(LD_REND, "Error tokenizing client keys file.");
  5588. goto err;
  5589. }
  5590. /* Advance to next entry, if available. */
  5591. current_entry = eos;
  5592. /* Check minimum allowed length of token list. */
  5593. if (smartlist_len(tokens) < 2) {
  5594. log_warn(LD_REND, "Impossibly short client key entry.");
  5595. goto err;
  5596. }
  5597. /* Parse client name. */
  5598. tok = find_by_keyword(tokens, C_CLIENT_NAME);
  5599. tor_assert(tok == smartlist_get(tokens, 0));
  5600. tor_assert(tok->n_args == 1);
  5601. if (!rend_valid_client_name(tok->args[0])) {
  5602. log_warn(LD_CONFIG, "Illegal client name: %s. (Length must be "
  5603. "between 1 and %d, and valid characters are "
  5604. "[A-Za-z0-9+-_].)", tok->args[0], REND_CLIENTNAME_MAX_LEN);
  5605. goto err;
  5606. }
  5607. /* Check if client name is duplicate. */
  5608. if (strmap_get(parsed_clients, tok->args[0])) {
  5609. log_warn(LD_CONFIG, "HiddenServiceAuthorizeClient contains a "
  5610. "duplicate client name: '%s'. Ignoring.", tok->args[0]);
  5611. goto err;
  5612. }
  5613. parsed_entry = tor_malloc_zero(sizeof(rend_authorized_client_t));
  5614. parsed_entry->client_name = tor_strdup(tok->args[0]);
  5615. strmap_set(parsed_clients, parsed_entry->client_name, parsed_entry);
  5616. /* Parse client key. */
  5617. tok = find_opt_by_keyword(tokens, C_CLIENT_KEY);
  5618. if (tok) {
  5619. parsed_entry->client_key = tok->key;
  5620. tok->key = NULL; /* Prevent free */
  5621. }
  5622. /* Parse descriptor cookie. */
  5623. tok = find_by_keyword(tokens, C_DESCRIPTOR_COOKIE);
  5624. tor_assert(tok->n_args == 1);
  5625. if (rend_auth_decode_cookie(tok->args[0], parsed_entry->descriptor_cookie,
  5626. NULL, &err_msg) < 0) {
  5627. tor_assert(err_msg);
  5628. log_warn(LD_REND, "%s", err_msg);
  5629. tor_free(err_msg);
  5630. goto err;
  5631. }
  5632. }
  5633. result = strmap_size(parsed_clients);
  5634. goto done;
  5635. err:
  5636. result = -1;
  5637. done:
  5638. /* Free tokens and clear token list. */
  5639. SMARTLIST_FOREACH(tokens, directory_token_t *, t, token_clear(t));
  5640. smartlist_free(tokens);
  5641. if (area)
  5642. memarea_drop_all(area);
  5643. return result;
  5644. }
  5645. /** Called on startup; right now we just handle scanning the unparseable
  5646. * descriptor dumps, but hang anything else we might need to do in the
  5647. * future here as well.
  5648. */
  5649. void
  5650. routerparse_init(void)
  5651. {
  5652. /*
  5653. * Check both if the sandbox is active and whether it's configured; no
  5654. * point in loading all that if we won't be able to use it after the
  5655. * sandbox becomes active.
  5656. */
  5657. if (!(sandbox_is_active() || get_options()->Sandbox)) {
  5658. dump_desc_init();
  5659. }
  5660. }
  5661. /** Clean up all data structures used by routerparse.c at exit */
  5662. void
  5663. routerparse_free_all(void)
  5664. {
  5665. dump_desc_fifo_cleanup();
  5666. }