routerlist.c 171 KB

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