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
|
// Copyright 2008, Google Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#include "net/disk_cache/disk_cache_test_util.h"
#include "base/file_util.h"
#include "base/path_service.h"
#include "net/disk_cache/backend_impl.h"
#include "net/disk_cache/cache_util.h"
#include "net/disk_cache/file.h"
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';
}
std::wstring GetCachePath() {
std::wstring path;
PathService::Get(base::DIR_TEMP, &path);
file_util::AppendToPath(&path, L"cache_test");
if (!file_util::PathExists(path))
file_util::CreateDirectory(path);
return path;
}
bool CreateCacheTestFile(const wchar_t* name) {
using namespace disk_cache;
int flags = OS_FILE_CREATE_ALWAYS | OS_FILE_READ | OS_FILE_WRITE |
OS_FILE_SHARE_READ | OS_FILE_SHARE_WRITE;
scoped_refptr<File> file(new File(CreateOSFile(name, flags, NULL)));
if (!file->IsValid())
return false;
file->SetLength(4 * 1024 * 1024);
return true;
}
bool DeleteCache(const wchar_t* path) {
disk_cache::DeleteCache(path, false);
return true;
}
bool CheckCacheIntegrity(const std::wstring& path) {
scoped_ptr<disk_cache::BackendImpl> cache(new disk_cache::BackendImpl(path));
if (!cache.get())
return false;
if (!cache->Init())
return false;
return cache->SelfCheck() >= 0;
}
// -----------------------------------------------------------------------
int g_cache_tests_max_id = 0;
volatile int g_cache_tests_received = 0;
volatile bool g_cache_tests_error = 0;
// On the actual callback, increase the number of tests received and check for
// errors (an unexpected test received)
void CallbackTest::RunWithParams(const Tuple1<int>& params) {
if (id_ > g_cache_tests_max_id) {
NOTREACHED();
g_cache_tests_error = true;
} else if (reuse_) {
DCHECK(1 == reuse_);
if (2 == reuse_)
g_cache_tests_error = true;
reuse_++;
}
g_cache_tests_received++;
}
// -----------------------------------------------------------------------
// Quits the message loop when all callbacks are called or we've been waiting
// too long for them (2 secs without a callback).
void TimerTask::Run() {
if (g_cache_tests_received > num_callbacks_) {
NOTREACHED();
} else if (g_cache_tests_received == num_callbacks_) {
completed_ = true;
MessageLoop::current()->Quit();
} else {
// Not finished yet. See if we have to abort.
if (last_ == g_cache_tests_received)
num_iterations_++;
else
last_ = g_cache_tests_received;
if (40 == num_iterations_)
MessageLoop::current()->Quit();
}
}
// -----------------------------------------------------------------------
MessageLoopHelper::MessageLoopHelper() {
message_loop_ = MessageLoop::current();
// Create a recurrent timer of 50 mS.
timer_ = message_loop_->timer_manager()->StartTimer(50, &timer_task_, true);
}
MessageLoopHelper::~MessageLoopHelper() {
message_loop_->timer_manager()->StopTimer(timer_);
delete timer_;
}
bool MessageLoopHelper::WaitUntilCacheIoFinished(int num_callbacks) {
if (num_callbacks == g_cache_tests_received)
return true;
timer_task_.ExpectCallbacks(num_callbacks);
message_loop_->Run();
return timer_task_.GetSate();
}
|
