blob: a4b08123f340212053253e65a152ae7613a12c4d (
plain)
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
|
// Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/net/referrer.h"
#include "base/logging.h"
namespace chrome_browser_net {
void Referrer::SuggestHost(const std::string& host) {
if (host.empty())
return;
if (kMaxSuggestions <= size()) {
DeleteLeastUseful();
DCHECK(kMaxSuggestions > size());
}
// Add in the new suggestion.
(*this)[host];
}
void Referrer::DeleteLeastUseful() {
std::string least_useful_name;
// We use longs for durations because we will use multiplication on them.
int64 least_useful_latency; // Duration in milliseconds.
int64 least_useful_lifetime; // Duration in milliseconds.
const base::Time kNow(base::Time::Now()); // Avoid multiple calls.
for (HostNameMap::iterator it = this->begin(); it != this->end(); ++it) {
int64 lifetime = (kNow - it->second.birth_time()).InMilliseconds();
int64 latency = it->second.latency().InMilliseconds();
if (!least_useful_name.empty()) {
if (!latency && !least_useful_latency) {
// Older name is less useful.
if (lifetime <= least_useful_lifetime)
continue;
} else {
// Compare the ratios latency/lifetime vs.
// least_useful_latency/least_useful_lifetime by cross multiplying (to
// avoid integer division hassles). Overflow's won't happen until
// both latency and lifetime pass about 49 days.
if (latency * least_useful_lifetime >=
least_useful_latency * lifetime) {
continue;
}
}
}
least_useful_name = it->first;
least_useful_latency = latency;
least_useful_lifetime = lifetime;
}
erase(least_useful_name);
}
void Referrer::AccrueValue(const base::TimeDelta& delta,
const std::string host) {
DCHECK(this->find(host) != this->end());
(*this)[host].AccrueValue(delta);
}
} // namespace chrome_browser_net
|
