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
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
|
/*
* Copyright 2011 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "SkGraphics.h"
#include "Test.h"
#include "SkOSFile.h"
#if SK_SUPPORT_GPU
#include "GrContext.h"
#endif
using namespace skiatest;
// need to explicitly declare this, or we get some weird infinite loop llist
template TestRegistry* TestRegistry::gHead;
class Iter {
public:
Iter(Reporter* r) : fReporter(r) {
r->ref();
fReg = TestRegistry::Head();
}
~Iter() {
fReporter->unref();
}
Test* next() {
if (fReg) {
TestRegistry::Factory fact = fReg->factory();
fReg = fReg->next();
Test* test = fact(NULL);
test->setReporter(fReporter);
return test;
}
return NULL;
}
static int Count() {
const TestRegistry* reg = TestRegistry::Head();
int count = 0;
while (reg) {
count += 1;
reg = reg->next();
}
return count;
}
private:
Reporter* fReporter;
const TestRegistry* fReg;
};
static const char* result2string(Reporter::Result result) {
return result == Reporter::kPassed ? "passed" : "FAILED";
}
class DebugfReporter : public Reporter {
public:
DebugfReporter(bool allowExtendedTest)
: fIndex(0)
, fTotal(0)
, fAllowExtendedTest(allowExtendedTest) {
}
void setIndexOfTotal(int index, int total) {
fIndex = index;
fTotal = total;
}
virtual bool allowExtendedTest() const {
return fAllowExtendedTest;
}
protected:
virtual void onStart(Test* test) {
SkDebugf("[%d/%d] %s...\n", fIndex+1, fTotal, test->getName());
}
virtual void onReport(const char desc[], Reporter::Result result) {
SkDebugf("\t%s: %s\n", result2string(result), desc);
}
virtual void onEnd(Test*) {
if (!this->getCurrSuccess()) {
SkDebugf("---- FAILED\n");
}
}
private:
int fIndex, fTotal;
bool fAllowExtendedTest;
};
static const char* make_canonical_dir_path(const char* path, SkString* storage) {
if (path) {
// clean it up so it always has a trailing searator
size_t len = strlen(path);
if (0 == len) {
path = NULL;
} else if (SkPATH_SEPARATOR != path[len - 1]) {
// resize to len + 1, to make room for searator
storage->set(path, len + 1);
storage->writable_str()[len] = SkPATH_SEPARATOR;
path = storage->c_str();
}
}
return path;
}
static SkString gTmpDir;
const SkString& Test::GetTmpDir() {
return gTmpDir;
}
static SkString gResourcePath;
const SkString& Test::GetResourcePath() {
return gResourcePath;
}
int tool_main(int argc, char** argv);
int tool_main(int argc, char** argv) {
#if SK_ENABLE_INST_COUNT
gPrintInstCount = true;
#endif
bool allowExtendedTest = false;
bool verboseOutput = false;
SkGraphics::Init();
const char* matchStr = NULL;
char* const* stop = argv + argc;
for (++argv; argv < stop; ++argv) {
if (0 == strcmp(*argv, "--match") || 0 == strcmp(*argv, "-m")) {
++argv;
if (argv < stop && **argv) {
matchStr = *argv;
} else {
SkDebugf("no following argument to --match\n");
return -1;
}
} else if (0 == strcmp(*argv, "--tmpDir") || 0 == strcmp(*argv, "-t")) {
++argv;
if (argv < stop && **argv) {
make_canonical_dir_path(*argv, &gTmpDir);
} else {
SkDebugf("no following argument to --tmpDir\n");
return -1;
}
} else if (0 == strcmp(*argv, "--resourcePath") || 0 == strcmp(*argv, "-i")) {
argv++;
if (argv < stop && **argv) {
make_canonical_dir_path(*argv, &gResourcePath);
}
} else if (0 == strcmp(*argv, "--extendedTest") || 0 == strcmp(*argv, "-x")) {
allowExtendedTest = true;
} else if (0 == strcmp(*argv, "--verbose") || 0 == strcmp(*argv, "-v")) {
verboseOutput = true;
} else {
if (0 != strcmp(*argv, "--help") && 0 != strcmp(*argv, "-h")
&& 0 != strcmp(*argv, "-?")) {
SkDebugf("Unknown option %s. ", *argv);
}
SkDebugf("Skia UnitTests options are:\n");
SkDebugf(" -m --match [test-name-substring]\n");
SkDebugf(" -t --tmpDir [dir]\n");
SkDebugf(" -i --resourcePath [dir]\n");
SkDebugf(" -x --extendedTest\n");
SkDebugf(" -v --verbose\n");
return 1;
}
}
{
SkString header("Skia UnitTests:");
if (matchStr) {
header.appendf(" --match %s", matchStr);
}
if (!gTmpDir.isEmpty()) {
header.appendf(" --tmpDir %s", gTmpDir.c_str());
}
if (!gResourcePath.isEmpty()) {
header.appendf(" --resourcePath %s", gResourcePath.c_str());
}
#ifdef SK_DEBUG
header.append(" SK_DEBUG");
#else
header.append(" SK_RELEASE");
#endif
#ifdef SK_SCALAR_IS_FIXED
header.append(" SK_SCALAR_IS_FIXED");
#else
header.append(" SK_SCALAR_IS_FLOAT");
#endif
SkDebugf("%s\n", header.c_str());
}
DebugfReporter reporter(allowExtendedTest);
Iter iter(&reporter);
Test* test;
const int count = Iter::Count();
int index = 0;
int failCount = 0;
int skipCount = 0;
while ((test = iter.next()) != NULL) {
reporter.setIndexOfTotal(index, count);
if (NULL != matchStr && !strstr(test->getName(), matchStr)) {
++skipCount;
} else {
if (!test->run()) {
++failCount;
}
}
SkDELETE(test);
index += 1;
}
SkDebugf("Finished %d tests, %d failures, %d skipped.\n",
count, failCount, skipCount);
int testCount = reporter.countTests();
if (verboseOutput && testCount > 0) {
SkDebugf("Ran %d Internal tests.\n", testCount);
}
#if SK_SUPPORT_GPU
#if GR_CACHE_STATS
GrContext *gr = GpuTest::GetContext();
gr->printCacheStats();
#endif
#endif
SkGraphics::Term();
GpuTest::DestroyContexts();
return (failCount == 0) ? 0 : 1;
}
#if !defined(SK_BUILD_FOR_IOS) && !defined(SK_BUILD_FOR_NACL)
int main(int argc, char * const argv[]) {
return tool_main(argc, (char**) argv);
}
#endif
|
