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
|
// Copyright 2011 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/disk_cache/disk_cache_test_util.h"
#include "base/check_op.h"
#include "base/files/file.h"
#include "base/files/file_path.h"
#include "base/run_loop.h"
#include "base/task/single_thread_task_runner.h"
#include "net/base/net_errors.h"
#include "net/disk_cache/blockfile/backend_impl.h"
#include "net/disk_cache/blockfile/file.h"
#include "net/disk_cache/cache_util.h"
using base::Time;
std::string GenerateKey(bool same_length) {
char key[200];
CacheTestFillBuffer(key, sizeof(key), same_length);
key[199] = '\0';
return std::string(key);
}
void CacheTestFillBuffer(char* buffer, size_t len, bool no_nulls) {
static bool called = false;
if (!called) {
called = true;
int seed = static_cast<int>(Time::Now().ToInternalValue());
srand(seed);
}
for (size_t i = 0; i < len; i++) {
buffer[i] = static_cast<char>(rand());
if (!buffer[i] && no_nulls)
buffer[i] = 'g';
}
if (len && !buffer[0])
buffer[0] = 'g';
}
bool CreateCacheTestFile(const base::FilePath& name) {
int flags = base::File::FLAG_CREATE_ALWAYS | base::File::FLAG_READ |
base::File::FLAG_WRITE;
base::File file(name, flags);
if (!file.IsValid())
return false;
file.SetLength(4 * 1024 * 1024);
return true;
}
bool DeleteCache(const base::FilePath& path) {
disk_cache::DeleteCache(path, false);
return true;
}
bool CheckCacheIntegrity(const base::FilePath& path,
bool new_eviction,
int max_size,
uint32_t mask) {
auto cache = std::make_unique<disk_cache::BackendImpl>(
path, mask, base::SingleThreadTaskRunner::GetCurrentDefault(),
net::DISK_CACHE, nullptr);
if (max_size)
cache->SetMaxSize(max_size);
if (!cache.get())
return false;
if (new_eviction)
cache->SetNewEviction();
cache->SetFlags(disk_cache::kNoRandom);
if (cache->SyncInit() != net::OK)
return false;
return cache->SelfCheck() >= 0;
}
// -----------------------------------------------------------------------
TestBackendResultCompletionCallback::TestBackendResultCompletionCallback() =
default;
TestBackendResultCompletionCallback::~TestBackendResultCompletionCallback() =
default;
disk_cache::BackendResultCallback
TestBackendResultCompletionCallback::callback() {
return base::BindOnce(&TestBackendResultCompletionCallback::SetResult,
base::Unretained(this));
}
TestEntryResultCompletionCallback::TestEntryResultCompletionCallback() =
default;
TestEntryResultCompletionCallback::~TestEntryResultCompletionCallback() =
default;
disk_cache::Backend::EntryResultCallback
TestEntryResultCompletionCallback::callback() {
return base::BindOnce(&TestEntryResultCompletionCallback::SetResult,
base::Unretained(this));
}
TestRangeResultCompletionCallback::TestRangeResultCompletionCallback() =
default;
TestRangeResultCompletionCallback::~TestRangeResultCompletionCallback() =
default;
disk_cache::RangeResultCallback TestRangeResultCompletionCallback::callback() {
return base::BindOnce(&TestRangeResultCompletionCallback::HelpSetResult,
base::Unretained(this));
}
void TestRangeResultCompletionCallback::HelpSetResult(
const disk_cache::RangeResult& result) {
SetResult(result);
}
// -----------------------------------------------------------------------
MessageLoopHelper::MessageLoopHelper() = default;
MessageLoopHelper::~MessageLoopHelper() = default;
bool MessageLoopHelper::WaitUntilCacheIoFinished(int num_callbacks) {
if (num_callbacks == callbacks_called_)
return true;
ExpectCallbacks(num_callbacks);
// Create a recurrent timer of 50 ms.
base::RepeatingTimer timer;
timer.Start(FROM_HERE, base::Milliseconds(50), this,
&MessageLoopHelper::TimerExpired);
run_loop_ = std::make_unique<base::RunLoop>();
run_loop_->Run();
run_loop_.reset();
return completed_;
}
// Quits the message loop when all callbacks are called or we've been waiting
// too long for them (2 secs without a callback).
void MessageLoopHelper::TimerExpired() {
CHECK_LE(callbacks_called_, num_callbacks_);
if (callbacks_called_ == num_callbacks_) {
completed_ = true;
run_loop_->Quit();
} else {
// Not finished yet. See if we have to abort.
if (last_ == callbacks_called_)
num_iterations_++;
else
last_ = callbacks_called_;
if (40 == num_iterations_)
run_loop_->Quit();
}
}
// -----------------------------------------------------------------------
CallbackTest::CallbackTest(MessageLoopHelper* helper,
bool reuse)
: helper_(helper),
reuse_(reuse ? 0 : 1) {
}
CallbackTest::~CallbackTest() = default;
// On the actual callback, increase the number of tests received and check for
// errors (an unexpected test received)
void CallbackTest::Run(int result) {
last_result_ = result;
if (reuse_) {
DCHECK_EQ(1, reuse_);
if (2 == reuse_)
helper_->set_callback_reused_error(true);
reuse_++;
}
helper_->CallbackWasCalled();
}
void CallbackTest::RunWithEntry(disk_cache::EntryResult result) {
last_entry_result_ = std::move(result);
Run(last_entry_result_.net_error());
}
|
