2018-09-20 14:09:35 +02:00
|
|
|
/* Copyright (c) 2001-2004, Roger Dingledine.
|
|
|
|
* Copyright (c) 2004-2006, Roger Dingledine, Nick Mathewson.
|
2019-01-16 18:33:22 +01:00
|
|
|
* Copyright (c) 2007-2019, The Tor Project, Inc. */
|
2018-09-20 14:09:35 +02:00
|
|
|
/* See LICENSE for licensing information */
|
|
|
|
|
|
|
|
/**
|
|
|
|
* \file voteflags.c
|
|
|
|
* \brief Authority code for deciding the performance thresholds for flags,
|
|
|
|
* and assigning flags to routers.
|
|
|
|
**/
|
|
|
|
|
|
|
|
#define VOTEFLAGS_PRIVATE
|
|
|
|
#include "core/or/or.h"
|
|
|
|
#include "feature/dirauth/voteflags.h"
|
|
|
|
|
|
|
|
#include "app/config/config.h"
|
2018-09-20 21:19:43 +02:00
|
|
|
#include "core/mainloop/mainloop.h"
|
2018-09-20 14:09:35 +02:00
|
|
|
#include "core/or/policies.h"
|
|
|
|
#include "feature/dirauth/bwauth.h"
|
|
|
|
#include "feature/dirauth/reachability.h"
|
2019-12-19 14:50:19 +01:00
|
|
|
#include "feature/dirauth/dirauth_sys.h"
|
2018-09-20 14:09:35 +02:00
|
|
|
#include "feature/hibernate/hibernate.h"
|
|
|
|
#include "feature/nodelist/dirlist.h"
|
|
|
|
#include "feature/nodelist/networkstatus.h"
|
|
|
|
#include "feature/nodelist/nodelist.h"
|
|
|
|
#include "feature/nodelist/routerlist.h"
|
|
|
|
#include "feature/nodelist/routerset.h"
|
|
|
|
#include "feature/relay/router.h"
|
|
|
|
#include "feature/stats/rephist.h"
|
|
|
|
|
2019-12-19 14:50:19 +01:00
|
|
|
#include "feature/dirauth/dirauth_options_st.h"
|
2018-09-20 14:09:35 +02:00
|
|
|
#include "feature/nodelist/node_st.h"
|
|
|
|
#include "feature/nodelist/routerinfo_st.h"
|
2019-04-12 02:44:30 +02:00
|
|
|
#include "feature/nodelist/routerlist_st.h"
|
2018-09-20 14:09:35 +02:00
|
|
|
#include "feature/nodelist/vote_routerstatus_st.h"
|
|
|
|
|
|
|
|
#include "lib/container/order.h"
|
|
|
|
|
|
|
|
/** If a router's uptime is at least this value, then it is always
|
|
|
|
* considered stable, regardless of the rest of the network. This
|
|
|
|
* way we resist attacks where an attacker doubles the size of the
|
|
|
|
* network using allegedly high-uptime nodes, displacing all the
|
|
|
|
* current guards. */
|
|
|
|
#define UPTIME_TO_GUARANTEE_STABLE (3600*24*30)
|
|
|
|
/** If a router's MTBF is at least this value, then it is always stable.
|
|
|
|
* See above. (Corresponds to about 7 days for current decay rates.) */
|
|
|
|
#define MTBF_TO_GUARANTEE_STABLE (60*60*24*5)
|
|
|
|
/** Similarly, every node with at least this much weighted time known can be
|
|
|
|
* considered familiar enough to be a guard. Corresponds to about 20 days for
|
|
|
|
* current decay rates.
|
|
|
|
*/
|
|
|
|
#define TIME_KNOWN_TO_GUARANTEE_FAMILIAR (8*24*60*60)
|
|
|
|
/** Similarly, every node with sufficient WFU is around enough to be a guard.
|
|
|
|
*/
|
|
|
|
#define WFU_TO_GUARANTEE_GUARD (0.98)
|
|
|
|
|
|
|
|
/* Thresholds for server performance: set by
|
|
|
|
* dirserv_compute_performance_thresholds, and used by
|
|
|
|
* generate_v2_networkstatus */
|
|
|
|
|
|
|
|
/** Any router with an uptime of at least this value is stable. */
|
|
|
|
static uint32_t stable_uptime = 0; /* start at a safe value */
|
|
|
|
/** Any router with an mtbf of at least this value is stable. */
|
|
|
|
static double stable_mtbf = 0.0;
|
|
|
|
/** If true, we have measured enough mtbf info to look at stable_mtbf rather
|
|
|
|
* than stable_uptime. */
|
|
|
|
static int enough_mtbf_info = 0;
|
|
|
|
/** Any router with a weighted fractional uptime of at least this much might
|
|
|
|
* be good as a guard. */
|
|
|
|
static double guard_wfu = 0.0;
|
|
|
|
/** Don't call a router a guard unless we've known about it for at least this
|
|
|
|
* many seconds. */
|
|
|
|
static long guard_tk = 0;
|
|
|
|
/** Any router with a bandwidth at least this high is "Fast" */
|
|
|
|
static uint32_t fast_bandwidth_kb = 0;
|
|
|
|
/** If exits can be guards, then all guards must have a bandwidth this
|
|
|
|
* high. */
|
|
|
|
static uint32_t guard_bandwidth_including_exits_kb = 0;
|
|
|
|
/** If exits can't be guards, then all guards must have a bandwidth this
|
|
|
|
* high. */
|
|
|
|
static uint32_t guard_bandwidth_excluding_exits_kb = 0;
|
|
|
|
|
|
|
|
/** Helper: estimate the uptime of a router given its stated uptime and the
|
|
|
|
* amount of time since it last stated its stated uptime. */
|
|
|
|
static inline long
|
|
|
|
real_uptime(const routerinfo_t *router, time_t now)
|
|
|
|
{
|
|
|
|
if (now < router->cache_info.published_on)
|
|
|
|
return router->uptime;
|
|
|
|
else
|
|
|
|
return router->uptime + (now - router->cache_info.published_on);
|
|
|
|
}
|
|
|
|
|
|
|
|
/** Return 1 if <b>router</b> is not suitable for these parameters, else 0.
|
|
|
|
* If <b>need_uptime</b> is non-zero, we require a minimum uptime.
|
|
|
|
* If <b>need_capacity</b> is non-zero, we require a minimum advertised
|
|
|
|
* bandwidth.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
dirserv_thinks_router_is_unreliable(time_t now,
|
2018-12-03 18:34:29 +01:00
|
|
|
const routerinfo_t *router,
|
2018-09-20 14:09:35 +02:00
|
|
|
int need_uptime, int need_capacity)
|
|
|
|
{
|
|
|
|
if (need_uptime) {
|
|
|
|
if (!enough_mtbf_info) {
|
|
|
|
/* XXXX We should change the rule from
|
|
|
|
* "use uptime if we don't have mtbf data" to "don't advertise Stable on
|
|
|
|
* v3 if we don't have enough mtbf data." Or maybe not, since if we ever
|
|
|
|
* hit a point where we need to reset a lot of authorities at once,
|
|
|
|
* none of them would be in a position to declare Stable.
|
|
|
|
*/
|
|
|
|
long uptime = real_uptime(router, now);
|
|
|
|
if ((unsigned)uptime < stable_uptime &&
|
|
|
|
(unsigned)uptime < UPTIME_TO_GUARANTEE_STABLE)
|
|
|
|
return 1;
|
|
|
|
} else {
|
|
|
|
double mtbf =
|
|
|
|
rep_hist_get_stability(router->cache_info.identity_digest, now);
|
|
|
|
if (mtbf < stable_mtbf &&
|
|
|
|
mtbf < MTBF_TO_GUARANTEE_STABLE)
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (need_capacity) {
|
|
|
|
uint32_t bw_kb = dirserv_get_credible_bandwidth_kb(router);
|
|
|
|
if (bw_kb < fast_bandwidth_kb)
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/** Return 1 if <b>ri</b>'s descriptor is "active" -- running, valid,
|
|
|
|
* not hibernating, having observed bw greater 0, and not too old. Else
|
|
|
|
* return 0.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
router_is_active(const routerinfo_t *ri, const node_t *node, time_t now)
|
|
|
|
{
|
|
|
|
time_t cutoff = now - ROUTER_MAX_AGE_TO_PUBLISH;
|
|
|
|
if (ri->cache_info.published_on < cutoff) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
if (!node->is_running || !node->is_valid || ri->is_hibernating) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
/* Only require bandwidth capacity in non-test networks, or
|
|
|
|
* if TestingTorNetwork, and TestingMinExitFlagThreshold is non-zero */
|
|
|
|
if (!ri->bandwidthcapacity) {
|
|
|
|
if (get_options()->TestingTorNetwork) {
|
|
|
|
if (get_options()->TestingMinExitFlagThreshold > 0) {
|
|
|
|
/* If we're in a TestingTorNetwork, and TestingMinExitFlagThreshold is,
|
|
|
|
* then require bandwidthcapacity */
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/* If we're not in a TestingTorNetwork, then require bandwidthcapacity */
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/** Return true iff <b>router</b> should be assigned the "HSDir" flag.
|
|
|
|
*
|
|
|
|
* Right now this means it advertises support for it, it has a high uptime,
|
|
|
|
* it's a directory cache, it has the Stable and Fast flags, and it's currently
|
|
|
|
* considered Running.
|
|
|
|
*
|
|
|
|
* This function needs to be called after router-\>is_running has
|
|
|
|
* been set.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
dirserv_thinks_router_is_hs_dir(const routerinfo_t *router,
|
|
|
|
const node_t *node, time_t now)
|
|
|
|
{
|
|
|
|
|
|
|
|
long uptime;
|
|
|
|
|
|
|
|
/* If we haven't been running for at least
|
2019-12-19 15:43:25 +01:00
|
|
|
* MinUptimeHidServDirectoryV2 seconds, we can't
|
2018-09-20 14:09:35 +02:00
|
|
|
* have accurate data telling us a relay has been up for at least
|
|
|
|
* that long. We also want to allow a bit of slack: Reachability
|
|
|
|
* tests aren't instant. If we haven't been running long enough,
|
|
|
|
* trust the relay. */
|
|
|
|
|
|
|
|
if (get_uptime() >
|
2019-12-19 15:43:25 +01:00
|
|
|
dirauth_get_options()->MinUptimeHidServDirectoryV2 * 1.1)
|
2018-09-20 14:09:35 +02:00
|
|
|
uptime = MIN(rep_hist_get_uptime(router->cache_info.identity_digest, now),
|
|
|
|
real_uptime(router, now));
|
|
|
|
else
|
|
|
|
uptime = real_uptime(router, now);
|
|
|
|
|
|
|
|
return (router->wants_to_be_hs_dir &&
|
|
|
|
router->supports_tunnelled_dir_requests &&
|
|
|
|
node->is_stable && node->is_fast &&
|
2019-12-19 15:43:25 +01:00
|
|
|
uptime >= dirauth_get_options()->MinUptimeHidServDirectoryV2 &&
|
2018-09-20 14:09:35 +02:00
|
|
|
router_is_active(router, node, now));
|
|
|
|
}
|
|
|
|
|
|
|
|
/** Don't consider routers with less bandwidth than this when computing
|
|
|
|
* thresholds. */
|
|
|
|
#define ABSOLUTE_MIN_BW_VALUE_TO_CONSIDER_KB 4
|
|
|
|
|
|
|
|
/** Helper for dirserv_compute_performance_thresholds(): Decide whether to
|
|
|
|
* include a router in our calculations, and return true iff we should; the
|
|
|
|
* require_mbw parameter is passed in by
|
|
|
|
* dirserv_compute_performance_thresholds() and controls whether we ever
|
|
|
|
* count routers with only advertised bandwidths */
|
|
|
|
static int
|
|
|
|
router_counts_toward_thresholds(const node_t *node, time_t now,
|
|
|
|
const digestmap_t *omit_as_sybil,
|
|
|
|
int require_mbw)
|
|
|
|
{
|
|
|
|
/* Have measured bw? */
|
|
|
|
int have_mbw =
|
|
|
|
dirserv_has_measured_bw(node->identity);
|
|
|
|
uint64_t min_bw_kb = ABSOLUTE_MIN_BW_VALUE_TO_CONSIDER_KB;
|
|
|
|
const or_options_t *options = get_options();
|
|
|
|
|
|
|
|
if (options->TestingTorNetwork) {
|
|
|
|
min_bw_kb = (int64_t)options->TestingMinExitFlagThreshold / 1000;
|
|
|
|
}
|
|
|
|
|
|
|
|
return node->ri && router_is_active(node->ri, node, now) &&
|
|
|
|
!digestmap_get(omit_as_sybil, node->identity) &&
|
|
|
|
(dirserv_get_credible_bandwidth_kb(node->ri) >= min_bw_kb) &&
|
|
|
|
(have_mbw || !require_mbw);
|
|
|
|
}
|
|
|
|
|
|
|
|
/** Look through the routerlist, the Mean Time Between Failure history, and
|
|
|
|
* the Weighted Fractional Uptime history, and use them to set thresholds for
|
|
|
|
* the Stable, Fast, and Guard flags. Update the fields stable_uptime,
|
|
|
|
* stable_mtbf, enough_mtbf_info, guard_wfu, guard_tk, fast_bandwidth,
|
|
|
|
* guard_bandwidth_including_exits, and guard_bandwidth_excluding_exits.
|
|
|
|
*
|
|
|
|
* Also, set the is_exit flag of each router appropriately. */
|
|
|
|
void
|
|
|
|
dirserv_compute_performance_thresholds(digestmap_t *omit_as_sybil)
|
|
|
|
{
|
|
|
|
int n_active, n_active_nonexit, n_familiar;
|
|
|
|
uint32_t *uptimes, *bandwidths_kb, *bandwidths_excluding_exits_kb;
|
|
|
|
long *tks;
|
|
|
|
double *mtbfs, *wfus;
|
2019-04-26 16:36:49 +02:00
|
|
|
const smartlist_t *nodelist;
|
2018-09-20 14:09:35 +02:00
|
|
|
time_t now = time(NULL);
|
|
|
|
const or_options_t *options = get_options();
|
2019-12-19 15:51:11 +01:00
|
|
|
const dirauth_options_t *dirauth_options = dirauth_get_options();
|
2018-09-20 14:09:35 +02:00
|
|
|
|
|
|
|
/* Require mbw? */
|
|
|
|
int require_mbw =
|
|
|
|
(dirserv_get_last_n_measured_bws() >
|
2019-12-19 15:51:11 +01:00
|
|
|
dirauth_options->MinMeasuredBWsForAuthToIgnoreAdvertised) ? 1 : 0;
|
2018-09-20 14:09:35 +02:00
|
|
|
|
|
|
|
/* initialize these all here, in case there are no routers */
|
|
|
|
stable_uptime = 0;
|
|
|
|
stable_mtbf = 0;
|
|
|
|
fast_bandwidth_kb = 0;
|
|
|
|
guard_bandwidth_including_exits_kb = 0;
|
|
|
|
guard_bandwidth_excluding_exits_kb = 0;
|
|
|
|
guard_tk = 0;
|
|
|
|
guard_wfu = 0;
|
|
|
|
|
|
|
|
nodelist_assert_ok();
|
|
|
|
nodelist = nodelist_get_list();
|
|
|
|
|
|
|
|
/* Initialize arrays that will hold values for each router. We'll
|
|
|
|
* sort them and use that to compute thresholds. */
|
|
|
|
n_active = n_active_nonexit = 0;
|
|
|
|
/* Uptime for every active router. */
|
|
|
|
uptimes = tor_calloc(smartlist_len(nodelist), sizeof(uint32_t));
|
|
|
|
/* Bandwidth for every active router. */
|
|
|
|
bandwidths_kb = tor_calloc(smartlist_len(nodelist), sizeof(uint32_t));
|
|
|
|
/* Bandwidth for every active non-exit router. */
|
|
|
|
bandwidths_excluding_exits_kb =
|
|
|
|
tor_calloc(smartlist_len(nodelist), sizeof(uint32_t));
|
|
|
|
/* Weighted mean time between failure for each active router. */
|
|
|
|
mtbfs = tor_calloc(smartlist_len(nodelist), sizeof(double));
|
|
|
|
/* Time-known for each active router. */
|
|
|
|
tks = tor_calloc(smartlist_len(nodelist), sizeof(long));
|
|
|
|
/* Weighted fractional uptime for each active router. */
|
|
|
|
wfus = tor_calloc(smartlist_len(nodelist), sizeof(double));
|
|
|
|
|
|
|
|
/* Now, fill in the arrays. */
|
|
|
|
SMARTLIST_FOREACH_BEGIN(nodelist, node_t *, node) {
|
|
|
|
if (options->BridgeAuthoritativeDir &&
|
|
|
|
node->ri &&
|
|
|
|
node->ri->purpose != ROUTER_PURPOSE_BRIDGE)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
routerinfo_t *ri = node->ri;
|
|
|
|
if (ri) {
|
|
|
|
node->is_exit = (!router_exit_policy_rejects_all(ri) &&
|
|
|
|
exit_policy_is_general_exit(ri->exit_policy));
|
|
|
|
}
|
|
|
|
|
|
|
|
if (router_counts_toward_thresholds(node, now, omit_as_sybil,
|
|
|
|
require_mbw)) {
|
|
|
|
const char *id = node->identity;
|
|
|
|
uint32_t bw_kb;
|
|
|
|
|
|
|
|
/* resolve spurious clang shallow analysis null pointer errors */
|
|
|
|
tor_assert(ri);
|
|
|
|
|
|
|
|
uptimes[n_active] = (uint32_t)real_uptime(ri, now);
|
|
|
|
mtbfs[n_active] = rep_hist_get_stability(id, now);
|
|
|
|
tks [n_active] = rep_hist_get_weighted_time_known(id, now);
|
|
|
|
bandwidths_kb[n_active] = bw_kb = dirserv_get_credible_bandwidth_kb(ri);
|
|
|
|
if (!node->is_exit || node->is_bad_exit) {
|
|
|
|
bandwidths_excluding_exits_kb[n_active_nonexit] = bw_kb;
|
|
|
|
++n_active_nonexit;
|
|
|
|
}
|
|
|
|
++n_active;
|
|
|
|
}
|
|
|
|
} SMARTLIST_FOREACH_END(node);
|
|
|
|
|
|
|
|
/* Now, compute thresholds. */
|
|
|
|
if (n_active) {
|
|
|
|
/* The median uptime is stable. */
|
|
|
|
stable_uptime = median_uint32(uptimes, n_active);
|
|
|
|
/* The median mtbf is stable, if we have enough mtbf info */
|
|
|
|
stable_mtbf = median_double(mtbfs, n_active);
|
|
|
|
/* The 12.5th percentile bandwidth is fast. */
|
|
|
|
fast_bandwidth_kb = find_nth_uint32(bandwidths_kb, n_active, n_active/8);
|
|
|
|
/* (Now bandwidths is sorted.) */
|
|
|
|
if (fast_bandwidth_kb < RELAY_REQUIRED_MIN_BANDWIDTH/(2 * 1000))
|
|
|
|
fast_bandwidth_kb = bandwidths_kb[n_active/4];
|
|
|
|
guard_bandwidth_including_exits_kb =
|
|
|
|
third_quartile_uint32(bandwidths_kb, n_active);
|
|
|
|
guard_tk = find_nth_long(tks, n_active, n_active/8);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (guard_tk > TIME_KNOWN_TO_GUARANTEE_FAMILIAR)
|
|
|
|
guard_tk = TIME_KNOWN_TO_GUARANTEE_FAMILIAR;
|
|
|
|
|
|
|
|
{
|
|
|
|
/* We can vote on a parameter for the minimum and maximum. */
|
|
|
|
#define ABSOLUTE_MIN_VALUE_FOR_FAST_FLAG 4
|
|
|
|
int32_t min_fast_kb, max_fast_kb, min_fast, max_fast;
|
|
|
|
min_fast = networkstatus_get_param(NULL, "FastFlagMinThreshold",
|
|
|
|
ABSOLUTE_MIN_VALUE_FOR_FAST_FLAG,
|
|
|
|
ABSOLUTE_MIN_VALUE_FOR_FAST_FLAG,
|
|
|
|
INT32_MAX);
|
|
|
|
if (options->TestingTorNetwork) {
|
|
|
|
min_fast = (int32_t)options->TestingMinFastFlagThreshold;
|
|
|
|
}
|
|
|
|
max_fast = networkstatus_get_param(NULL, "FastFlagMaxThreshold",
|
|
|
|
INT32_MAX, min_fast, INT32_MAX);
|
|
|
|
min_fast_kb = min_fast / 1000;
|
|
|
|
max_fast_kb = max_fast / 1000;
|
|
|
|
|
|
|
|
if (fast_bandwidth_kb < (uint32_t)min_fast_kb)
|
|
|
|
fast_bandwidth_kb = min_fast_kb;
|
|
|
|
if (fast_bandwidth_kb > (uint32_t)max_fast_kb)
|
|
|
|
fast_bandwidth_kb = max_fast_kb;
|
|
|
|
}
|
|
|
|
/* Protect sufficiently fast nodes from being pushed out of the set
|
|
|
|
* of Fast nodes. */
|
2019-12-19 14:50:19 +01:00
|
|
|
{
|
|
|
|
const uint64_t fast_opt = dirauth_get_options()->AuthDirFastGuarantee;
|
|
|
|
if (fast_opt && fast_bandwidth_kb > fast_opt / 1000)
|
|
|
|
fast_bandwidth_kb = (uint32_t)(fast_opt / 1000);
|
|
|
|
}
|
2018-09-20 14:09:35 +02:00
|
|
|
|
|
|
|
/* Now that we have a time-known that 7/8 routers are known longer than,
|
|
|
|
* fill wfus with the wfu of every such "familiar" router. */
|
|
|
|
n_familiar = 0;
|
|
|
|
|
|
|
|
SMARTLIST_FOREACH_BEGIN(nodelist, node_t *, node) {
|
|
|
|
if (router_counts_toward_thresholds(node, now,
|
|
|
|
omit_as_sybil, require_mbw)) {
|
|
|
|
routerinfo_t *ri = node->ri;
|
|
|
|
const char *id = ri->cache_info.identity_digest;
|
|
|
|
long tk = rep_hist_get_weighted_time_known(id, now);
|
|
|
|
if (tk < guard_tk)
|
|
|
|
continue;
|
|
|
|
wfus[n_familiar++] = rep_hist_get_weighted_fractional_uptime(id, now);
|
|
|
|
}
|
|
|
|
} SMARTLIST_FOREACH_END(node);
|
|
|
|
if (n_familiar)
|
|
|
|
guard_wfu = median_double(wfus, n_familiar);
|
|
|
|
if (guard_wfu > WFU_TO_GUARANTEE_GUARD)
|
|
|
|
guard_wfu = WFU_TO_GUARANTEE_GUARD;
|
|
|
|
|
|
|
|
enough_mtbf_info = rep_hist_have_measured_enough_stability();
|
|
|
|
|
|
|
|
if (n_active_nonexit) {
|
|
|
|
guard_bandwidth_excluding_exits_kb =
|
|
|
|
find_nth_uint32(bandwidths_excluding_exits_kb,
|
|
|
|
n_active_nonexit, n_active_nonexit*3/4);
|
|
|
|
}
|
|
|
|
|
|
|
|
log_info(LD_DIRSERV,
|
|
|
|
"Cutoffs: For Stable, %lu sec uptime, %lu sec MTBF. "
|
|
|
|
"For Fast: %lu kilobytes/sec. "
|
|
|
|
"For Guard: WFU %.03f%%, time-known %lu sec, "
|
|
|
|
"and bandwidth %lu or %lu kilobytes/sec. "
|
|
|
|
"We%s have enough stability data.",
|
|
|
|
(unsigned long)stable_uptime,
|
|
|
|
(unsigned long)stable_mtbf,
|
|
|
|
(unsigned long)fast_bandwidth_kb,
|
|
|
|
guard_wfu*100,
|
|
|
|
(unsigned long)guard_tk,
|
|
|
|
(unsigned long)guard_bandwidth_including_exits_kb,
|
|
|
|
(unsigned long)guard_bandwidth_excluding_exits_kb,
|
|
|
|
enough_mtbf_info ? "" : " don't");
|
|
|
|
|
|
|
|
tor_free(uptimes);
|
|
|
|
tor_free(mtbfs);
|
|
|
|
tor_free(bandwidths_kb);
|
|
|
|
tor_free(bandwidths_excluding_exits_kb);
|
|
|
|
tor_free(tks);
|
|
|
|
tor_free(wfus);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Use dirserv_compute_performance_thresholds() to compute the thresholds
|
|
|
|
* for the status flags, specifically for bridges.
|
|
|
|
*
|
|
|
|
* This is only called by a Bridge Authority from
|
|
|
|
* networkstatus_getinfo_by_purpose().
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
dirserv_compute_bridge_flag_thresholds(void)
|
|
|
|
{
|
|
|
|
digestmap_t *omit_as_sybil = digestmap_new();
|
|
|
|
dirserv_compute_performance_thresholds(omit_as_sybil);
|
|
|
|
digestmap_free(omit_as_sybil, NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
/** Give a statement of our current performance thresholds for inclusion
|
|
|
|
* in a vote document. */
|
|
|
|
char *
|
|
|
|
dirserv_get_flag_thresholds_line(void)
|
|
|
|
{
|
|
|
|
char *result=NULL;
|
|
|
|
const int measured_threshold =
|
2019-12-19 15:51:11 +01:00
|
|
|
dirauth_get_options()->MinMeasuredBWsForAuthToIgnoreAdvertised;
|
2018-09-20 14:09:35 +02:00
|
|
|
const int enough_measured_bw =
|
|
|
|
dirserv_get_last_n_measured_bws() > measured_threshold;
|
|
|
|
|
|
|
|
tor_asprintf(&result,
|
|
|
|
"stable-uptime=%lu stable-mtbf=%lu "
|
|
|
|
"fast-speed=%lu "
|
|
|
|
"guard-wfu=%.03f%% guard-tk=%lu "
|
|
|
|
"guard-bw-inc-exits=%lu guard-bw-exc-exits=%lu "
|
|
|
|
"enough-mtbf=%d ignoring-advertised-bws=%d",
|
|
|
|
(unsigned long)stable_uptime,
|
|
|
|
(unsigned long)stable_mtbf,
|
|
|
|
(unsigned long)fast_bandwidth_kb*1000,
|
|
|
|
guard_wfu*100,
|
|
|
|
(unsigned long)guard_tk,
|
|
|
|
(unsigned long)guard_bandwidth_including_exits_kb*1000,
|
|
|
|
(unsigned long)guard_bandwidth_excluding_exits_kb*1000,
|
|
|
|
enough_mtbf_info ? 1 : 0,
|
|
|
|
enough_measured_bw ? 1 : 0);
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* DOCDOC running_long_enough_to_decide_unreachable */
|
|
|
|
int
|
|
|
|
running_long_enough_to_decide_unreachable(void)
|
|
|
|
{
|
|
|
|
return time_of_process_start
|
|
|
|
+ get_options()->TestingAuthDirTimeToLearnReachability < approx_time();
|
|
|
|
}
|
|
|
|
|
|
|
|
/** Each server needs to have passed a reachability test no more
|
|
|
|
* than this number of seconds ago, or it is listed as down in
|
|
|
|
* the directory. */
|
|
|
|
#define REACHABLE_TIMEOUT (45*60)
|
|
|
|
|
|
|
|
/** If we tested a router and found it reachable _at least this long_ after it
|
|
|
|
* declared itself hibernating, it is probably done hibernating and we just
|
|
|
|
* missed a descriptor from it. */
|
|
|
|
#define HIBERNATION_PUBLICATION_SKEW (60*60)
|
|
|
|
|
|
|
|
/** Treat a router as alive if
|
|
|
|
* - It's me, and I'm not hibernating.
|
|
|
|
* or - We've found it reachable recently. */
|
|
|
|
void
|
|
|
|
dirserv_set_router_is_running(routerinfo_t *router, time_t now)
|
|
|
|
{
|
|
|
|
/*XXXX This function is a mess. Separate out the part that calculates
|
|
|
|
whether it's reachable and the part that tells rephist that the router was
|
|
|
|
unreachable.
|
|
|
|
*/
|
|
|
|
int answer;
|
|
|
|
const or_options_t *options = get_options();
|
2019-12-19 15:07:01 +01:00
|
|
|
const dirauth_options_t *dirauth_options = dirauth_get_options();
|
2018-09-20 14:09:35 +02:00
|
|
|
node_t *node = node_get_mutable_by_id(router->cache_info.identity_digest);
|
|
|
|
tor_assert(node);
|
|
|
|
|
|
|
|
if (router_is_me(router)) {
|
|
|
|
/* We always know if we are shutting down or hibernating ourselves. */
|
|
|
|
answer = ! we_are_hibernating();
|
|
|
|
} else if (router->is_hibernating &&
|
|
|
|
(router->cache_info.published_on +
|
|
|
|
HIBERNATION_PUBLICATION_SKEW) > node->last_reachable) {
|
|
|
|
/* A hibernating router is down unless we (somehow) had contact with it
|
|
|
|
* since it declared itself to be hibernating. */
|
|
|
|
answer = 0;
|
|
|
|
} else if (options->AssumeReachable) {
|
|
|
|
/* If AssumeReachable, everybody is up unless they say they are down! */
|
|
|
|
answer = 1;
|
|
|
|
} else {
|
|
|
|
/* Otherwise, a router counts as up if we found all announced OR
|
|
|
|
ports reachable in the last REACHABLE_TIMEOUT seconds.
|
|
|
|
|
|
|
|
XXX prop186 For now there's always one IPv4 and at most one
|
|
|
|
IPv6 OR port.
|
|
|
|
|
|
|
|
If we're not on IPv6, don't consider reachability of potential
|
|
|
|
IPv6 OR port since that'd kill all dual stack relays until a
|
|
|
|
majority of the dir auths have IPv6 connectivity. */
|
|
|
|
answer = (now < node->last_reachable + REACHABLE_TIMEOUT &&
|
2019-12-19 15:07:01 +01:00
|
|
|
(dirauth_options->AuthDirHasIPv6Connectivity != 1 ||
|
2018-09-20 14:09:35 +02:00
|
|
|
tor_addr_is_null(&router->ipv6_addr) ||
|
|
|
|
now < node->last_reachable6 + REACHABLE_TIMEOUT));
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!answer && running_long_enough_to_decide_unreachable()) {
|
|
|
|
/* Not considered reachable. tell rephist about that.
|
|
|
|
|
|
|
|
Because we launch a reachability test for each router every
|
|
|
|
REACHABILITY_TEST_CYCLE_PERIOD seconds, then the router has probably
|
|
|
|
been down since at least that time after we last successfully reached
|
|
|
|
it.
|
|
|
|
|
|
|
|
XXX ipv6
|
|
|
|
*/
|
|
|
|
time_t when = now;
|
|
|
|
if (node->last_reachable &&
|
|
|
|
node->last_reachable + REACHABILITY_TEST_CYCLE_PERIOD < now)
|
|
|
|
when = node->last_reachable + REACHABILITY_TEST_CYCLE_PERIOD;
|
|
|
|
rep_hist_note_router_unreachable(router->cache_info.identity_digest, when);
|
|
|
|
}
|
|
|
|
|
|
|
|
node->is_running = answer;
|
|
|
|
}
|
|
|
|
|
2019-02-22 19:36:02 +01:00
|
|
|
/* Check <b>node</b> and <b>ri</b> on whether or not we should publish a
|
|
|
|
* relay's IPv6 addresses. */
|
|
|
|
static int
|
|
|
|
should_publish_node_ipv6(const node_t *node, const routerinfo_t *ri,
|
|
|
|
time_t now)
|
|
|
|
{
|
2019-12-19 15:07:01 +01:00
|
|
|
const dirauth_options_t *options = dirauth_get_options();
|
2019-02-22 19:36:02 +01:00
|
|
|
|
|
|
|
return options->AuthDirHasIPv6Connectivity == 1 &&
|
|
|
|
!tor_addr_is_null(&ri->ipv6_addr) &&
|
|
|
|
((node->last_reachable6 >= now - REACHABLE_TIMEOUT) ||
|
|
|
|
router_is_me(ri));
|
|
|
|
}
|
|
|
|
|
2019-04-30 18:42:33 +02:00
|
|
|
/**
|
|
|
|
* Extract status information from <b>ri</b> and from other authority
|
|
|
|
* functions and store it in <b>rs</b>, as per
|
|
|
|
* <b>set_routerstatus_from_routerinfo</b>. Additionally, sets information
|
|
|
|
* in from the authority subsystem.
|
2018-09-20 14:09:35 +02:00
|
|
|
*/
|
|
|
|
void
|
2019-04-30 18:42:33 +02:00
|
|
|
dirauth_set_routerstatus_from_routerinfo(routerstatus_t *rs,
|
|
|
|
node_t *node,
|
|
|
|
const routerinfo_t *ri,
|
|
|
|
time_t now,
|
|
|
|
int listbadexits)
|
2018-09-20 14:09:35 +02:00
|
|
|
{
|
|
|
|
const or_options_t *options = get_options();
|
|
|
|
uint32_t routerbw_kb = dirserv_get_credible_bandwidth_kb(ri);
|
|
|
|
|
2019-04-30 18:42:33 +02:00
|
|
|
/* Set these flags so that set_routerstatus_from_routerinfo can copy them.
|
|
|
|
*/
|
|
|
|
node->is_stable = !dirserv_thinks_router_is_unreliable(now, ri, 1, 0);
|
|
|
|
node->is_fast = !dirserv_thinks_router_is_unreliable(now, ri, 0, 1);
|
|
|
|
node->is_hs_dir = dirserv_thinks_router_is_hs_dir(ri, node, now);
|
2018-09-20 14:09:35 +02:00
|
|
|
|
2019-04-30 18:42:33 +02:00
|
|
|
set_routerstatus_from_routerinfo(rs, node, ri);
|
2018-09-20 14:09:35 +02:00
|
|
|
|
2019-04-30 18:42:33 +02:00
|
|
|
/* Override rs->is_possible_guard. */
|
2019-12-19 14:50:19 +01:00
|
|
|
const uint64_t bw_opt = dirauth_get_options()->AuthDirGuardBWGuarantee;
|
2018-09-20 14:09:35 +02:00
|
|
|
if (node->is_fast && node->is_stable &&
|
|
|
|
ri->supports_tunnelled_dir_requests &&
|
2019-12-19 14:50:19 +01:00
|
|
|
((bw_opt && routerbw_kb >= bw_opt / 1000) ||
|
2018-09-20 14:09:35 +02:00
|
|
|
routerbw_kb >= MIN(guard_bandwidth_including_exits_kb,
|
|
|
|
guard_bandwidth_excluding_exits_kb))) {
|
|
|
|
long tk = rep_hist_get_weighted_time_known(
|
|
|
|
node->identity, now);
|
|
|
|
double wfu = rep_hist_get_weighted_fractional_uptime(
|
|
|
|
node->identity, now);
|
|
|
|
rs->is_possible_guard = (wfu >= guard_wfu && tk >= guard_tk) ? 1 : 0;
|
|
|
|
} else {
|
|
|
|
rs->is_possible_guard = 0;
|
|
|
|
}
|
|
|
|
|
2019-04-30 18:42:33 +02:00
|
|
|
/* Override rs->is_bad_exit */
|
2018-09-20 14:09:35 +02:00
|
|
|
rs->is_bad_exit = listbadexits && node->is_bad_exit;
|
2018-11-25 16:05:13 +01:00
|
|
|
|
2019-04-30 18:42:33 +02:00
|
|
|
/* Set rs->is_staledesc. */
|
2018-11-25 16:05:13 +01:00
|
|
|
rs->is_staledesc =
|
|
|
|
(ri->cache_info.published_on + DESC_IS_STALE_INTERVAL) < now;
|
|
|
|
|
2019-04-30 18:42:33 +02:00
|
|
|
if (! should_publish_node_ipv6(node, ri, now)) {
|
|
|
|
/* We're not configured as having IPv6 connectivity or the node isn't:
|
|
|
|
* zero its IPv6 information. */
|
2018-09-20 14:09:35 +02:00
|
|
|
tor_addr_make_null(&rs->ipv6_addr, AF_INET6);
|
|
|
|
rs->ipv6_orport = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (options->TestingTorNetwork) {
|
|
|
|
dirserv_set_routerstatus_testing(rs);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/** Use TestingDirAuthVoteExit, TestingDirAuthVoteGuard, and
|
|
|
|
* TestingDirAuthVoteHSDir to give out the Exit, Guard, and HSDir flags,
|
|
|
|
* respectively. But don't set the corresponding node flags.
|
|
|
|
* Should only be called if TestingTorNetwork is set. */
|
|
|
|
STATIC void
|
|
|
|
dirserv_set_routerstatus_testing(routerstatus_t *rs)
|
|
|
|
{
|
|
|
|
const or_options_t *options = get_options();
|
|
|
|
|
|
|
|
tor_assert(options->TestingTorNetwork);
|
|
|
|
|
|
|
|
if (routerset_contains_routerstatus(options->TestingDirAuthVoteExit,
|
|
|
|
rs, 0)) {
|
|
|
|
rs->is_exit = 1;
|
|
|
|
} else if (options->TestingDirAuthVoteExitIsStrict) {
|
|
|
|
rs->is_exit = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (routerset_contains_routerstatus(options->TestingDirAuthVoteGuard,
|
|
|
|
rs, 0)) {
|
|
|
|
rs->is_possible_guard = 1;
|
|
|
|
} else if (options->TestingDirAuthVoteGuardIsStrict) {
|
|
|
|
rs->is_possible_guard = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (routerset_contains_routerstatus(options->TestingDirAuthVoteHSDir,
|
|
|
|
rs, 0)) {
|
|
|
|
rs->is_hs_dir = 1;
|
|
|
|
} else if (options->TestingDirAuthVoteHSDirIsStrict) {
|
|
|
|
rs->is_hs_dir = 0;
|
|
|
|
}
|
|
|
|
}
|
2019-04-12 02:44:30 +02:00
|
|
|
|
|
|
|
/** Use dirserv_set_router_is_running() to set bridges as running if they're
|
|
|
|
* reachable.
|
|
|
|
*
|
|
|
|
* This function is called from set_bridge_running_callback() when running as
|
|
|
|
* a bridge authority.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
dirserv_set_bridges_running(time_t now)
|
|
|
|
{
|
|
|
|
routerlist_t *rl = router_get_routerlist();
|
|
|
|
|
|
|
|
SMARTLIST_FOREACH_BEGIN(rl->routers, routerinfo_t *, ri) {
|
|
|
|
if (ri->purpose == ROUTER_PURPOSE_BRIDGE)
|
|
|
|
dirserv_set_router_is_running(ri, now);
|
|
|
|
} SMARTLIST_FOREACH_END(ri);
|
|
|
|
}
|