#include "include/core/SkBitmap.h"
#include "include/core/SkCanvas.h"
#include "include/core/SkColor.h"
#include "include/core/SkMatrix.h"
#include "include/core/SkPaint.h"
#include "include/core/SkPath.h"
#include "include/core/SkPathTypes.h"
#include "include/core/SkPoint.h"
#include "include/core/SkRect.h"
#include "include/core/SkRegion.h"
#include "include/core/SkScalar.h"
#include "include/core/SkStream.h"
#include "include/core/SkString.h"
#include "include/core/SkTypes.h"
#include "include/private/base/SkDebug.h"
#include "include/private/base/SkMutex.h"
#include "include/private/base/SkTDArray.h"
#include "include/utils/SkParsePath.h"
#include "src/base/SkFloatBits.h"
#include "src/core/SkPathPriv.h"
#include "src/pathops/SkPathOpsDebug.h"
#include "tests/PathOpsDebug.h"
#include "tests/PathOpsExtendedTest.h"
#include "tests/PathOpsThreadedCommon.h"
#include "tests/Test.h"
#include <algorithm>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <vector>
#include <sstream>

Enumerations
enum class	ExpectSuccess { kNo , kYes , kFlaky }

enum class	SkipAssert { kNo , kYes }

enum class	ExpectMatch { kNo , kYes , kFlaky }

Functions
template<typename T >
std::string	std_to_string (T value)

bool	OpDebug (const SkPath &one, const SkPath &two, SkPathOp op, SkPath result SkDEBUGPARAMS(bool skipAssert) SkDEBUGPARAMS(const char testName))

bool	SimplifyDebug (const SkPath &one, SkPath result SkDEBUGPARAMS(bool skipAssert) SkDEBUGPARAMS(const char testName))

void	showOp (const SkPathOp op)

static void	scaleMatrix (const SkPath &one, const SkPath &two, SkMatrix &scale)

static int	pathsDrawTheSame (SkBitmap &bits, const SkPath &scaledOne, const SkPath &scaledTwo, int &error2x2)

static int	pathsDrawTheSame (const SkPath &one, const SkPath &two, SkBitmap &bits, SkPath &scaledOne, SkPath &scaledTwo, int &error2x2)

bool	drawAsciiPaths (const SkPath &one, const SkPath &two, bool drawPaths)

int	comparePaths (skiatest::Reporter reporter, const char filename, const SkPath &one, const SkPath &two, SkBitmap &bitmap)

static void	showPathOpPath (const char *testName, const SkPath &one, const SkPath &two, const SkPath &a, const SkPath &b, const SkPath &scaledOne, const SkPath &scaledTwo, const SkPathOp shapeOp, const SkMatrix &scale)

static int	comparePaths (skiatest::Reporter reporter, const char testName, const SkPath &one, const SkPath &scaledOne, const SkPath &two, const SkPath &scaledTwo, SkBitmap &bitmap, const SkPath &a, const SkPath &b, const SkPathOp shapeOp, const SkMatrix &scale, ExpectMatch expectMatch)

static void	appendTestName (const char *nameSuffix, std::string &out)

static void	appendTest (const char pathStr, const char pathPrefix, const char nameSuffix, const char testFunction, bool twoPaths, std::string &out)

void	markTestFlakyForPathKit ()

bool	testSimplify (SkPath &path, bool useXor, SkPath &out, PathOpsThreadState &state, const char *pathStr)

static void	json_status (ExpectSuccess expectSuccess, ExpectMatch expectMatch, bool opSucceeded)

static void	json_path_out (const SkPath &path, const char pathName, const char fillTypeName, bool lastField)

static bool	check_for_duplicate_names (const char *testName)

static bool	inner_simplify (skiatest::Reporter reporter, const SkPath &path, const char filename, ExpectSuccess expectSuccess, SkipAssert skipAssert, ExpectMatch expectMatch)

bool	testSimplify (skiatest::Reporter reporter, const SkPath &path, const char filename)

bool	testSimplifyFuzz (skiatest::Reporter reporter, const SkPath &path, const char filename)

bool	testSimplifyCheck (skiatest::Reporter reporter, const SkPath &path, const char filename, bool checkFail)

bool	testSimplifyFail (skiatest::Reporter reporter, const SkPath &path, const char filename)

static bool	innerPathOp (skiatest::Reporter reporter, const SkPath &a, const SkPath &b, const SkPathOp shapeOp, const char testName, ExpectSuccess expectSuccess, SkipAssert skipAssert, ExpectMatch expectMatch)

bool	testPathOp (skiatest::Reporter reporter, const SkPath &a, const SkPath &b, const SkPathOp shapeOp, const char testName)

bool	testPathOpCheck (skiatest::Reporter reporter, const SkPath &a, const SkPath &b, const SkPathOp shapeOp, const char testName, bool checkFail)

bool	testPathOpFuzz (skiatest::Reporter reporter, const SkPath &a, const SkPath &b, const SkPathOp shapeOp, const char testName)

bool	testPathOpFail (skiatest::Reporter reporter, const SkPath &a, const SkPath &b, const SkPathOp shapeOp, const char testName)

void	initializeTests (skiatest::Reporter reporter, const char test)

void	RunTestSet (skiatest::Reporter reporter, TestDesc tests[], size_t count, void(firstTest)(skiatest::Reporter , const char filename), void(skipTest)(skiatest::Reporter , const char filename), void(stopTest)(skiatest::Reporter , const char filename), bool reverse)

Variables
std::vector< std::string >	gUniqueNames

static const char	marker []

static const char *	opStrs []

static const char *	opSuffixes []

const int	kBitWidth = 64

const int	kBitHeight = 64

static SkTDArray< SkPathOp >	gTestOp

