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
|
// 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 "extensions/browser/api/feedback_private/access_rate_limiter.h"
#include <memory>
#include "base/test/simple_test_tick_clock.h"
#include "base/time/time.h"
#include "testing/gtest/include/gtest/gtest.h"
class AccessRateLimiterTest : public ::testing::Test {
public:
AccessRateLimiterTest() {
// |test_clock_| must start out at something other than 0, which is
// interpreted as an invalid value.
test_clock_.Advance(base::Milliseconds(100));
}
AccessRateLimiterTest(const AccessRateLimiterTest&) = delete;
AccessRateLimiterTest& operator=(const AccessRateLimiterTest&) = delete;
~AccessRateLimiterTest() override = default;
protected:
// For manually testing time-sensitive behavior.
base::SimpleTestTickClock test_clock_;
// Unit under test.
std::unique_ptr<extensions::AccessRateLimiter> limiter_;
};
TEST_F(AccessRateLimiterTest, MaxAccessCountOfZero) {
limiter_ = std::make_unique<extensions::AccessRateLimiter>(
0, base::Milliseconds(100), &test_clock_);
EXPECT_FALSE(limiter_->AttemptAccess());
EXPECT_FALSE(limiter_->AttemptAccess());
EXPECT_FALSE(limiter_->AttemptAccess());
EXPECT_FALSE(limiter_->AttemptAccess());
EXPECT_FALSE(limiter_->AttemptAccess());
}
TEST_F(AccessRateLimiterTest, NormalRepeatedAccess) {
limiter_ = std::make_unique<extensions::AccessRateLimiter>(
5, base::Milliseconds(100), &test_clock_);
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_FALSE(limiter_->AttemptAccess());
EXPECT_FALSE(limiter_->AttemptAccess());
EXPECT_FALSE(limiter_->AttemptAccess());
EXPECT_FALSE(limiter_->AttemptAccess());
EXPECT_FALSE(limiter_->AttemptAccess());
}
TEST_F(AccessRateLimiterTest, RechargeWhenDry) {
limiter_ = std::make_unique<extensions::AccessRateLimiter>(
5, base::Milliseconds(100), &test_clock_);
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_FALSE(limiter_->AttemptAccess());
test_clock_.Advance(base::Milliseconds(100));
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_FALSE(limiter_->AttemptAccess());
test_clock_.Advance(base::Milliseconds(500));
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_FALSE(limiter_->AttemptAccess());
}
TEST_F(AccessRateLimiterTest, RechargeTimeOfZero) {
limiter_ = std::make_unique<extensions::AccessRateLimiter>(
5, base::Milliseconds(0), &test_clock_);
// Unlimited number of accesses.
for (int i = 0; i < 100; ++i)
EXPECT_TRUE(limiter_->AttemptAccess()) << i;
// Advancing should not make a difference.
test_clock_.Advance(base::Milliseconds(100));
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
test_clock_.Advance(base::Milliseconds(500));
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
}
TEST_F(AccessRateLimiterTest, RechargeToMax) {
limiter_ = std::make_unique<extensions::AccessRateLimiter>(
5, base::Milliseconds(100), &test_clock_);
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_FALSE(limiter_->AttemptAccess());
// Should not exceed the max number of accesses.
test_clock_.Advance(base::Milliseconds(1000));
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_FALSE(limiter_->AttemptAccess());
}
TEST_F(AccessRateLimiterTest, IncrementalRecharge) {
limiter_ = std::make_unique<extensions::AccessRateLimiter>(
5, base::Milliseconds(100), &test_clock_);
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_FALSE(limiter_->AttemptAccess());
// Has not yet hit the full recharge period.
test_clock_.Advance(base::Milliseconds(50));
EXPECT_FALSE(limiter_->AttemptAccess());
// Has finally hit the full recharge period.
test_clock_.Advance(base::Milliseconds(50));
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_FALSE(limiter_->AttemptAccess());
// This only recharges two full periods.
test_clock_.Advance(base::Milliseconds(250));
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_FALSE(limiter_->AttemptAccess());
// This finishes recharging three full periods.
test_clock_.Advance(base::Milliseconds(250));
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_FALSE(limiter_->AttemptAccess());
}
TEST_F(AccessRateLimiterTest, IncrementalRechargeToMax) {
limiter_ = std::make_unique<extensions::AccessRateLimiter>(
5, base::Milliseconds(100), &test_clock_);
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_FALSE(limiter_->AttemptAccess());
// This only recharges two full periods.
test_clock_.Advance(base::Milliseconds(250));
// This finishes recharging three full periods, but will not recharge over the
// additional periods.
test_clock_.Advance(base::Milliseconds(450));
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_TRUE(limiter_->AttemptAccess());
EXPECT_FALSE(limiter_->AttemptAccess());
EXPECT_FALSE(limiter_->AttemptAccess());
}
|
