routerparse.c 194 KB

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