static int	sTestNumber = 55

static const char *	sTestName = "pathOpTest"

Enumeration Type Documentation

◆ ExpectMatch

enum class ExpectMatch

strong

Enumerator
kNo
kYes
kFlaky

Definition at line 101 of file PathOpsExtendedTest.cpp.

                       {
    kNo,
    kYes,
    kFlaky
};

◆ ExpectSuccess

enum class ExpectSuccess

strong

Enumerator
kNo
kYes
kFlaky

Definition at line 90 of file PathOpsExtendedTest.cpp.

                         {
    kNo,
    kYes,
    kFlaky
};

◆ SkipAssert

enum class SkipAssert

strong

Enumerator
kNo
kYes

Definition at line 96 of file PathOpsExtendedTest.cpp.

                      {
    kNo,
    kYes
};

Function Documentation

◆ appendTest()

static void appendTest	(	const char *	pathStr,
		const char *	pathPrefix,
		const char *	nameSuffix,
		const char *	testFunction,
		bool	twoPaths,
		std::string &	out
	)

static

Definition at line 324 of file PathOpsExtendedTest.cpp.

                                                                                {
#if 0
    out.append("\n<div id=\"");
    appendTestName(nameSuffix, out);
    out.append("\">\n");
    if (pathPrefix) {
        out.append(pathPrefix);
    }
    out.append(pathStr);
    out.append("</div>\n\n");
 
    out.append(marker);
    out.append("    ");
    appendTestName(nameSuffix, out);
    out.append(",\n\n\n");
#endif
    out.append("static void ");
    appendTestName(nameSuffix, out);
    out.append("(skiatest::Reporter* reporter) {\n    SkPath path");
    if (twoPaths) {
        out.append(", pathB");
    }
    out.append(";\n");
    if (pathPrefix) {
        out.append(pathPrefix);
    }
    out += pathStr;
    out += "    ";
    out += testFunction;
#if 0
    out.append("static void (*firstTest)() = ");
    appendTestName(nameSuffix, out);
    out.append(";\n\n");
 
    out.append("static struct {\n");
    out.append("    void (*fun)();\n");
    out.append("    const char* str;\n");
    out.append("} tests[] = {\n");
    out.append("    TEST(");
    appendTestName(nameSuffix, out);
    out.append("),\n");
#endif
}

◆ appendTestName()

static void appendTestName	(	const char *	nameSuffix,
		std::string &	out
	)

static

Definition at line 315 of file PathOpsExtendedTest.cpp.

                                                                   {
    out += sTestName;
    out += std_to_string(sTestNumber);
    ++sTestNumber;
    if (nameSuffix) {
        out.append(nameSuffix);
    }
}

◆ check_for_duplicate_names()

static bool check_for_duplicate_names ( const char * testName )

static

Definition at line 464 of file PathOpsExtendedTest.cpp.

                                                            {
    if (PathOpsDebug::gCheckForDuplicateNames) {
        if (gUniqueNames.end() != std::find(gUniqueNames.begin(), gUniqueNames.end(),
                std::string(testName))) {
            SkDebugf("%s", "");  // convenience for setting breakpoints
        }
        gUniqueNames.push_back(std::string(testName));
        return true;
    }
    return false;
}

◆ comparePaths() [1/2]

int comparePaths	(	skiatest::Reporter *	reporter,
		const char *	filename,
		const SkPath &	one,
		const SkPath &	two,
		SkBitmap &	bitmap
	)

Definition at line 252 of file PathOpsExtendedTest.cpp.

                                             {
    int errors2x2;
    SkPath scaledOne, scaledTwo;
    (void) pathsDrawTheSame(one, two, bitmap, scaledOne, scaledTwo, errors2x2);
    if (errors2x2 == 0) {
        return 0;
    }
    const int MAX_ERRORS = 9;
    return errors2x2 > MAX_ERRORS ? errors2x2 : 0;
}

◆ comparePaths() [2/2]

static int comparePaths	(	skiatest::Reporter *	reporter,
		const char *	testName,
		const SkPath &	one,
		const SkPath &	scaledOne,
		const SkPath &	two,
		const SkPath &	scaledTwo,
		SkBitmap &	bitmap,
		const SkPath &	a,
		const SkPath &	b,
		const SkPathOp	shapeOp,
		const SkMatrix &	scale,
		ExpectMatch	expectMatch
	)

static

Definition at line 284 of file PathOpsExtendedTest.cpp.

                                 {
    static SkMutex& compareDebugOut3 = *(new SkMutex);
    int errors2x2;
    const int MAX_ERRORS = 8;
    (void) pathsDrawTheSame(bitmap, scaledOne, scaledTwo, errors2x2);
    if (ExpectMatch::kNo == expectMatch) {
        if (errors2x2 < MAX_ERRORS) {
            REPORTER_ASSERT(reporter, 0);
        }
        return 0;
    }
    if (errors2x2 == 0) {
        return 0;
    }
    if (ExpectMatch::kYes == expectMatch && errors2x2 >= MAX_ERRORS) {
        SkAutoMutexExclusive autoM(compareDebugOut3);
        showPathOpPath(testName, one, two, a, b, scaledOne, scaledTwo, shapeOp, scale);
        SkDebugf("\n/*");
        REPORTER_ASSERT(reporter, 0);
        SkDebugf(" */\n");
    }
    return errors2x2 >= MAX_ERRORS ? errors2x2 : 0;
}

◆ drawAsciiPaths()

bool drawAsciiPaths	(	const SkPath &	one,
		const SkPath &	two,
		bool	drawPaths
	)

