1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406
|
// Copyright 2017 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "net/http/broken_alternative_services.h"
#include "base/containers/adapters.h"
#include "base/functional/bind.h"
#include "base/memory/singleton.h"
#include "base/time/tick_clock.h"
#include "base/time/time.h"
#include "net/http/http_server_properties.h"
namespace net {
namespace {
// Default broken alternative services, which is used when
// exponential_backoff_on_initial_delay is false.
constexpr base::TimeDelta kDefaultBrokenAlternativeProtocolDelay =
base::Seconds(300);
// Subsequent failures result in exponential (base 2) backoff.
// Given the shortest broken delay is 1s, limit binary shift to limit delay to
// approximately 2 days.
const int kBrokenDelayMaxShift = 18;
// Lower and upper limits of broken alternative service delay.
constexpr base::TimeDelta kMinBrokenAlternativeProtocolDelay = base::Seconds(1);
constexpr base::TimeDelta kMaxBrokenAlternativeProtocolDelay = base::Days(2);
base::TimeDelta ComputeBrokenAlternativeServiceExpirationDelay(
int broken_count,
base::TimeDelta initial_delay,
bool exponential_backoff_on_initial_delay) {
DCHECK_GE(broken_count, 0);
// Make sure initial delay is within [1s, 300s].
if (initial_delay < kMinBrokenAlternativeProtocolDelay) {
initial_delay = kMinBrokenAlternativeProtocolDelay;
}
if (initial_delay > kDefaultBrokenAlternativeProtocolDelay) {
initial_delay = kDefaultBrokenAlternativeProtocolDelay;
}
if (broken_count == 0) {
return initial_delay;
}
// Limit broken_count to avoid overflow.
if (broken_count > kBrokenDelayMaxShift) {
broken_count = kBrokenDelayMaxShift;
}
base::TimeDelta delay;
if (exponential_backoff_on_initial_delay) {
delay = initial_delay * (1 << broken_count);
} else {
delay = kDefaultBrokenAlternativeProtocolDelay * (1 << (broken_count - 1));
}
return std::min(delay, kMaxBrokenAlternativeProtocolDelay);
}
} // namespace
BrokenAlternativeService::BrokenAlternativeService(
const AlternativeService& alternative_service,
const NetworkAnonymizationKey& network_anonymization_key,
bool use_network_anonymization_key)
: alternative_service(alternative_service),
network_anonymization_key(use_network_anonymization_key
? network_anonymization_key
: NetworkAnonymizationKey()) {}
BrokenAlternativeService::~BrokenAlternativeService() = default;
bool BrokenAlternativeService::operator<(
const BrokenAlternativeService& other) const {
return std::tie(alternative_service, network_anonymization_key) <
std::tie(other.alternative_service, other.network_anonymization_key);
}
BrokenAlternativeServices::BrokenAlternativeServices(
int max_recently_broken_alternative_service_entries,
Delegate* delegate,
const base::TickClock* clock)
: delegate_(delegate),
clock_(clock),
recently_broken_alternative_services_(
max_recently_broken_alternative_service_entries),
initial_delay_(kDefaultBrokenAlternativeProtocolDelay) {
DCHECK(delegate_);
DCHECK(clock_);
}
BrokenAlternativeServices::~BrokenAlternativeServices() = default;
void BrokenAlternativeServices::Clear() {
expiration_timer_.Stop();
broken_alternative_service_list_.clear();
broken_alternative_service_map_.clear();
recently_broken_alternative_services_.Clear();
}
void BrokenAlternativeServices::MarkBrokenUntilDefaultNetworkChanges(
const BrokenAlternativeService& broken_alternative_service) {
DCHECK(!broken_alternative_service.alternative_service.host.empty());
DCHECK_NE(NextProto::kProtoUnknown,
broken_alternative_service.alternative_service.protocol);
// The brokenness will expire on the default network change or based on
// timer.
broken_alternative_services_on_default_network_.insert(
broken_alternative_service);
MarkBrokenImpl(broken_alternative_service);
}
void BrokenAlternativeServices::MarkBroken(
const BrokenAlternativeService& broken_alternative_service) {
// The brokenness expires based only on the timer, not on the default network
// change.
broken_alternative_services_on_default_network_.erase(
broken_alternative_service);
MarkBrokenImpl(broken_alternative_service);
}
void BrokenAlternativeServices::MarkBrokenImpl(
const BrokenAlternativeService& broken_alternative_service) {
// Empty host means use host of origin, callers are supposed to substitute.
DCHECK(!broken_alternative_service.alternative_service.host.empty());
DCHECK_NE(NextProto::kProtoUnknown,
broken_alternative_service.alternative_service.protocol);
auto it =
recently_broken_alternative_services_.Get(broken_alternative_service);
int broken_count = 0;
if (it == recently_broken_alternative_services_.end()) {
recently_broken_alternative_services_.Put(broken_alternative_service, 1);
} else {
broken_count = it->second++;
}
base::TimeTicks expiration =
clock_->NowTicks() +
ComputeBrokenAlternativeServiceExpirationDelay(
broken_count, initial_delay_, exponential_backoff_on_initial_delay_);
// Return if alternative service is already in expiration queue.
BrokenAlternativeServiceList::iterator list_it;
if (!AddToBrokenListAndMap(broken_alternative_service, expiration,
&list_it)) {
return;
}
// If this is now the first entry in the list (i.e.
// |broken_alternative_service| is the next alt svc to expire), schedule
// an expiration task for it.
if (list_it == broken_alternative_service_list_.begin()) {
ScheduleBrokenAlternateProtocolMappingsExpiration();
}
}
void BrokenAlternativeServices::MarkRecentlyBroken(
const BrokenAlternativeService& broken_alternative_service) {
DCHECK_NE(NextProto::kProtoUnknown,
broken_alternative_service.alternative_service.protocol);
if (recently_broken_alternative_services_.Get(broken_alternative_service) ==
recently_broken_alternative_services_.end()) {
recently_broken_alternative_services_.Put(broken_alternative_service, 1);
}
}
bool BrokenAlternativeServices::IsBroken(
const BrokenAlternativeService& broken_alternative_service) const {
// Empty host means use host of origin, callers are supposed to substitute.
DCHECK(!broken_alternative_service.alternative_service.host.empty());
return broken_alternative_service_map_.find(broken_alternative_service) !=
broken_alternative_service_map_.end();
}
bool BrokenAlternativeServices::IsBroken(
const BrokenAlternativeService& broken_alternative_service,
base::TimeTicks* brokenness_expiration) const {
DCHECK(brokenness_expiration != nullptr);
// Empty host means use host of origin, callers are supposed to substitute.
DCHECK(!broken_alternative_service.alternative_service.host.empty());
auto map_it =
broken_alternative_service_map_.find(broken_alternative_service);
if (map_it == broken_alternative_service_map_.end()) {
return false;
}
auto list_it = map_it->second;
*brokenness_expiration = list_it->second;
return true;
}
bool BrokenAlternativeServices::WasRecentlyBroken(
const BrokenAlternativeService& broken_alternative_service) {
DCHECK(!broken_alternative_service.alternative_service.host.empty());
return recently_broken_alternative_services_.Get(
broken_alternative_service) !=
recently_broken_alternative_services_.end() ||
broken_alternative_service_map_.find(broken_alternative_service) !=
broken_alternative_service_map_.end();
}
void BrokenAlternativeServices::Confirm(
const BrokenAlternativeService& broken_alternative_service) {
DCHECK_NE(NextProto::kProtoUnknown,
broken_alternative_service.alternative_service.protocol);
// Remove |broken_alternative_service| from
// |broken_alternative_service_list_|, |broken_alternative_service_map_| and
// |broken_alternative_services_on_default_network_|.
auto map_it =
broken_alternative_service_map_.find(broken_alternative_service);
if (map_it != broken_alternative_service_map_.end()) {
broken_alternative_service_list_.erase(map_it->second);
broken_alternative_service_map_.erase(map_it);
}
auto it =
recently_broken_alternative_services_.Get(broken_alternative_service);
if (it != recently_broken_alternative_services_.end()) {
recently_broken_alternative_services_.Erase(it);
}
broken_alternative_services_on_default_network_.erase(
broken_alternative_service);
}
bool BrokenAlternativeServices::OnDefaultNetworkChanged() {
bool changed = !broken_alternative_services_on_default_network_.empty();
while (!broken_alternative_services_on_default_network_.empty()) {
Confirm(*broken_alternative_services_on_default_network_.begin());
}
return changed;
}
void BrokenAlternativeServices::SetBrokenAndRecentlyBrokenAlternativeServices(
std::unique_ptr<BrokenAlternativeServiceList>
broken_alternative_service_list,
std::unique_ptr<RecentlyBrokenAlternativeServices>
recently_broken_alternative_services) {
DCHECK(broken_alternative_service_list);
DCHECK(recently_broken_alternative_services);
base::TimeTicks next_expiration =
broken_alternative_service_list_.empty()
? base::TimeTicks::Max()
: broken_alternative_service_list_.front().second;
// Add |recently_broken_alternative_services| to
// |recently_broken_alternative_services_|.
// If an alt-svc already exists, overwrite its broken-count to the one in
// |recently_broken_alternative_services|.
recently_broken_alternative_services_.Swap(
*recently_broken_alternative_services);
// Add back all existing recently broken alt svcs to cache so they're at
// front of recency list (LRUCache::Get() does this automatically).
for (const auto& [service, broken_count] :
base::Reversed(*recently_broken_alternative_services)) {
if (recently_broken_alternative_services_.Get(service) ==
recently_broken_alternative_services_.end()) {
recently_broken_alternative_services_.Put(service, broken_count);
}
}
// Append |broken_alternative_service_list| to
// |broken_alternative_service_list_|
size_t num_broken_alt_svcs_added = broken_alternative_service_list->size();
broken_alternative_service_list_.splice(
broken_alternative_service_list_.begin(),
*broken_alternative_service_list);
// For each newly-appended alt svc in |broken_alternative_service_list_|,
// add an entry to |broken_alternative_service_map_| that points to its
// list iterator. Also, add an entry for that alt svc in
// |recently_broken_alternative_services_| if one doesn't exist.
auto list_it = broken_alternative_service_list_.begin();
for (size_t i = 0; i < num_broken_alt_svcs_added; ++i) {
const BrokenAlternativeService& broken_alternative_service = list_it->first;
auto map_it =
broken_alternative_service_map_.find(broken_alternative_service);
if (map_it != broken_alternative_service_map_.end()) {
// Implies this entry already exists somewhere else in
// |broken_alternative_service_list_|. Remove the existing entry from
// |broken_alternative_service_list_|, and update the
// |broken_alternative_service_map_| entry to point to this list entry
// instead.
auto list_existing_entry_it = map_it->second;
broken_alternative_service_list_.erase(list_existing_entry_it);
map_it->second = list_it;
} else {
broken_alternative_service_map_.emplace(broken_alternative_service,
list_it);
}
if (recently_broken_alternative_services_.Peek(
broken_alternative_service) ==
recently_broken_alternative_services_.end()) {
recently_broken_alternative_services_.Put(broken_alternative_service, 1);
}
++list_it;
}
// Sort |broken_alternative_service_list_| by expiration time. This operation
// does not invalidate list iterators, so |broken_alternative_service_map_|
// does not need to be updated.
broken_alternative_service_list_.sort(
[](const std::pair<BrokenAlternativeService, base::TimeTicks>& lhs,
const std::pair<BrokenAlternativeService, base::TimeTicks>& rhs)
-> bool { return lhs.second < rhs.second; });
base::TimeTicks new_next_expiration =
broken_alternative_service_list_.empty()
? base::TimeTicks::Max()
: broken_alternative_service_list_.front().second;
if (new_next_expiration != next_expiration)
ScheduleBrokenAlternateProtocolMappingsExpiration();
}
void BrokenAlternativeServices::SetDelayParams(
std::optional<base::TimeDelta> initial_delay,
std::optional<bool> exponential_backoff_on_initial_delay) {
if (initial_delay.has_value()) {
initial_delay_ = initial_delay.value();
}
if (exponential_backoff_on_initial_delay.has_value()) {
exponential_backoff_on_initial_delay_ =
exponential_backoff_on_initial_delay.value();
}
}
const BrokenAlternativeServiceList&
BrokenAlternativeServices::broken_alternative_service_list() const {
return broken_alternative_service_list_;
}
const RecentlyBrokenAlternativeServices&
BrokenAlternativeServices::recently_broken_alternative_services() const {
return recently_broken_alternative_services_;
}
bool BrokenAlternativeServices::AddToBrokenListAndMap(
const BrokenAlternativeService& broken_alternative_service,
base::TimeTicks expiration,
BrokenAlternativeServiceList::iterator* it) {
DCHECK(it);
auto map_it =
broken_alternative_service_map_.find(broken_alternative_service);
if (map_it != broken_alternative_service_map_.end())
return false;
// Iterate from end of |broken_alternative_service_list_| to find where to
// insert it to keep the list sorted by expiration time.
auto list_it = broken_alternative_service_list_.end();
while (list_it != broken_alternative_service_list_.begin()) {
--list_it;
if (list_it->second <= expiration) {
++list_it;
break;
}
}
// Insert |broken_alternative_service| into the list and the map.
list_it = broken_alternative_service_list_.insert(
list_it, std::pair(broken_alternative_service, expiration));
broken_alternative_service_map_.emplace(broken_alternative_service, list_it);
*it = list_it;
return true;
}
void BrokenAlternativeServices::ExpireBrokenAlternateProtocolMappings() {
base::TimeTicks now = clock_->NowTicks();
while (!broken_alternative_service_list_.empty()) {
auto it = broken_alternative_service_list_.begin();
if (now < it->second) {
break;
}
delegate_->OnExpireBrokenAlternativeService(
it->first.alternative_service, it->first.network_anonymization_key);
broken_alternative_service_map_.erase(it->first);
broken_alternative_service_list_.erase(it);
}
if (!broken_alternative_service_list_.empty())
ScheduleBrokenAlternateProtocolMappingsExpiration();
}
void BrokenAlternativeServices ::
ScheduleBrokenAlternateProtocolMappingsExpiration() {
DCHECK(!broken_alternative_service_list_.empty());
base::TimeTicks now = clock_->NowTicks();
base::TimeTicks next_expiration =
broken_alternative_service_list_.front().second;
base::TimeDelta delay =
next_expiration > now ? next_expiration - now : base::TimeDelta();
expiration_timer_.Stop();
expiration_timer_.Start(
FROM_HERE, delay,
base::BindOnce(
&BrokenAlternativeServices ::ExpireBrokenAlternateProtocolMappings,
weak_ptr_factory_.GetWeakPtr()));
}
} // namespace net
|