routerlist.c 172 KB

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