Definition at line 205 of file PathOpsExtendedTest.cpp.

                                                                          {
    if (!drawPaths) {
        return true;
    }
    const SkRect& bounds1 = one.getBounds();
    const SkRect& bounds2 = two.getBounds();
    SkRect larger = bounds1;
    larger.join(bounds2);
    SkBitmap bits;
    char out[256];
    int bitWidth = SkScalarCeilToInt(larger.width()) + 2;
    if (bitWidth * 2 + 1 >= (int) sizeof(out)) {
        return false;
    }
    int bitHeight = SkScalarCeilToInt(larger.height()) + 2;
    if (bitHeight >= (int) sizeof(out)) {
        return false;
    }
    bits.allocN32Pixels(bitWidth * 2, bitHeight);
    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;
}

◆ initializeTests()

void initializeTests	(	skiatest::Reporter *	reporter,
		const char *	test
	)

Definition at line 650 of file PathOpsExtendedTest.cpp.

                                                                   {
    static SkMutex& mu = *(new SkMutex);
    if (reporter->verbose()) {
        SkAutoMutexExclusive lock(mu);
        sTestName = test;
        size_t testNameSize = strlen(test);
        SkFILEStream inFile("../../experimental/Intersection/op.htm");
        if (inFile.isValid()) {
            SkTDArray<char> inData;
            inData.resize((int) inFile.getLength());
            size_t inLen = inData.size();
            inFile.read(inData.begin(), inLen);
            inFile.close();
            char* insert = strstr(inData.begin(), marker);
            if (insert) {
                insert += sizeof(marker) - 1;
                const char* numLoc = insert + 4 /* indent spaces */ + testNameSize - 1;
                sTestNumber = atoi(numLoc) + 1;
            }
        }
    }
}

◆ inner_simplify()

static bool inner_simplify	(	skiatest::Reporter *	reporter,
		const SkPath &	path,
		const char *	filename,
		ExpectSuccess	expectSuccess,
		SkipAssert	skipAssert,
		ExpectMatch	expectMatch
	)

static

Definition at line 476 of file PathOpsExtendedTest.cpp.

                                                                                     {
    if (PathOpsDebug::gJson) {
        if (check_for_duplicate_names(filename)) {
            return true;
        }
        if (!PathOpsDebug::gOutFirst) {
            fprintf(PathOpsDebug::gOut, ",\n");
        }
        PathOpsDebug::gOutFirst = false;
        fprintf(PathOpsDebug::gOut, "\"%s\": {\n", filename);
        json_path_out(path, "path", "", false);
    }
    SkPath out;
    if (!SimplifyDebug(path, &out  SkDEBUGPARAMS(SkipAssert::kYes == skipAssert)
            SkDEBUGPARAMS(sTestName))) {
        if (ExpectSuccess::kYes == expectSuccess) {
            SkDebugf("%s did not expect %s failure\n", __FUNCTION__, filename);
            REPORTER_ASSERT(reporter, 0);
        }
        if (PathOpsDebug::gJson) {
            json_status(expectSuccess, expectMatch, false);
            fprintf(PathOpsDebug::gOut, "  \"out\": \"\"\n}");
        }
        return false;
    } else {
        if (ExpectSuccess::kNo == expectSuccess) {
            SkDebugf("%s %s unexpected success\n", __FUNCTION__, filename);
            REPORTER_ASSERT(reporter, 0);
        }
        if (PathOpsDebug::gJson) {
            json_status(expectSuccess, expectMatch, true);
            json_path_out(out, "out", "Out", true);
        }
    }
    SkBitmap bitmap;
    int errors = comparePaths(reporter, filename, path, out, bitmap);
    if (ExpectMatch::kNo == expectMatch) {
        if (!errors) {
            SkDebugf("%s failing test %s now succeeds\n", __FUNCTION__, filename);
            REPORTER_ASSERT(reporter, 0);
            return false;
        }
    } else if (ExpectMatch::kYes == expectMatch && errors) {
        REPORTER_ASSERT(reporter, 0);
    }
    reporter->bumpTestCount();
    return errors == 0;
}

◆ innerPathOp()

static bool innerPathOp	(	skiatest::Reporter *	reporter,
		const SkPath &	a,
		const SkPath &	b,
		const SkPathOp	shapeOp,
		const char *	testName,
		ExpectSuccess	expectSuccess,
		SkipAssert	skipAssert,
		ExpectMatch	expectMatch
	)

static

