routerlist.c 171 KB

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