routerlist.c 177 KB

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