Definition at line 547 of file PathOpsExtendedTest.cpp.

                                                        {
    if (PathOpsDebug::gJson) {
        if (check_for_duplicate_names(testName)) {
            return true;
        }
        if (!PathOpsDebug::gOutFirst) {
            fprintf(PathOpsDebug::gOut, ",\n");
        }
        PathOpsDebug::gOutFirst = false;
        fprintf(PathOpsDebug::gOut, "\"%s\": {\n", testName);
        json_path_out(a, "p1", "1", false);
        json_path_out(b, "p2", "2", false);
        fprintf(PathOpsDebug::gOut, "  \"op\": \"%s\",\n", opStrs[shapeOp]);
    }
    SkPath out;
    if (!OpDebug(a, b, shapeOp, &out  SkDEBUGPARAMS(SkipAssert::kYes == skipAssert)
            SkDEBUGPARAMS(testName))) {
        if (ExpectSuccess::kYes == expectSuccess) {
            SkDebugf("%s %s did not expect failure\n", __FUNCTION__, testName);
            REPORTER_ASSERT(reporter, 0);
        }
        if (PathOpsDebug::gJson) {
            json_status(expectSuccess, expectMatch, false);
            fprintf(PathOpsDebug::gOut, "  \"out\": \"\"\n}");
        }
        return false;
    } else {
        if (ExpectSuccess::kNo == expectSuccess) {
                SkDebugf("%s %s unexpected success\n", __FUNCTION__, testName);
                REPORTER_ASSERT(reporter, 0);
        }
        if (PathOpsDebug::gJson) {
            json_status(expectSuccess, expectMatch, true);
            json_path_out(out, "out", "Out", true);
        }
    }
    if (!reporter->verbose()) {
        return true;
    }
    SkPath pathOut, scaledPathOut;
    SkRegion rgnA, rgnB, openClip, rgnOut;
    openClip.setRect({-16000, -16000, 16000, 16000});
    rgnA.setPath(a, openClip);
    rgnB.setPath(b, openClip);
    rgnOut.op(rgnA, rgnB, (SkRegion::Op) shapeOp);
    rgnOut.getBoundaryPath(&pathOut);
 
    SkMatrix scale;
    scaleMatrix(a, b, scale);
    SkRegion scaledRgnA, scaledRgnB, scaledRgnOut;
    SkPath scaledA, scaledB;
    scaledA.addPath(a, scale);
    scaledA.setFillType(a.getFillType());
    scaledB.addPath(b, scale);
    scaledB.setFillType(b.getFillType());
    scaledRgnA.setPath(scaledA, openClip);
    scaledRgnB.setPath(scaledB, openClip);
    scaledRgnOut.op(scaledRgnA, scaledRgnB, (SkRegion::Op) shapeOp);
    scaledRgnOut.getBoundaryPath(&scaledPathOut);
    SkBitmap bitmap;
    SkPath scaledOut;
    scaledOut.addPath(out, scale);
    scaledOut.setFillType(out.getFillType());
    int result = comparePaths(reporter, testName, pathOut, scaledPathOut, out, scaledOut, bitmap,
            a, b, shapeOp, scale, expectMatch);
    reporter->bumpTestCount();
    return result == 0;
}

◆ json_path_out()

static void json_path_out	(	const SkPath &	path,
		const char *	pathName,
		const char *	fillTypeName,
		bool	lastField
	)

static

Definition at line 423 of file PathOpsExtendedTest.cpp.

                        {
    char const * const gFillTypeStrs[] = {
        "Winding",
        "EvenOdd",
        "InverseWinding",
        "InverseEvenOdd",
    };
    if (PathOpsDebug::gOutputSVG) {
        SkString svg = SkParsePath::ToSVGString(path);
        fprintf(PathOpsDebug::gOut, "  \"%s\": \"%s\",\n", pathName, svg.c_str());
    } else {
                                 // MOVE, LINE, QUAD, CONIC, CUBIC, CLOSE
        const int verbConst[] =  {     0,    1,    2,     3,     4,     5 };
        const int pointIndex[] = {     0,    1,    1,     1,     1,     0 };
        const int pointCount[] = {     1,    2,    3,     3,     4,     0 };
        fprintf(PathOpsDebug::gOut, "  \"%s\": [", pathName);
        bool first = true;
        for (auto [verb, points, w] : SkPathPriv::Iterate(path)) {
            if (first) {
                first = false;
            } else {
                fprintf(PathOpsDebug::gOut, ",\n    ");
            }
            int verbIndex = (int) verb;
            fprintf(PathOpsDebug::gOut, "[%d", verbConst[verbIndex]);
            for (int i = pointIndex[verbIndex]; i < pointCount[verbIndex]; ++i) {
                fprintf(PathOpsDebug::gOut, ", \"0x%08x\", \"0x%08x\"",
                        SkFloat2Bits(points[i].fX), SkFloat2Bits(points[i].fY));
            }
            if (SkPathVerb::kConic == verb) {
                fprintf(PathOpsDebug::gOut, ", \"0x%08x\"", SkFloat2Bits(*w));
            }
            fprintf(PathOpsDebug::gOut, "]");
        }
        fprintf(PathOpsDebug::gOut, "],\n");
    }
    fprintf(PathOpsDebug::gOut, "  \"fillType%s\": \"k%s_FillType\"%s", fillTypeName,
            gFillTypeStrs[(int) path.getFillType()], lastField ? "\n}" : ",\n");
}

◆ json_status()

static void json_status	(	ExpectSuccess	expectSuccess,
		ExpectMatch	expectMatch,
		bool	opSucceeded
	)

static

Definition at line 409 of file PathOpsExtendedTest.cpp.

                                                                                                {
    fprintf(PathOpsDebug::gOut, "  \"expectSuccess\": \"%s\",\n",
            ExpectSuccess::kNo == expectSuccess ? "no" :
            ExpectSuccess::kYes == expectSuccess ? "yes" : "flaky");
    if (PathOpsDebug::gMarkJsonFlaky) {
        expectMatch = ExpectMatch::kFlaky;
        PathOpsDebug::gMarkJsonFlaky = false;
    }
    fprintf(PathOpsDebug::gOut, "  \"expectMatch\": \"%s\",\n",
            ExpectMatch::kNo == expectMatch ? "no" :
            ExpectMatch::kYes == expectMatch ? "yes" : "flaky");
    fprintf(PathOpsDebug::gOut, "  \"succeeded\": %s,\n", opSucceeded ? "true" : "false");
}

◆ markTestFlakyForPathKit()

void markTestFlakyForPathKit ( )

Definition at line 369 of file PathOpsExtendedTest.cpp.

                               {
    if (PathOpsDebug::gJson) {
        SkASSERT(!PathOpsDebug::gMarkJsonFlaky);
        PathOpsDebug::gMarkJsonFlaky = true;
    }
}

◆ OpDebug()

bool OpDebug	(	const SkPath &	one,
		const SkPath &	two,
		SkPathOp	op,
		SkPath *result	SkDEBUGPARAMSbool skipAssert) SkDEBUGPARAMS(const char *testName
	)

