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