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
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
|
// 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.
// This is a simple application that stress-tests the crash recovery of the disk
// cache. The main application starts a copy of itself on a loop, checking the
// exit code of the child process. When the child dies in an unexpected way,
// the main application quits.
// The child application has two threads: one to exercise the cache in an
// infinite loop, and another one to asynchronously kill the process.
#include <windows.h>
#include <string>
#include "base/at_exit.h"
#include "base/logging.h"
#include "base/message_loop.h"
#include "base/path_service.h"
#include "base/string_util.h"
#include "base/thread.h"
#include "net/disk_cache/disk_cache.h"
#include "net/disk_cache/disk_cache_test_util.h"
const int kError = -1;
const int kExpectedCrash = 1000000;
// Starts a new process.
int RunSlave(int iteration) {
std::wstring exe;
PathService::Get(base::FILE_EXE, &exe);
std::wstring command = StringPrintf(L"%ls %d", exe.c_str(), iteration);
STARTUPINFO startup_info = {0};
startup_info.cb = sizeof(startup_info);
PROCESS_INFORMATION process_info;
// I really don't care about this call modifying the string.
if (!::CreateProcess(exe.c_str(), const_cast<wchar_t*>(command.c_str()), NULL,
NULL, FALSE, 0, NULL, NULL, &startup_info,
&process_info)) {
printf("Unable to run test\n");
return kError;
}
DWORD reason = ::WaitForSingleObject(process_info.hProcess, INFINITE);
int code;
bool ok = ::GetExitCodeProcess(process_info.hProcess,
reinterpret_cast<PDWORD>(&code)) ? true :
false;
::CloseHandle(process_info.hProcess);
::CloseHandle(process_info.hThread);
if (!ok) {
printf("Unable to get return code\n");
return kError;
}
return code;
}
// Main loop for the master process.
int MasterCode() {
for (int i = 0; i < 100000; i++) {
int ret = RunSlave(i);
if (kExpectedCrash != ret)
return ret;
}
printf("More than enough...\n");
return 0;
}
// -----------------------------------------------------------------------
// This thread will loop forever, adding and removing entries from the cache.
// iteration is the current crash cycle, so the entries on the cache are marked
// to know which instance of the application wrote them.
void StressTheCache(int iteration) {
int cache_size = 0x800000; // 8MB
std::wstring path = GetCachePath();
path.append(L"_stress");
disk_cache::Backend* cache = disk_cache::CreateCacheBackend(path, false,
cache_size);
if (NULL == cache) {
printf("Unable to initialize cache.\n");
return;
}
printf("Iteration %d, initial entries: %d\n", iteration,
cache->GetEntryCount());
int seed = static_cast<int>(Time::Now().ToInternalValue());
srand(seed);
const int kNumKeys = 5000;
const int kNumEntries = 30;
std::string keys[kNumKeys];
disk_cache::Entry* entries[kNumEntries] = {0};
for (int i = 0; i < kNumKeys; i++) {
keys[i] = GenerateKey(true);
}
const int kDataLen = 4000;
char data[kDataLen];
memset(data, 'k', kDataLen);
for (int i = 0;; i++) {
int slot = rand() % kNumEntries;
int key = rand() % kNumKeys;
if (entries[slot])
entries[slot]->Close();
if (!cache->OpenEntry(keys[key], &entries[slot]))
CHECK(cache->CreateEntry(keys[key], &entries[slot]));
sprintf_s(data, "%d %d", iteration, i);
CHECK(kDataLen == entries[slot]->WriteData(0, 0, data, kDataLen, NULL,
false));
if (rand() % 100 > 80) {
key = rand() % kNumKeys;
cache->DoomEntry(keys[key]);
}
if (!(i % 100))
printf("Entries: %d \r", i);
}
}
// We want to prevent the timer thread from killing the process while we are
// waiting for the debugger to attach.
bool g_crashing = false;
class CrashTask : public Task {
public:
CrashTask() {}
~CrashTask() {}
virtual void Run() {
if (g_crashing)
return;
if (rand() % 100 > 1) {
printf("sweet death...\n");
TerminateProcess(GetCurrentProcess(), kExpectedCrash);
}
}
};
// We leak everything here :)
bool StartCrashThread() {
Thread* thread = new Thread("party_crasher");
if (!thread->Start())
return false;
// Create a recurrent timer of 10 secs.
int timer_delay = 10000;
CrashTask* task = new CrashTask();
thread->message_loop()->timer_manager()->StartTimer(timer_delay, task, true);
return true;
}
void CrashHandler(const std::string& str) {
g_crashing = true;
__debugbreak();
}
// -----------------------------------------------------------------------
int main(int argc, const char* argv[]) {
// Setup an AtExitManager so Singleton objects will be destructed.
base::AtExitManager at_exit_manager;
if (argc < 2)
return MasterCode();
logging::SetLogAssertHandler(CrashHandler);
// Some time for the memory manager to flush stuff.
Sleep(3000);
MessageLoop message_loop;
char* end;
long int iteration = strtol(argv[1], &end, 0);
if (!StartCrashThread()) {
printf("failed to start thread\n");
return kError;
}
StressTheCache(iteration);
return 0;
}
|