Definition at line 252 of file SkPathOpsOp.cpp.

                                                                            {
#if DEBUG_DUMP_VERIFY
#ifndef SK_DEBUG
    const char* testName = "release";
#endif
    if (SkPathOpsDebug::gDumpOp) {
        DumpOp(one, two, op, testName);
    }
#endif
    op = gOpInverse[op][one.isInverseFillType()][two.isInverseFillType()];
    bool inverseFill = gOutInverse[op][one.isInverseFillType()][two.isInverseFillType()];
    SkPathFillType fillType = inverseFill ? SkPathFillType::kInverseEvenOdd :
            SkPathFillType::kEvenOdd;
    SkRect rect1, rect2;
    if (kIntersect_SkPathOp == op && one.isRect(&rect1) && two.isRect(&rect2)) {
        result->reset();
        result->setFillType(fillType);
        if (rect1.intersect(rect2)) {
            result->addRect(rect1);
        }
        return true;
    }
    if (one.isEmpty() || two.isEmpty()) {
        SkPath work;
        switch (op) {
            case kIntersect_SkPathOp:
                break;
            case kUnion_SkPathOp:
            case kXOR_SkPathOp:
                work = one.isEmpty() ? two : one;
                break;
            case kDifference_SkPathOp:
                if (!one.isEmpty()) {
                    work = one;
                }
                break;
            case kReverseDifference_SkPathOp:
                if (!two.isEmpty()) {
                    work = two;
                }
                break;
            default:
                SkASSERT(0);  // unhandled case
        }
        if (inverseFill != work.isInverseFillType()) {
            work.toggleInverseFillType();
        }
        return Simplify(work, result);
    }
    SkSTArenaAlloc<4096> allocator;  // FIXME: add a constant expression here, tune
    SkOpContour contour;
    SkOpContourHead* contourList = static_cast<SkOpContourHead*>(&contour);
    SkOpGlobalState globalState(contourList, &allocator
            SkDEBUGPARAMS(skipAssert) SkDEBUGPARAMS(testName));
    SkOpCoincidence coincidence(&globalState);
    const SkPath* minuend = &one;
    const SkPath* subtrahend = &two;
    if (op == kReverseDifference_SkPathOp) {
        using std::swap;
        swap(minuend, subtrahend);
        op = kDifference_SkPathOp;
    }
#if DEBUG_SORT
    SkPathOpsDebug::gSortCount = SkPathOpsDebug::gSortCountDefault;
#endif
    // turn path into list of segments
    SkOpEdgeBuilder builder(*minuend, contourList, &globalState);
    if (builder.unparseable()) {
        return false;
    }
    const int xorMask = builder.xorMask();
    builder.addOperand(*subtrahend);
    if (!builder.finish()) {
        return false;
    }
#if DEBUG_DUMP_SEGMENTS
    contourList->dumpSegments("seg", op);
#endif
 
    const int xorOpMask = builder.xorMask();
    if (!SortContourList(&contourList, xorMask == kEvenOdd_PathOpsMask,
            xorOpMask == kEvenOdd_PathOpsMask)) {
        result->reset();
        result->setFillType(fillType);
        return true;
    }
    // find all intersections between segments
    SkOpContour* current = contourList;
    do {
        SkOpContour* next = current;
        while (AddIntersectTs(current, next, &coincidence)
                && (next = next->next()))
            ;
    } while ((current = current->next()));
#if DEBUG_VALIDATE
    globalState.setPhase(SkOpPhase::kWalking);
#endif
    bool success = HandleCoincidence(contourList, &coincidence);
#if DEBUG_COIN
    globalState.debugAddToGlobalCoinDicts();
#endif
    if (!success) {
        return false;
    }
#if DEBUG_ALIGNMENT
    contourList->dumpSegments("aligned");
#endif
    // construct closed contours
    SkPath original = *result;
    result->reset();
    result->setFillType(fillType);
    SkPathWriter wrapper(*result);
    if (!bridgeOp(contourList, op, xorMask, xorOpMask, &wrapper)) {
        *result = original;
        return false;
    }
    wrapper.assemble();  // if some edges could not be resolved, assemble remaining
#if DEBUG_T_SECT_LOOP_COUNT
    static SkMutex& debugWorstLoop = *(new SkMutex);
    {
        SkAutoMutexExclusive autoM(debugWorstLoop);
        if (!gVerboseFinalize) {
            gVerboseFinalize = &ReportPathOpsDebugging;
        }
        debugWorstState.debugDoYourWorst(&globalState);
    }
#endif
    return true;
}

◆ pathsDrawTheSame() [1/2]

static int pathsDrawTheSame	(	const SkPath &	one,
		const SkPath &	two,
		SkBitmap &	bits,
		SkPath &	scaledOne,
		SkPath &	scaledTwo,
		int &	error2x2
	)

static

Definition at line 196 of file PathOpsExtendedTest.cpp.

                                          {
    SkMatrix scale;
    scaleMatrix(one, two, scale);
    one.transform(scale, &scaledOne);
    two.transform(scale, &scaledTwo);
    return pathsDrawTheSame(bits, scaledOne, scaledTwo, error2x2);
}

◆ pathsDrawTheSame() [2/2]

static int pathsDrawTheSame	(	SkBitmap &	bits,
		const SkPath &	scaledOne,
		const SkPath &	scaledTwo,
		int &	error2x2
	)

static

