blob: 9a0bdcf30810310d2e52007a4b295461a2dcb05f [file] [log] [blame]
caryclark@google.com49612012013-04-08 20:37:35 +00001/*
2 * Copyright 2012 Google Inc.
3 *
4 * Use of this source code is governed by a BSD-style license that can be
5 * found in the LICENSE file.
6 */
7#include "PathOpsQuadIntersectionTestData.h"
8#include "SkIntersections.h"
9#include "SkPathOpsRect.h"
10#include "SkReduceOrder.h"
11#include "Test.h"
12
13static const SkDQuad testSet[] = {
14 {{{1, 1}, {2, 2}, {1, 1.000003}}},
15 {{{1, 0}, {2, 6}, {3, 0}}}
16};
17
caryclark@google.comad65a3e2013-04-15 19:13:59 +000018static const size_t testSetCount = SK_ARRAY_COUNT(testSet);
caryclark@google.com49612012013-04-08 20:37:35 +000019
20static void oneOffTest(skiatest::Reporter* reporter) {
21 for (size_t index = 0; index < testSetCount; ++index) {
22 const SkDQuad& quad = testSet[index];
23 SkReduceOrder reducer;
caryclark@google.com927b7022013-11-25 14:18:21 +000024 SkDEBUGCODE(int result = ) reducer.reduce(quad);
caryclark@google.com49612012013-04-08 20:37:35 +000025 SkASSERT(result == 3);
26 }
27}
28
29static void standardTestCases(skiatest::Reporter* reporter) {
30 size_t index;
31 SkReduceOrder reducer;
32 int order;
33 enum {
34 RunAll,
35 RunQuadraticLines,
36 RunQuadraticModLines,
37 RunNone
38 } run = RunAll;
39 int firstTestIndex = 0;
40#if 0
41 run = RunQuadraticLines;
42 firstTestIndex = 1;
43#endif
44 int firstQuadraticLineTest = run == RunAll ? 0 : run == RunQuadraticLines ? firstTestIndex
45 : SK_MaxS32;
46 int firstQuadraticModLineTest = run == RunAll ? 0 : run == RunQuadraticModLines ? firstTestIndex
47 : SK_MaxS32;
48
49 for (index = firstQuadraticLineTest; index < quadraticLines_count; ++index) {
50 const SkDQuad& quad = quadraticLines[index];
caryclark@google.com927b7022013-11-25 14:18:21 +000051 order = reducer.reduce(quad);
caryclark@google.com49612012013-04-08 20:37:35 +000052 if (order != 2) {
bungeman@google.comfab44db2013-10-11 18:50:45 +000053 SkDebugf("[%d] line quad order=%d\n", (int) index, order);
caryclark@google.com49612012013-04-08 20:37:35 +000054 }
55 }
56 for (index = firstQuadraticModLineTest; index < quadraticModEpsilonLines_count; ++index) {
57 const SkDQuad& quad = quadraticModEpsilonLines[index];
caryclark@google.com927b7022013-11-25 14:18:21 +000058 order = reducer.reduce(quad);
caryclark@google.com49612012013-04-08 20:37:35 +000059 if (order != 3) {
bungeman@google.comfab44db2013-10-11 18:50:45 +000060 SkDebugf("[%d] line mod quad order=%d\n", (int) index, order);
caryclark@google.com49612012013-04-08 20:37:35 +000061 }
62 }
63}
64
tfarina@chromium.org78e7b4e2014-01-02 21:45:03 +000065DEF_TEST(PathOpsReduceOrderQuad, reporter) {
caryclark@google.com49612012013-04-08 20:37:35 +000066 oneOffTest(reporter);
67 standardTestCases(reporter);
68}