59823f7f3b
milestone: about 1.6M tests pass git-svn-id: http://skia.googlecode.com/svn/trunk@5035 2bbb7eff-a529-9590-31e7-b0007b416f81
544 lines
17 KiB
C++
544 lines
17 KiB
C++
#include "EdgeWalker_Test.h"
|
|
#include "Intersection_Tests.h"
|
|
#include "SkBitmap.h"
|
|
#include "SkCanvas.h"
|
|
#include "SkPaint.h"
|
|
#include "SkStream.h"
|
|
|
|
#include <algorithm>
|
|
#include <assert.h>
|
|
#include <errno.h>
|
|
#include <pthread.h>
|
|
#include <unistd.h>
|
|
#include <sys/types.h>
|
|
#include <sys/sysctl.h>
|
|
|
|
#undef SkASSERT
|
|
#define SkASSERT(cond) while (!(cond)) { sk_throw(); }
|
|
|
|
static const char marker[] =
|
|
"</div>\n"
|
|
"\n"
|
|
"<script type=\"text/javascript\">\n"
|
|
"\n"
|
|
"var testDivs = [\n";
|
|
#if 0
|
|
static const char filename[] = "../../experimental/Intersection/debugXX.txt";
|
|
#else
|
|
static const char filename[] = "/flash/debug/XX.txt";
|
|
#endif
|
|
|
|
static bool gShowPath = false;
|
|
static bool gComparePaths = true;
|
|
//static bool gDrawLastAsciiPaths = true;
|
|
static bool gDrawAllAsciiPaths = false;
|
|
static bool gShowAsciiPaths = false;
|
|
static bool gComparePathsAssert = false;
|
|
static bool gPathStrAssert = true;
|
|
|
|
void showPath(const SkPath& path, const char* str) {
|
|
SkDebugf("%s\n", !str ? "original:" : str);
|
|
SkPath::Iter iter(path, true);
|
|
uint8_t verb;
|
|
SkPoint pts[4];
|
|
while ((verb = iter.next(pts)) != SkPath::kDone_Verb) {
|
|
switch (verb) {
|
|
case SkPath::kMove_Verb:
|
|
SkDebugf("path.moveTo(%1.9g, %1.9g);\n", pts[0].fX, pts[0].fY);
|
|
continue;
|
|
case SkPath::kLine_Verb:
|
|
SkDebugf("path.lineTo(%1.9g, %1.9g);\n", pts[1].fX, pts[1].fY);
|
|
break;
|
|
case SkPath::kQuad_Verb:
|
|
SkDebugf("path.quadTo(%1.9g, %1.9g, %1.9g, %1.9g);\n",
|
|
pts[1].fX, pts[1].fY, pts[2].fX, pts[2].fY);
|
|
break;
|
|
case SkPath::kCubic_Verb:
|
|
SkDebugf("path.cubicTo(%1.9g, %1.9g, %1.9g, %1.9g);\n",
|
|
pts[1].fX, pts[1].fY, pts[2].fX, pts[2].fY,
|
|
pts[3].fX, pts[3].fY);
|
|
break;
|
|
case SkPath::kClose_Verb:
|
|
SkDebugf("path.close();\n");
|
|
continue;
|
|
default:
|
|
SkDEBUGFAIL("bad verb");
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
|
|
static int pathsDrawTheSame(const SkPath& one, const SkPath& two,
|
|
SkBitmap& bits, SkCanvas* c) {
|
|
SkCanvas* canvasPtr = c;
|
|
if (!c) {
|
|
canvasPtr = new SkCanvas(bits);
|
|
}
|
|
const SkRect& bounds1 = one.getBounds();
|
|
const SkRect& bounds2 = two.getBounds();
|
|
SkRect larger = bounds1;
|
|
larger.join(bounds2);
|
|
int bitWidth = SkScalarCeil(larger.width()) + 2;
|
|
int bitHeight = SkScalarCeil(larger.height()) + 2;
|
|
if (bits.width() < bitWidth * 2 || bits.height() < bitHeight) {
|
|
if (bits.width() >= 200 && false) {
|
|
SkDebugf("%s bitWidth=%d bitHeight=%d\n", __FUNCTION__, bitWidth, bitHeight);
|
|
}
|
|
bits.setConfig(SkBitmap::kARGB_8888_Config, bitWidth * 2, bitHeight);
|
|
bits.allocPixels();
|
|
canvasPtr->setBitmapDevice(bits);
|
|
}
|
|
SkCanvas& canvas = *canvasPtr;
|
|
canvas.drawColor(SK_ColorWHITE);
|
|
SkPaint paint;
|
|
canvas.save();
|
|
canvas.translate(-bounds1.fLeft + 1, -bounds1.fTop + 1);
|
|
canvas.drawPath(one, paint);
|
|
canvas.restore();
|
|
canvas.save();
|
|
canvas.translate(-bounds1.fLeft + 1 + bitWidth, -bounds1.fTop + 1);
|
|
canvas.drawPath(two, paint);
|
|
canvas.restore();
|
|
int errors = 0;
|
|
for (int y = 0; y < bitHeight; ++y) {
|
|
uint32_t* addr1 = bits.getAddr32(0, y);
|
|
uint32_t* addr2 = bits.getAddr32(bitWidth, y);
|
|
for (int x = 0; x < bitWidth; ++x) {
|
|
errors += addr1[x] != addr2[x];
|
|
}
|
|
}
|
|
if (!c) {
|
|
delete canvasPtr;
|
|
}
|
|
return errors;
|
|
}
|
|
|
|
bool drawAsciiPaths(const SkPath& one, const SkPath& two,
|
|
bool drawPaths) {
|
|
if (!drawPaths) {
|
|
return true;
|
|
}
|
|
if (gShowAsciiPaths) {
|
|
showPath(one, "one:");
|
|
showPath(two, "two:");
|
|
}
|
|
const SkRect& bounds1 = one.getBounds();
|
|
const SkRect& bounds2 = two.getBounds();
|
|
SkRect larger = bounds1;
|
|
larger.join(bounds2);
|
|
SkBitmap bits;
|
|
char out[256];
|
|
int bitWidth = SkScalarCeil(larger.width()) + 2;
|
|
if (bitWidth * 2 + 1 >= (int) sizeof(out)) {
|
|
return false;
|
|
}
|
|
int bitHeight = SkScalarCeil(larger.height()) + 2;
|
|
if (bitHeight >= (int) sizeof(out)) {
|
|
return false;
|
|
}
|
|
bits.setConfig(SkBitmap::kARGB_8888_Config, bitWidth * 2, bitHeight);
|
|
bits.allocPixels();
|
|
SkCanvas canvas(bits);
|
|
canvas.drawColor(SK_ColorWHITE);
|
|
SkPaint paint;
|
|
canvas.save();
|
|
canvas.translate(-bounds1.fLeft + 1, -bounds1.fTop + 1);
|
|
canvas.drawPath(one, paint);
|
|
canvas.restore();
|
|
canvas.save();
|
|
canvas.translate(-bounds1.fLeft + 1 + bitWidth, -bounds1.fTop + 1);
|
|
canvas.drawPath(two, paint);
|
|
canvas.restore();
|
|
for (int y = 0; y < bitHeight; ++y) {
|
|
uint32_t* addr1 = bits.getAddr32(0, y);
|
|
int x;
|
|
char* outPtr = out;
|
|
for (x = 0; x < bitWidth; ++x) {
|
|
*outPtr++ = addr1[x] == (uint32_t) -1 ? '_' : 'x';
|
|
}
|
|
*outPtr++ = '|';
|
|
for (x = bitWidth; x < bitWidth * 2; ++x) {
|
|
*outPtr++ = addr1[x] == (uint32_t) -1 ? '_' : 'x';
|
|
}
|
|
*outPtr++ = '\0';
|
|
SkDebugf("%s\n", out);
|
|
}
|
|
return true;
|
|
}
|
|
|
|
static int scaledDrawTheSame(const SkPath& one, const SkPath& two,
|
|
SkScalar a, SkScalar b, bool drawPaths, SkBitmap& bitmap,
|
|
SkCanvas* canvas) {
|
|
SkMatrix scale;
|
|
scale.reset();
|
|
float aScale = 1.21f;
|
|
float bScale = 1.11f;
|
|
scale.preScale(a * aScale, b * bScale);
|
|
SkPath scaledOne, scaledTwo;
|
|
one.transform(scale, &scaledOne);
|
|
two.transform(scale, &scaledTwo);
|
|
int errors = pathsDrawTheSame(scaledOne, scaledTwo, bitmap, canvas);
|
|
if (errors == 0) {
|
|
return 0;
|
|
}
|
|
while (!drawAsciiPaths(scaledOne, scaledTwo, drawPaths)) {
|
|
scale.reset();
|
|
aScale *= 0.5f;
|
|
bScale *= 0.5f;
|
|
scale.preScale(a * aScale, b * bScale);
|
|
one.transform(scale, &scaledOne);
|
|
two.transform(scale, &scaledTwo);
|
|
}
|
|
return errors;
|
|
}
|
|
|
|
static int max = 0;
|
|
|
|
int comparePaths(const SkPath& one, const SkPath& two, SkBitmap& bitmap,
|
|
SkCanvas* canvas) {
|
|
int errors = pathsDrawTheSame(one, two, bitmap, canvas);
|
|
if (errors == 0) {
|
|
return 0;
|
|
}
|
|
drawAsciiPaths(one, two, gDrawAllAsciiPaths);
|
|
for (int x = 9; x <= 33; ++x) {
|
|
errors = scaledDrawTheSame(one, two, x, x - (x >> 2), gDrawAllAsciiPaths,
|
|
bitmap, canvas);
|
|
if (errors == 0) {
|
|
return 0;
|
|
}
|
|
}
|
|
if (!gDrawAllAsciiPaths) {
|
|
const SkRect& bounds1 = one.getBounds();
|
|
const SkRect& bounds2 = two.getBounds();
|
|
SkRect larger = bounds1;
|
|
larger.join(bounds2);
|
|
SkScalar xScale = std::max(32.0f / larger.width(), 1.0f);
|
|
SkScalar yScale = std::max(24.0f / larger.height(), 1.0f);
|
|
errors = scaledDrawTheSame(one, two, xScale, yScale, false, bitmap, canvas);
|
|
if (errors > 5) {
|
|
SkDebugf("\n");
|
|
scaledDrawTheSame(one, two, xScale, yScale, true, bitmap, canvas);
|
|
}
|
|
}
|
|
const int MAX_ERRORS = 20;
|
|
if (errors > max && errors <= MAX_ERRORS) {
|
|
SkDebugf("%s errors=%d\n", __FUNCTION__, errors);
|
|
max = errors;
|
|
}
|
|
if (errors > MAX_ERRORS && gComparePathsAssert) {
|
|
SkDebugf("%s errors=%d\n", __FUNCTION__, errors);
|
|
showPath(one);
|
|
showPath(two, "simplified:");
|
|
SkASSERT(0);
|
|
}
|
|
return errors > MAX_ERRORS ? errors : 0;
|
|
}
|
|
|
|
// doesn't work yet
|
|
void comparePathsTiny(const SkPath& one, const SkPath& two) {
|
|
const SkRect& bounds1 = one.getBounds();
|
|
const SkRect& bounds2 = two.getBounds();
|
|
SkRect larger = bounds1;
|
|
larger.join(bounds2);
|
|
SkBitmap bits;
|
|
int bitWidth = SkScalarCeil(larger.width()) + 2;
|
|
int bitHeight = SkScalarCeil(larger.height()) + 2;
|
|
bits.setConfig(SkBitmap::kA1_Config, bitWidth * 2, bitHeight);
|
|
bits.allocPixels();
|
|
SkCanvas canvas(bits);
|
|
canvas.drawColor(SK_ColorWHITE);
|
|
SkPaint paint;
|
|
canvas.save();
|
|
canvas.translate(-bounds1.fLeft + 1, -bounds1.fTop + 1);
|
|
canvas.drawPath(one, paint);
|
|
canvas.restore();
|
|
canvas.save();
|
|
canvas.translate(-bounds2.fLeft + 1, -bounds2.fTop + 1);
|
|
canvas.drawPath(two, paint);
|
|
canvas.restore();
|
|
for (int y = 0; y < bitHeight; ++y) {
|
|
uint8_t* addr1 = bits.getAddr1(0, y);
|
|
uint8_t* addr2 = bits.getAddr1(bitWidth, y);
|
|
for (int x = 0; x < bits.rowBytes(); ++x) {
|
|
SkASSERT(addr1[x] == addr2[x]);
|
|
}
|
|
}
|
|
}
|
|
|
|
bool testSimplify(const SkPath& path, bool fill, SkPath& out, SkBitmap& bitmap,
|
|
SkCanvas* canvas) {
|
|
if (gShowPath) {
|
|
showPath(path);
|
|
}
|
|
simplify(path, fill, out);
|
|
if (!gComparePaths) {
|
|
return true;
|
|
}
|
|
return comparePaths(path, out, bitmap, canvas) == 0;
|
|
}
|
|
|
|
bool testSimplifyx(const SkPath& path, SkPath& out, State4& state,
|
|
const char* pathStr) {
|
|
if (gShowPath) {
|
|
showPath(path);
|
|
}
|
|
simplifyx(path, out);
|
|
if (!gComparePaths) {
|
|
return true;
|
|
}
|
|
int result = comparePaths(path, out, state.bitmap, state.canvas);
|
|
if (result && gPathStrAssert) {
|
|
char temp[8192];
|
|
bzero(temp, sizeof(temp));
|
|
SkMemoryWStream stream(temp, sizeof(temp));
|
|
outputToStream(state, pathStr, stream);
|
|
SkDebugf(temp);
|
|
SkASSERT(0);
|
|
}
|
|
return result == 0;
|
|
}
|
|
|
|
bool testSimplifyx(const SkPath& path) {
|
|
if (false) {
|
|
showPath(path);
|
|
}
|
|
SkPath out;
|
|
simplifyx(path, out);
|
|
if (false) {
|
|
return true;
|
|
}
|
|
SkBitmap bitmap;
|
|
return comparePaths(path, out, bitmap, 0) == 0;
|
|
}
|
|
|
|
const int maxThreadsAllocated = 64;
|
|
static int maxThreads = 1;
|
|
static int threadIndex;
|
|
State4 threadState[maxThreadsAllocated];
|
|
static int testNumber;
|
|
static const char* testName;
|
|
static bool debugThreads = false;
|
|
|
|
State4* State4::queue = NULL;
|
|
pthread_mutex_t State4::addQueue = PTHREAD_MUTEX_INITIALIZER;
|
|
pthread_cond_t State4::checkQueue = PTHREAD_COND_INITIALIZER;
|
|
|
|
State4::State4() {
|
|
bitmap.setConfig(SkBitmap::kARGB_8888_Config, 150 * 2, 100);
|
|
bitmap.allocPixels();
|
|
canvas = new SkCanvas(bitmap);
|
|
}
|
|
|
|
void createThread(State4* statePtr, void* (*testFun)(void* )) {
|
|
int threadError = pthread_create(&statePtr->threadID, NULL, testFun,
|
|
(void*) statePtr);
|
|
SkASSERT(!threadError);
|
|
}
|
|
|
|
int dispatchTest4(void* (*testFun)(void* ), int a, int b, int c, int d) {
|
|
int testsRun = 0;
|
|
|
|
if (!gRunTestsInOneThread) {
|
|
State4* statePtr;
|
|
pthread_mutex_lock(&State4::addQueue);
|
|
if (threadIndex < maxThreads) {
|
|
statePtr = &threadState[threadIndex];
|
|
statePtr->testsRun = 0;
|
|
statePtr->a = a;
|
|
statePtr->b = b;
|
|
statePtr->c = c;
|
|
statePtr->d = d;
|
|
statePtr->done = false;
|
|
statePtr->index = threadIndex;
|
|
statePtr->last = false;
|
|
if (debugThreads) SkDebugf("%s %d create done=%d last=%d\n", __FUNCTION__,
|
|
statePtr->index, statePtr->done, statePtr->last);
|
|
pthread_cond_init(&statePtr->initialized, NULL);
|
|
++threadIndex;
|
|
createThread(statePtr, testFun);
|
|
} else {
|
|
while (!State4::queue) {
|
|
if (debugThreads) SkDebugf("%s checkQueue\n", __FUNCTION__);
|
|
pthread_cond_wait(&State4::checkQueue, &State4::addQueue);
|
|
}
|
|
statePtr = State4::queue;
|
|
testsRun += statePtr->testsRun;
|
|
statePtr->testsRun = 0;
|
|
statePtr->a = a;
|
|
statePtr->b = b;
|
|
statePtr->c = c;
|
|
statePtr->d = d;
|
|
statePtr->done = false;
|
|
State4::queue = NULL;
|
|
for (int index = 0; index < maxThreads; ++index) {
|
|
if (threadState[index].done) {
|
|
State4::queue = &threadState[index];
|
|
}
|
|
}
|
|
if (debugThreads) SkDebugf("%s %d init done=%d last=%d queued=%d\n", __FUNCTION__,
|
|
statePtr->index, statePtr->done, statePtr->last,
|
|
State4::queue ? State4::queue->index : -1);
|
|
pthread_cond_signal(&statePtr->initialized);
|
|
}
|
|
pthread_mutex_unlock(&State4::addQueue);
|
|
} else {
|
|
State4 state;
|
|
state.a = a;
|
|
state.b = b;
|
|
state.c = c;
|
|
state.d = d;
|
|
(*testFun)(&state);
|
|
testsRun++;
|
|
}
|
|
return testsRun;
|
|
}
|
|
|
|
void initializeTests(const char* test, size_t testNameSize) {
|
|
testName = test;
|
|
if (!gRunTestsInOneThread) {
|
|
int threads = -1;
|
|
size_t size = sizeof(threads);
|
|
sysctlbyname("hw.logicalcpu_max", &threads, &size, NULL, 0);
|
|
if (threads > 0) {
|
|
maxThreads = threads;
|
|
} else {
|
|
maxThreads = 8;
|
|
}
|
|
}
|
|
if (!gRunTestsInOneThread) {
|
|
SkFILEStream inFile("../../experimental/Intersection/op.htm");
|
|
if (inFile.isValid()) {
|
|
SkTDArray<char> inData;
|
|
inData.setCount(inFile.getLength());
|
|
size_t inLen = inData.count();
|
|
inFile.read(inData.begin(), inLen);
|
|
inFile.setPath(NULL);
|
|
char* insert = strstr(inData.begin(), marker);
|
|
if (insert) {
|
|
insert += sizeof(marker) - 1;
|
|
const char* numLoc = insert + 4 /* indent spaces */ + testNameSize - 1;
|
|
testNumber = atoi(numLoc) + 1;
|
|
}
|
|
}
|
|
}
|
|
for (int index = 0; index < maxThreads; ++index) {
|
|
State4* statePtr = &threadState[index];
|
|
strcpy(statePtr->filename, filename);
|
|
SkASSERT(statePtr->filename[sizeof(filename) - 7] == 'X');
|
|
SkASSERT(statePtr->filename[sizeof(filename) - 6] == 'X');
|
|
statePtr->filename[sizeof(filename) - 7] = '0' + index / 10;
|
|
statePtr->filename[sizeof(filename) - 6] = '0' + index % 10;
|
|
}
|
|
threadIndex = 0;
|
|
}
|
|
|
|
void outputProgress(const State4& state, const char* pathStr) {
|
|
if (gRunTestsInOneThread) {
|
|
SkDebugf("%s\n", pathStr);
|
|
} else {
|
|
SkFILEWStream outFile(state.filename);
|
|
if (!outFile.isValid()) {
|
|
SkASSERT(0);
|
|
return;
|
|
}
|
|
outputToStream(state, pathStr, outFile);
|
|
}
|
|
}
|
|
|
|
void outputToStream(const State4& state, const char* pathStr, SkWStream& outFile) {
|
|
outFile.writeText("<div id=\"");
|
|
outFile.writeText(testName);
|
|
outFile.writeDecAsText(testNumber);
|
|
outFile.writeText("\">\n");
|
|
outFile.writeText(pathStr);
|
|
outFile.writeText("</div>\n\n");
|
|
|
|
outFile.writeText(marker);
|
|
outFile.writeText(" ");
|
|
outFile.writeText(testName);
|
|
outFile.writeDecAsText(testNumber);
|
|
outFile.writeText(",\n\n\n");
|
|
|
|
outFile.writeText("static void ");
|
|
outFile.writeText(testName);
|
|
outFile.writeDecAsText(testNumber);
|
|
outFile.writeText("() {\n SkPath path;\n");
|
|
outFile.writeText(pathStr);
|
|
outFile.writeText(" testSimplifyx(path);\n}\n\n");
|
|
outFile.writeText("static void (*firstTest)() = ");
|
|
outFile.writeText(testName);
|
|
outFile.writeDecAsText(testNumber);
|
|
outFile.writeText(";\n\n");
|
|
|
|
outFile.writeText("static struct {\n");
|
|
outFile.writeText(" void (*fun)();\n");
|
|
outFile.writeText(" const char* str;\n");
|
|
outFile.writeText("} tests[] = {\n");
|
|
outFile.writeText(" TEST(");
|
|
outFile.writeText(testName);
|
|
outFile.writeDecAsText(testNumber);
|
|
outFile.writeText("),\n");
|
|
outFile.flush();
|
|
}
|
|
|
|
bool runNextTestSet(State4& state) {
|
|
if (gRunTestsInOneThread) {
|
|
return false;
|
|
}
|
|
pthread_mutex_lock(&State4::addQueue);
|
|
state.done = true;
|
|
State4::queue = &state;
|
|
if (debugThreads) SkDebugf("%s %d checkQueue done=%d last=%d\n", __FUNCTION__, state.index,
|
|
state.done, state.last);
|
|
pthread_cond_signal(&State4::checkQueue);
|
|
while (state.done && !state.last) {
|
|
if (debugThreads) SkDebugf("%s %d done=%d last=%d\n", __FUNCTION__, state.index, state.done, state.last);
|
|
pthread_cond_wait(&state.initialized, &State4::addQueue);
|
|
}
|
|
pthread_mutex_unlock(&State4::addQueue);
|
|
return !state.last;
|
|
}
|
|
|
|
int waitForCompletion() {
|
|
int testsRun = 0;
|
|
if (!gRunTestsInOneThread) {
|
|
pthread_mutex_lock(&State4::addQueue);
|
|
int runningThreads = maxThreads;
|
|
int index;
|
|
while (runningThreads > 0) {
|
|
while (!State4::queue) {
|
|
if (debugThreads) SkDebugf("%s checkQueue\n", __FUNCTION__);
|
|
pthread_cond_wait(&State4::checkQueue, &State4::addQueue);
|
|
}
|
|
while (State4::queue) {
|
|
--runningThreads;
|
|
SkDebugf("•");
|
|
State4::queue->last = true;
|
|
State4* next;
|
|
for (index = 0; index < maxThreads; ++index) {
|
|
State4& test = threadState[index];
|
|
if (test.done && !test.last) {
|
|
next = &test;
|
|
}
|
|
}
|
|
if (debugThreads) SkDebugf("%s %d next=%d deQueue\n", __FUNCTION__,
|
|
State4::queue->index, next ? next->index : -1);
|
|
pthread_cond_signal(&State4::queue->initialized);
|
|
State4::queue = next;
|
|
}
|
|
}
|
|
pthread_mutex_unlock(&State4::addQueue);
|
|
for (index = 0; index < maxThreads; ++index) {
|
|
pthread_join(threadState[index].threadID, NULL);
|
|
testsRun += threadState[index].testsRun;
|
|
}
|
|
SkDebugf("\n");
|
|
}
|
|
#ifdef SK_DEBUG
|
|
gDebugMaxWindSum = SK_MaxS32;
|
|
gDebugMaxWindValue = SK_MaxS32;
|
|
#endif
|
|
return testsRun;
|
|
}
|