Definition at line 158 of file PathOpsExtendedTest.cpp.

                       {
    if (bits.width() == 0) {
        bits.allocN32Pixels(kBitWidth * 2, kBitHeight);
    }
    SkCanvas canvas(bits);
    canvas.drawColor(SK_ColorWHITE);
    SkPaint paint;
    canvas.save();
    const SkRect& bounds1 = scaledOne.getBounds();
    canvas.translate(-bounds1.fLeft + 1, -bounds1.fTop + 1);
    canvas.drawPath(scaledOne, paint);
    canvas.restore();
    canvas.save();
    canvas.translate(-bounds1.fLeft + 1 + kBitWidth, -bounds1.fTop + 1);
    canvas.drawPath(scaledTwo, paint);
    canvas.restore();
    int errors2 = 0;
    int errors = 0;
    for (int y = 0; y < kBitHeight - 1; ++y) {
        uint32_t* addr1 = bits.getAddr32(0, y);
        uint32_t* addr2 = bits.getAddr32(0, y + 1);
        uint32_t* addr3 = bits.getAddr32(kBitWidth, y);
        uint32_t* addr4 = bits.getAddr32(kBitWidth, y + 1);
        for (int x = 0; x < kBitWidth - 1; ++x) {
            // count 2x2 blocks
            bool err = addr1[x] != addr3[x];
            if (err) {
                errors2 += addr1[x + 1] != addr3[x + 1]
                        && addr2[x] != addr4[x] && addr2[x + 1] != addr4[x + 1];
                errors++;
            }
        }
    }
    error2x2 = errors2;
    return errors;
}

◆ RunTestSet()

void RunTestSet	(	skiatest::Reporter *	reporter,
		TestDesc	tests[],
		size_t	count,
		void()(skiatest::Reporter , const char *filename)	firstTest,
		void()(skiatest::Reporter , const char *filename)	skipTest,
		void()(skiatest::Reporter , const char *filename)	stopTest,
		bool	reverse
	)

Definition at line 691 of file PathOpsExtendedTest.cpp.

                                                                                          {
    size_t index;
    if (firstTest) {
        index = count - 1;
        while (index > 0 && tests[index].fun != firstTest) {
            --index;
        }
        (*tests[index].fun)(reporter, tests[index].str);
        if (tests[index].fun == stopTest) {
            return;
        }
    }
    index = reverse ? count - 1 : 0;
    size_t last = reverse ? 0 : count - 1;
    bool foundSkip = !skipTest;
    do {
        if (tests[index].fun == skipTest) {
            foundSkip = true;
        }
        if (foundSkip && tests[index].fun != firstTest) {
             (*tests[index].fun)(reporter, tests[index].str);
        }
        if (tests[index].fun == stopTest || index == last) {
            break;
        }
        index += reverse ? -1 : 1;
    } while (true);
}

◆ scaleMatrix()

static void scaleMatrix	(	const SkPath &	one,
		const SkPath &	two,
		SkMatrix &	scale
	)

static

Definition at line 132 of file PathOpsExtendedTest.cpp.

                                                                               {
    SkRect larger = one.getBounds();
    larger.join(two.getBounds());
    SkScalar largerWidth = larger.width();
    if (largerWidth < 4) {
        largerWidth = 4;
    }
    SkScalar largerHeight = larger.height();
    if (largerHeight < 4) {
        largerHeight = 4;
    }
    SkScalar hScale = (kBitWidth - 2) / largerWidth;
    SkScalar vScale = (kBitHeight - 2) / largerHeight;
    scale.reset();
    scale.preScale(hScale, vScale);
    larger.fLeft *= hScale;
    larger.fRight *= hScale;
    larger.fTop *= vScale;
    larger.fBottom *= vScale;
    SkScalar dx = -16000 > larger.fLeft ? -16000 - larger.fLeft
            : 16000 < larger.fRight ? 16000 - larger.fRight : 0;
    SkScalar dy = -16000 > larger.fTop ? -16000 - larger.fTop
            : 16000 < larger.fBottom ? 16000 - larger.fBottom : 0;
    scale.postTranslate(dx, dy);
}

◆ showOp()

void showOp ( const SkPathOp op )

Definition at line 107 of file PathOpsExtendedTest.cpp.

                               {
    switch (op) {
        case kDifference_SkPathOp:
            SkDebugf("op difference\n");
            break;
        case kIntersect_SkPathOp:
            SkDebugf("op intersect\n");
            break;
        case kUnion_SkPathOp:
            SkDebugf("op union\n");
            break;
        case kXOR_SkPathOp:
            SkDebugf("op xor\n");
            break;
        case kReverseDifference_SkPathOp:
            SkDebugf("op reverse difference\n");
            break;
        default:
            SkASSERT(0);
    }
}

◆ showPathOpPath()

static void showPathOpPath	(	const char *	testName,
		const SkPath &	one,
		const SkPath &	two,
		const SkPath &	a,
		const SkPath &	b,
		const SkPath &	scaledOne,
		const SkPath &	scaledTwo,
		const SkPathOp	shapeOp,
		const SkMatrix &	scale
	)

static

Definition at line 266 of file PathOpsExtendedTest.cpp.

                                                       {
    SkASSERT((unsigned) shapeOp < std::size(opStrs));
    if (!testName) {
        testName = "xOp";
    }
    SkDebugf("static void %s_%s(skiatest::Reporter* reporter, const char* filename) {\n",
        testName, opSuffixes[shapeOp]);
    *gTestOp.append() = shapeOp;
    SkDebugf("    SkPath path, pathB;\n");
    SkPathOpsDebug::ShowOnePath(a, "path", false);
    SkPathOpsDebug::ShowOnePath(b, "pathB", false);
    SkDebugf("    testPathOp(reporter, path, pathB, %s, filename);\n", opStrs[shapeOp]);
    SkDebugf("}\n");
    drawAsciiPaths(scaledOne, scaledTwo, true);
}

◆ SimplifyDebug()

bool SimplifyDebug	(	const SkPath &	one,
		SkPath *result	SkDEBUGPARAMSbool skipAssert) SkDEBUGPARAMS(const char *testName
	)

