blob: 31a446b32b38fa89a61444c0ca7229cd586dcce4 [file] [log] [blame]
caryclark@google.com07393ca2013-04-08 11:47:37 +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 */
caryclark@google.com07e97fc2013-07-08 17:17:02 +00007#include "SkGeometry.h"
caryclark@google.com07393ca2013-04-08 11:47:37 +00008#include "SkOpEdgeBuilder.h"
9#include "SkReduceOrder.h"
10
11void SkOpEdgeBuilder::init() {
12 fCurrentContour = NULL;
13 fOperand = false;
14 fXorMask[0] = fXorMask[1] = (fPath->getFillType() & 1) ? kEvenOdd_PathOpsMask
15 : kWinding_PathOpsMask;
caryclark@google.com66560ca2013-04-26 19:51:16 +000016 fUnparseable = false;
caryclark@google.com07393ca2013-04-08 11:47:37 +000017 fSecondHalf = preFetch();
18}
19
20void SkOpEdgeBuilder::addOperand(const SkPath& path) {
21 SkASSERT(fPathVerbs.count() > 0 && fPathVerbs.end()[-1] == SkPath::kDone_Verb);
caryclark@google.comd892bd82013-06-17 14:10:36 +000022 fPathVerbs.pop_back();
caryclark@google.com07393ca2013-04-08 11:47:37 +000023 fPath = &path;
24 fXorMask[1] = (fPath->getFillType() & 1) ? kEvenOdd_PathOpsMask
25 : kWinding_PathOpsMask;
26 preFetch();
27}
28
caryclark@google.com66560ca2013-04-26 19:51:16 +000029bool SkOpEdgeBuilder::finish() {
30 if (fUnparseable || !walk()) {
31 return false;
32 }
caryclark@google.com07393ca2013-04-08 11:47:37 +000033 complete();
34 if (fCurrentContour && !fCurrentContour->segments().count()) {
35 fContours.pop_back();
36 }
caryclark@google.com66560ca2013-04-26 19:51:16 +000037 return true;
caryclark@google.com07393ca2013-04-08 11:47:37 +000038}
39
caryclark@google.com07e97fc2013-07-08 17:17:02 +000040void SkOpEdgeBuilder::closeContour(const SkPoint& curveEnd, const SkPoint& curveStart) {
caryclark@google.coma2bbc6e2013-11-01 17:36:03 +000041 if (!SkDPoint::ApproximatelyEqual(curveEnd, curveStart)) {
caryclark@google.com07e97fc2013-07-08 17:17:02 +000042 fPathVerbs.push_back(SkPath::kLine_Verb);
skia.committer@gmail.coma4aced42013-07-09 07:00:56 +000043 fPathPts.push_back_n(1, &curveStart);
caryclark@google.com07e97fc2013-07-08 17:17:02 +000044 } else {
caryclark@google.coma2bbc6e2013-11-01 17:36:03 +000045 fPathPts[fPathPts.count() - 1] = curveStart;
caryclark@google.com07e97fc2013-07-08 17:17:02 +000046 }
47 fPathVerbs.push_back(SkPath::kClose_Verb);
48}
49
caryclark@google.com07393ca2013-04-08 11:47:37 +000050int SkOpEdgeBuilder::preFetch() {
caryclark@google.com66560ca2013-04-26 19:51:16 +000051 if (!fPath->isFinite()) {
52 fUnparseable = true;
53 return 0;
54 }
caryclark@google.com07e97fc2013-07-08 17:17:02 +000055 SkAutoConicToQuads quadder;
56 const SkScalar quadderTol = SK_Scalar1 / 16;
caryclark@google.com6dc7df62013-04-25 11:51:54 +000057 SkPath::RawIter iter(*fPath);
caryclark@google.com07e97fc2013-07-08 17:17:02 +000058 SkPoint curveStart;
59 SkPoint curve[4];
caryclark@google.com07393ca2013-04-08 11:47:37 +000060 SkPoint pts[4];
61 SkPath::Verb verb;
caryclark@google.com07e97fc2013-07-08 17:17:02 +000062 bool lastCurve = false;
caryclark@google.com07393ca2013-04-08 11:47:37 +000063 do {
64 verb = iter.next(pts);
caryclark@google.com07e97fc2013-07-08 17:17:02 +000065 switch (verb) {
66 case SkPath::kMove_Verb:
67 if (!fAllowOpenContours && lastCurve) {
68 closeContour(curve[0], curveStart);
69 }
70 fPathVerbs.push_back(verb);
71 fPathPts.push_back(pts[0]);
72 curveStart = curve[0] = pts[0];
73 lastCurve = false;
74 continue;
75 case SkPath::kLine_Verb:
caryclark@google.coma2bbc6e2013-11-01 17:36:03 +000076 if (SkDPoint::ApproximatelyEqual(curve[0], pts[1])) {
77 uint8_t lastVerb = fPathVerbs.back();
78 if (lastVerb != SkPath::kLine_Verb && lastVerb != SkPath::kMove_Verb) {
caryclark@google.com570863f2013-09-16 15:55:01 +000079 fPathPts.back() = pts[1];
80 }
caryclark@google.com07e97fc2013-07-08 17:17:02 +000081 continue; // skip degenerate points
82 }
83 break;
84 case SkPath::kQuad_Verb:
85 curve[1] = pts[1];
86 curve[2] = pts[2];
87 verb = SkReduceOrder::Quad(curve, pts);
88 if (verb == SkPath::kMove_Verb) {
89 continue; // skip degenerate points
90 }
91 break;
92 case SkPath::kConic_Verb: {
93 const SkPoint* quadPts = quadder.computeQuads(pts, iter.conicWeight(),
94 quadderTol);
95 const int nQuads = quadder.countQuads();
96 for (int i = 0; i < nQuads; ++i) {
97 fPathVerbs.push_back(SkPath::kQuad_Verb);
98 }
99 fPathPts.push_back_n(nQuads * 2, quadPts);
100 curve[0] = quadPts[nQuads * 2 - 1];
101 lastCurve = true;
102 }
103 continue;
104 case SkPath::kCubic_Verb:
105 curve[1] = pts[1];
106 curve[2] = pts[2];
107 curve[3] = pts[3];
108 verb = SkReduceOrder::Cubic(curve, pts);
109 if (verb == SkPath::kMove_Verb) {
110 continue; // skip degenerate points
111 }
112 break;
113 case SkPath::kClose_Verb:
114 closeContour(curve[0], curveStart);
115 lastCurve = false;
116 continue;
117 case SkPath::kDone_Verb:
118 continue;
caryclark@google.com07393ca2013-04-08 11:47:37 +0000119 }
caryclark@google.com07e97fc2013-07-08 17:17:02 +0000120 fPathVerbs.push_back(verb);
121 int ptCount = SkPathOpsVerbToPoints(verb);
122 fPathPts.push_back_n(ptCount, &pts[1]);
123 curve[0] = pts[ptCount];
124 lastCurve = true;
caryclark@google.com07393ca2013-04-08 11:47:37 +0000125 } while (verb != SkPath::kDone_Verb);
caryclark@google.com07e97fc2013-07-08 17:17:02 +0000126 if (!fAllowOpenContours && lastCurve) {
127 closeContour(curve[0], curveStart);
128 }
129 fPathVerbs.push_back(SkPath::kDone_Verb);
caryclark@google.com07393ca2013-04-08 11:47:37 +0000130 return fPathVerbs.count() - 1;
131}
132
caryclark@google.com66560ca2013-04-26 19:51:16 +0000133bool SkOpEdgeBuilder::close() {
caryclark@google.com66560ca2013-04-26 19:51:16 +0000134 complete();
135 return true;
136}
137
138bool SkOpEdgeBuilder::walk() {
caryclark@google.com07393ca2013-04-08 11:47:37 +0000139 uint8_t* verbPtr = fPathVerbs.begin();
140 uint8_t* endOfFirstHalf = &verbPtr[fSecondHalf];
caryclark@google.com07e97fc2013-07-08 17:17:02 +0000141 const SkPoint* pointsPtr = fPathPts.begin() - 1;
caryclark@google.com07393ca2013-04-08 11:47:37 +0000142 SkPath::Verb verb;
caryclark@google.com6dc7df62013-04-25 11:51:54 +0000143 while ((verb = (SkPath::Verb) *verbPtr) != SkPath::kDone_Verb) {
144 if (verbPtr == endOfFirstHalf) {
145 fOperand = true;
146 }
147 verbPtr++;
caryclark@google.com07393ca2013-04-08 11:47:37 +0000148 switch (verb) {
149 case SkPath::kMove_Verb:
caryclark@google.com66560ca2013-04-26 19:51:16 +0000150 if (fCurrentContour) {
151 if (fAllowOpenContours) {
152 complete();
153 } else if (!close()) {
154 return false;
155 }
156 }
caryclark@google.com07393ca2013-04-08 11:47:37 +0000157 if (!fCurrentContour) {
158 fCurrentContour = fContours.push_back_n(1);
159 fCurrentContour->setOperand(fOperand);
160 fCurrentContour->setXor(fXorMask[fOperand] == kEvenOdd_PathOpsMask);
caryclark@google.com07393ca2013-04-08 11:47:37 +0000161 }
caryclark@google.com07e97fc2013-07-08 17:17:02 +0000162 pointsPtr += 1;
caryclark@google.com6dc7df62013-04-25 11:51:54 +0000163 continue;
caryclark@google.com07e97fc2013-07-08 17:17:02 +0000164 case SkPath::kLine_Verb:
165 fCurrentContour->addLine(pointsPtr);
166 break;
167 case SkPath::kQuad_Verb:
168 fCurrentContour->addQuad(pointsPtr);
169 break;
170 case SkPath::kCubic_Verb:
171 fCurrentContour->addCubic(pointsPtr);
172 break;
caryclark@google.com07393ca2013-04-08 11:47:37 +0000173 case SkPath::kClose_Verb:
174 SkASSERT(fCurrentContour);
caryclark@google.com66560ca2013-04-26 19:51:16 +0000175 if (!close()) {
176 return false;
caryclark@google.com07393ca2013-04-08 11:47:37 +0000177 }
caryclark@google.com6dc7df62013-04-25 11:51:54 +0000178 continue;
caryclark@google.com07393ca2013-04-08 11:47:37 +0000179 default:
180 SkDEBUGFAIL("bad verb");
caryclark@google.com66560ca2013-04-26 19:51:16 +0000181 return false;
caryclark@google.com07393ca2013-04-08 11:47:37 +0000182 }
reed@google.com277c3f82013-05-31 15:17:50 +0000183 pointsPtr += SkPathOpsVerbToPoints(verb);
caryclark@google.com07393ca2013-04-08 11:47:37 +0000184 SkASSERT(fCurrentContour);
caryclark@google.com07393ca2013-04-08 11:47:37 +0000185 }
caryclark@google.com66560ca2013-04-26 19:51:16 +0000186 if (fCurrentContour && !fAllowOpenContours && !close()) {
187 return false;
188 }
189 return true;
caryclark@google.com07393ca2013-04-08 11:47:37 +0000190}