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
|
// Copyright (c) 2006-2008 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.
// 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 <string>
#include <vector>
#include "base/at_exit.h"
#include "base/command_line.h"
#include "base/debug_util.h"
#include "base/file_path.h"
#include "base/logging.h"
#include "base/message_loop.h"
#include "base/path_service.h"
#include "base/platform_thread.h"
#include "base/process_util.h"
#include "base/string_util.h"
#include "base/thread.h"
#include "net/base/io_buffer.h"
#include "net/disk_cache/backend_impl.h"
#include "net/disk_cache/disk_cache.h"
#include "net/disk_cache/disk_cache_test_util.h"
using base::Time;
const int kError = -1;
const int kExpectedCrash = 100;
// Starts a new process.
int RunSlave(int iteration) {
FilePath exe;
PathService::Get(base::FILE_EXE, &exe);
CommandLine cmdline(exe.ToWStringHack());
cmdline.AppendLooseValue(ASCIIToWide(IntToString(iteration)));
base::ProcessHandle handle;
if (!base::LaunchApp(cmdline, false, false, &handle)) {
printf("Unable to run test\n");
return kError;
}
int exit_code;
if (!base::WaitForExitCode(handle, &exit_code)) {
printf("Unable to get return code\n");
return kError;
}
return exit_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::BackendImpl* cache =
new disk_cache::BackendImpl(FilePath::FromWStringHack(path));
cache->SetFlags(disk_cache::kNoLoadProtection | disk_cache::kNoRandom);
cache->SetMaxSize(cache_size);
cache->SetType(net::DISK_CACHE);
if (!cache->Init()) {
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 kSize = 4000;
scoped_refptr<net::IOBuffer> buffer = new net::IOBuffer(kSize);
memset(buffer->data(), 'k', kSize);
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]));
base::snprintf(buffer->data(), kSize, "%d %d", iteration, i);
CHECK(kSize == entries[slot]->WriteData(0, 0, buffer, kSize, NULL, false));
if (rand() % 100 > 80) {
key = rand() % kNumKeys;
cache->DoomEntry(keys[key]);
}
if (!(i % 100))
printf("Entries: %d \r", i);
MessageLoop::current()->RunAllPending();
}
}
// 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() {
// Keep trying to run.
RunSoon(MessageLoop::current());
if (g_crashing)
return;
if (rand() % 100 > 1) {
printf("sweet death...\n");
#if defined(OS_WIN)
// Windows does more work on _exit() that we would like, so we use Kill.
base::KillProcessById(base::GetCurrentProcId(), kExpectedCrash, false);
#elif defined(OS_POSIX)
// On POSIX, _exit() will terminate the process with minimal cleanup,
// and it is cleaner than killing.
_exit(kExpectedCrash);
#endif
}
}
static void RunSoon(MessageLoop* target_loop) {
int task_delay = 10000; // 10 seconds
CrashTask* task = new CrashTask();
target_loop->PostDelayedTask(FROM_HERE, task, task_delay);
}
};
// We leak everything here :)
bool StartCrashThread() {
base::Thread* thread = new base::Thread("party_crasher");
if (!thread->Start())
return false;
CrashTask::RunSoon(thread->message_loop());
return true;
}
void CrashHandler(const std::string& str) {
g_crashing = true;
DebugUtil::BreakDebugger();
}
// -----------------------------------------------------------------------
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.
PlatformThread::Sleep(3000);
MessageLoop message_loop(MessageLoop::TYPE_IO);
char* end;
long int iteration = strtol(argv[1], &end, 0);
if (!StartCrashThread()) {
printf("failed to start thread\n");
return kError;
}
StressTheCache(iteration);
return 0;
}
|