Definition at line 205 of file SkPathOpsSimplify.cpp.

                                                                            {
    // returns 1 for evenodd, -1 for winding, regardless of inverse-ness
    SkPathFillType fillType = path.isInverseFillType() ? SkPathFillType::kInverseEvenOdd
            : SkPathFillType::kEvenOdd;
 
    if (path.isConvex()) {
        // If the path is trivially convex, simplify to empty.
        if (path_is_trivial(path)) {
            result->reset();
        } else if (result != &path) {
            *result = path;
        }
        result->setFillType(fillType);
        return true;
    }
    // turn path into list of segments
    SkSTArenaAlloc<4096> allocator;  // FIXME: constant-ize, tune
    SkOpContour contour;
    SkOpContourHead* contourList = static_cast<SkOpContourHead*>(&contour);
    SkOpGlobalState globalState(contourList, &allocator
            SkDEBUGPARAMS(skipAssert) SkDEBUGPARAMS(testName));
    SkOpCoincidence coincidence(&globalState);
#if DEBUG_DUMP_VERIFY
#ifndef SK_DEBUG
    const char* testName = "release";
#endif
    if (SkPathOpsDebug::gDumpOp) {
        DumpSimplify(path, testName);
    }
#endif
#if DEBUG_SORT
    SkPathOpsDebug::gSortCount = SkPathOpsDebug::gSortCountDefault;
#endif
    SkOpEdgeBuilder builder(path, contourList, &globalState);
    if (!builder.finish()) {
        return false;
    }
#if DEBUG_DUMP_SEGMENTS
    contour.dumpSegments();
#endif
    if (!SortContourList(&contourList, false, false)) {
        result->reset();
        result->setFillType(fillType);
        return true;
    }
    // find all intersections between segments
    SkOpContour* current = contourList;
    do {
        SkOpContour* next = current;
        while (AddIntersectTs(current, next, &coincidence)
                && (next = next->next()));
    } while ((current = current->next()));
#if DEBUG_VALIDATE
    globalState.setPhase(SkOpPhase::kWalking);
#endif
    bool success = HandleCoincidence(contourList, &coincidence);
#if DEBUG_COIN
    globalState.debugAddToGlobalCoinDicts();
#endif
    if (!success) {
        return false;
    }
#if DEBUG_DUMP_ALIGNMENT
    contour.dumpSegments("aligned");
#endif
    // construct closed contours
    result->reset();
    result->setFillType(fillType);
    SkPathWriter wrapper(*result);
    if (builder.xorMask() == kWinding_PathOpsMask ? !bridgeWinding(contourList, &wrapper)
            : !bridgeXor(contourList, &wrapper)) {
        return false;
    }
    wrapper.assemble();  // if some edges could not be resolved, assemble remaining
    return true;
}

◆ std_to_string()

template<typename T >

std::string std_to_string ( T value )

Definition at line 52 of file PathOpsExtendedTest.cpp.

{
    std::ostringstream os ;
    os << value ;
    return os.str() ;
}

◆ testPathOp()

bool testPathOp	(	skiatest::Reporter *	reporter,
		const SkPath &	a,
		const SkPath &	b,
		const SkPathOp	shapeOp,
		const char *	testName
	)

Definition at line 618 of file PathOpsExtendedTest.cpp.

                                                      {
    return innerPathOp(reporter, a, b, shapeOp, testName, ExpectSuccess::kYes, SkipAssert::kNo,
            ExpectMatch::kYes);
}

◆ testPathOpCheck()

bool testPathOpCheck	(	skiatest::Reporter *	reporter,
		const SkPath &	a,
		const SkPath &	b,
		const SkPathOp	shapeOp,
		const char *	testName,
		bool	checkFail
	)

Definition at line 624 of file PathOpsExtendedTest.cpp.

                                                                      {
    return innerPathOp(reporter, a, b, shapeOp, testName, checkFail ?
            ExpectSuccess::kYes : ExpectSuccess::kNo, SkipAssert::kNo, ExpectMatch::kNo);
}

◆ testPathOpFail()

bool testPathOpFail	(	skiatest::Reporter *	reporter,
		const SkPath &	a,
		const SkPath &	b,
		const SkPathOp	shapeOp,
		const char *	testName
	)

Definition at line 636 of file PathOpsExtendedTest.cpp.

                                                               {
    SkPath orig;
    orig.lineTo(54, 43);
    SkPath out = orig;
    if (Op(a, b, shapeOp, &out) ) {
        SkDebugf("%s test is expected to fail\n", __FUNCTION__);
        REPORTER_ASSERT(reporter, 0);
        return false;
    }
    SkASSERT(out == orig);
    return true;
}

◆ testPathOpFuzz()

bool testPathOpFuzz	(	skiatest::Reporter *	reporter,
		const SkPath &	a,
		const SkPath &	b,
		const SkPathOp	shapeOp,
		const char *	testName
	)

Definition at line 630 of file PathOpsExtendedTest.cpp.

                                                      {
    return innerPathOp(reporter, a, b, shapeOp, testName, ExpectSuccess::kFlaky, SkipAssert::kYes,
            ExpectMatch::kFlaky);
}

◆ testSimplify() [1/2]

bool testSimplify	(	skiatest::Reporter *	reporter,
		const SkPath &	path,
		const char *	filename
	)

Definition at line 526 of file PathOpsExtendedTest.cpp.

                                                                                        {
    return inner_simplify(reporter, path, filename, ExpectSuccess::kYes, SkipAssert::kNo,
            ExpectMatch::kYes);
}

◆ testSimplify() [2/2]

bool testSimplify	(	SkPath &	path,
		bool	useXor,
		SkPath &	out,
		PathOpsThreadState &	state,
		const char *	pathStr
	)

