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
|
// Copyright (c) 2009 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/extensions/extensions_quota_service.h"
#include "base/message_loop.h"
#include "base/stl_util.h"
#include "chrome/browser/extensions/extension_function.h"
// If the browser stays open long enough, we reset state once a day.
// Whatever this value is, it should be an order of magnitude longer than
// the longest interval in any of the QuotaLimitHeuristics in use.
static const int kPurgeIntervalInDays = 1;
const char QuotaLimitHeuristic::kGenericOverQuotaError[] =
"This request exceeds available quota.";
ExtensionsQuotaService::ExtensionsQuotaService() {
if (MessageLoop::current() != NULL) { // Null in unit tests.
purge_timer_.Start(FROM_HERE,
base::TimeDelta::FromDays(kPurgeIntervalInDays),
this, &ExtensionsQuotaService::Purge);
}
}
ExtensionsQuotaService::~ExtensionsQuotaService() {
purge_timer_.Stop();
Purge();
}
bool ExtensionsQuotaService::Assess(const std::string& extension_id,
ExtensionFunction* function, const ListValue* args,
const base::TimeTicks& event_time) {
// Lookup function list for extension.
FunctionHeuristicsMap& functions = function_heuristics_[extension_id];
// Lookup heuristics for function, create if necessary.
QuotaLimitHeuristics& heuristics = functions[function->name()];
if (heuristics.empty())
function->GetQuotaLimitHeuristics(&heuristics);
if (heuristics.empty())
return true; // No heuristic implies no limit.
if (violators_.find(extension_id) != violators_.end())
return false; // Repeat offender.
bool global_decision = true;
for (QuotaLimitHeuristics::iterator heuristic = heuristics.begin();
heuristic != heuristics.end(); ++heuristic) {
// Apply heuristic to each item (bucket).
global_decision = (*heuristic)->ApplyToArgs(args, event_time) &&
global_decision;
}
if (!global_decision) {
PurgeFunctionHeuristicsMap(&functions);
function_heuristics_.erase(extension_id);
violators_.insert(extension_id);
}
return global_decision;
}
void ExtensionsQuotaService::PurgeFunctionHeuristicsMap(
FunctionHeuristicsMap* map) {
FunctionHeuristicsMap::iterator heuristics = map->begin();
while (heuristics != map->end()) {
STLDeleteElements(&heuristics->second);
map->erase(heuristics++);
}
}
void ExtensionsQuotaService::Purge() {
std::map<std::string, FunctionHeuristicsMap>::iterator it =
function_heuristics_.begin();
for (; it != function_heuristics_.end(); function_heuristics_.erase(it++))
PurgeFunctionHeuristicsMap(&it->second);
}
void QuotaLimitHeuristic::Bucket::Reset(const Config& config,
const base::TimeTicks& start) {
num_tokens_ = config.refill_token_count;
expiration_ = start + config.refill_interval;
}
QuotaLimitHeuristic::QuotaLimitHeuristic(const Config& config,
BucketMapper* map)
: config_(config), bucket_mapper_(map) {
}
QuotaLimitHeuristic::~QuotaLimitHeuristic() {}
bool QuotaLimitHeuristic::ApplyToArgs(const ListValue* args,
const base::TimeTicks& event_time) {
BucketList buckets;
bucket_mapper_->GetBucketsForArgs(args, &buckets);
for (BucketList::iterator i = buckets.begin(); i != buckets.end(); ++i) {
if ((*i)->expiration().is_null()) // A brand new bucket.
(*i)->Reset(config_, event_time);
if (!Apply(*i, event_time))
return false; // It only takes one to spoil it for everyone.
}
return true;
}
ExtensionsQuotaService::SustainedLimit::SustainedLimit(
const base::TimeDelta& sustain, const Config& config, BucketMapper* map)
: QuotaLimitHeuristic(config, map),
repeat_exhaustion_allowance_(sustain.InSeconds() /
config.refill_interval.InSeconds()),
num_available_repeat_exhaustions_(repeat_exhaustion_allowance_) {
}
bool ExtensionsQuotaService::TimedLimit::Apply(Bucket* bucket,
const base::TimeTicks& event_time) {
if (event_time > bucket->expiration())
bucket->Reset(config(), event_time);
return bucket->DeductToken();
}
bool ExtensionsQuotaService::SustainedLimit::Apply(Bucket* bucket,
const base::TimeTicks& event_time) {
if (event_time > bucket->expiration()) {
// We reset state for this item and start over again if this request breaks
// the bad cycle that was previously being tracked. This occurs if the
// state in the bucket expired recently (it has been long enough since the
// event that we don't care about the last event), but the bucket still has
// tokens (so pressure was not sustained over that time), OR we are more
// than 1 full refill interval away from the last event (so even if we used
// up all the tokens in the last bucket, nothing happened in the entire
// next refill interval, so it doesn't matter).
if (bucket->has_tokens() || event_time > bucket->expiration() +
config().refill_interval) {
bucket->Reset(config(), event_time);
num_available_repeat_exhaustions_ = repeat_exhaustion_allowance_;
} else if (--num_available_repeat_exhaustions_ > 0) {
// The last interval was saturated with requests, and this is the first
// event in the next interval. If this happens
// repeat_exhaustion_allowance_ times, it's a violation. Reset the bucket
// state to start timing from the end of the last interval (and we'll
// deduct the token below) so we can detect this each time it happens.
bucket->Reset(config(), bucket->expiration());
} else {
// No allowances left; this request is a violation.
return false;
}
}
// We can go negative since we check has_tokens when we get to *next* bucket,
// and for the small interval all that matters is whether we used up all the
// tokens (which is true if num_tokens_ <= 0).
bucket->DeductToken();
return true;
}
|