routerlist.c 179 KB

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