Definition at line 376 of file PathOpsExtendedTest.cpp.

                                       {
    static SkMutex& simplifyDebugOut = *(new SkMutex);
    SkPathFillType fillType = useXor ? SkPathFillType::kEvenOdd : SkPathFillType::kWinding;
    path.setFillType(fillType);
    state.fReporter->bumpTestCount();
    if (!Simplify(path, &out)) {
        SkDebugf("%s did not expect failure\n", __FUNCTION__);
        REPORTER_ASSERT(state.fReporter, 0);
        return false;
    }
    if (!state.fReporter->verbose()) {
        return true;
    }
    int result = comparePaths(state.fReporter, nullptr, path, out, *state.fBitmap);
    if (result) {
        SkAutoMutexExclusive autoM(simplifyDebugOut);
        std::string str;
        const char* pathPrefix = nullptr;
        const char* nameSuffix = nullptr;
        if (fillType == SkPathFillType::kEvenOdd) {
            pathPrefix = "    path.setFillType(SkPathFillType::kEvenOdd);\n";
            nameSuffix = "x";
        }
        const char testFunction[] = "testSimplify(reporter, path);";
        appendTest(pathStr, pathPrefix, nameSuffix, testFunction, false, str);
        SkDebugf("%s", str.c_str());
        REPORTER_ASSERT(state.fReporter, 0);
    }
    state.fReporter->bumpTestCount();
    return result == 0;
}

◆ testSimplifyCheck()

bool testSimplifyCheck	(	skiatest::Reporter *	reporter,
		const SkPath &	path,
		const char *	filename,
		bool	checkFail
	)

Definition at line 536 of file PathOpsExtendedTest.cpp.

                        {
    return inner_simplify(reporter, path, filename, checkFail ?
            ExpectSuccess::kYes : ExpectSuccess::kNo, SkipAssert::kNo, ExpectMatch::kNo);
}

◆ testSimplifyFail()

bool testSimplifyFail	(	skiatest::Reporter *	reporter,
		const SkPath &	path,
		const char *	filename
	)

Definition at line 542 of file PathOpsExtendedTest.cpp.

                                                                                            {
    return inner_simplify(reporter, path, filename,
            ExpectSuccess::kNo, SkipAssert::kYes, ExpectMatch::kNo);
}

◆ testSimplifyFuzz()

bool testSimplifyFuzz	(	skiatest::Reporter *	reporter,
		const SkPath &	path,
		const char *	filename
	)

Definition at line 531 of file PathOpsExtendedTest.cpp.

                                                                                            {
    return inner_simplify(reporter, path, filename, ExpectSuccess::kFlaky, SkipAssert::kYes,
            ExpectMatch::kFlaky);
}

Variable Documentation

◆ gTestOp

SkTDArray<SkPathOp> gTestOp

static

Definition at line 264 of file PathOpsExtendedTest.cpp.

◆ gUniqueNames

std::vector<std::string> gUniqueNames

Definition at line 42 of file PathOpsExtendedTest.cpp.

◆ kBitHeight

const int kBitHeight = 64

Definition at line 130 of file PathOpsExtendedTest.cpp.

◆ kBitWidth

const int kBitWidth = 64

Definition at line 129 of file PathOpsExtendedTest.cpp.

◆ marker

const char marker[]

static

Initial value:

=
    "</div>\n"
    "\n"
    "<script type=\"text/javascript\">\n"
    "\n"
    "var testDivs = [\n"

Definition at line 67 of file PathOpsExtendedTest.cpp.

◆ opStrs

const char* opStrs[]

static

Initial value:

= {
    "kDifference_SkPathOp",
    "kIntersect_SkPathOp",
    "kUnion_SkPathOp",
    "kXOR_PathOp",
    "kReverseDifference_SkPathOp",
}

Definition at line 74 of file PathOpsExtendedTest.cpp.

◆ opSuffixes

const char* opSuffixes[]

static

Initial value:

= {
    "d",
    "i",
    "u",
    "o",
    "r",
}

Definition at line 82 of file PathOpsExtendedTest.cpp.

◆ sTestName

const char* sTestName = "pathOpTest"

static

Definition at line 313 of file PathOpsExtendedTest.cpp.

◆ sTestNumber

int sTestNumber = 55

static

Definition at line 312 of file PathOpsExtendedTest.cpp.

Enumerations

Functions

Variables

Enumeration Type Documentation

◆ ExpectMatch

◆ ExpectSuccess

◆ SkipAssert

Function Documentation

◆ appendTest()

◆ appendTestName()

◆ check_for_duplicate_names()

◆ comparePaths() [1/2]

◆ comparePaths() [2/2]

◆ drawAsciiPaths()

◆ initializeTests()

◆ inner_simplify()

◆ innerPathOp()

◆ json_path_out()

◆ json_status()

◆ markTestFlakyForPathKit()

◆ OpDebug()

◆ pathsDrawTheSame() [1/2]

◆ pathsDrawTheSame() [2/2]

◆ RunTestSet()

◆ scaleMatrix()

◆ showOp()

◆ showPathOpPath()

◆ SimplifyDebug()

◆ std_to_string()

◆ testPathOp()

◆ testPathOpCheck()

◆ testPathOpFail()

◆ testPathOpFuzz()

◆ testSimplify() [1/2]

◆ testSimplify() [2/2]

◆ testSimplifyCheck()

◆ testSimplifyFail()

◆ testSimplifyFuzz()

Variable Documentation

◆ gTestOp

◆ gUniqueNames

◆ kBitHeight

◆ kBitWidth

◆ marker

◆ opStrs

◆ opSuffixes

◆ sTestName

◆ sTestNumber