1 #include "SkOpContour.h"
2 #include "SkIntersectionHelper.h"
3 #include "SkOpSegment.h"
6 inline void DebugDumpDouble(double x) {
10 SkDebugf("%1.19g", x);
14 inline void DebugDumpFloat(float x) {
18 SkDebugf("%1.9gf", x);
23 #if DEBUG_SHOW_TEST_NAME
25 static void output_scalar(SkScalar num) {
26 if (num == (int) num) {
27 SkDebugf("%d", (int) num);
30 str.printf("%1.9g", num);
31 int width = (int) str.size();
32 const char* cStr = str.c_str();
33 while (cStr[width - 1] == '0') {
37 SkDebugf("%sf", str.c_str());
41 static void output_points(const SkPoint* pts, int count) {
42 for (int index = 0; index < count; ++index) {
43 output_scalar(pts[index].fX);
45 output_scalar(pts[index].fY);
46 if (index + 1 < count) {
53 static void showPathContours(SkPath::RawIter& iter, const char* pathName) {
56 while ((verb = iter.next(pts)) != SkPath::kDone_Verb) {
58 case SkPath::kMove_Verb:
59 SkDebugf(" %s.moveTo(", pathName);
60 output_points(&pts[0], 1);
62 case SkPath::kLine_Verb:
63 SkDebugf(" %s.lineTo(", pathName);
64 output_points(&pts[1], 1);
66 case SkPath::kQuad_Verb:
67 SkDebugf(" %s.quadTo(", pathName);
68 output_points(&pts[1], 2);
70 case SkPath::kCubic_Verb:
71 SkDebugf(" %s.cubicTo(", pathName);
72 output_points(&pts[1], 3);
74 case SkPath::kClose_Verb:
75 SkDebugf(" %s.close();\n", pathName);
78 SkDEBUGFAIL("bad verb");
84 static const char* gFillTypeStr[] = {
87 "kInverseWinding_FillType",
88 "kInverseEvenOdd_FillType"
91 void SkPathOpsDebug::ShowOnePath(const SkPath& path, const char* name, bool includeDeclaration) {
92 SkPath::RawIter iter(path);
93 #define SUPPORT_RECT_CONTOUR_DETECTION 0
94 #if SUPPORT_RECT_CONTOUR_DETECTION
95 int rectCount = path.isRectContours() ? path.rectContours(NULL, NULL) : 0;
97 SkTDArray<SkRect> rects;
98 SkTDArray<SkPath::Direction> directions;
99 rects.setCount(rectCount);
100 directions.setCount(rectCount);
101 path.rectContours(rects.begin(), directions.begin());
102 for (int contour = 0; contour < rectCount; ++contour) {
103 const SkRect& rect = rects[contour];
104 SkDebugf("path.addRect(%1.9g, %1.9g, %1.9g, %1.9g, %s);\n", rect.fLeft, rect.fTop,
105 rect.fRight, rect.fBottom, directions[contour] == SkPath::kCCW_Direction
106 ? "SkPath::kCCW_Direction" : "SkPath::kCW_Direction");
111 SkPath::FillType fillType = path.getFillType();
112 SkASSERT(fillType >= SkPath::kWinding_FillType && fillType <= SkPath::kInverseEvenOdd_FillType);
113 if (includeDeclaration) {
114 SkDebugf(" SkPath %s;\n", name);
116 SkDebugf(" %s.setFillType(SkPath::%s);\n", name, gFillTypeStr[fillType]);
118 showPathContours(iter, name);
121 static void show_function_header(const char* functionName) {
122 SkDebugf("\nstatic void %s(skiatest::Reporter* reporter, const char* filename) {\n", functionName);
123 if (strcmp("skphealth_com76", functionName) == 0) {
124 SkDebugf("found it\n");
128 static const char* gOpStrs[] = {
129 "kDifference_PathOp",
133 "kReverseDifference_PathOp",
136 static void show_op(SkPathOp op, const char* pathOne, const char* pathTwo) {
137 SkDebugf(" testPathOp(reporter, %s, %s, %s, filename);\n", pathOne, pathTwo, gOpStrs[op]);
141 SK_DECLARE_STATIC_MUTEX(gTestMutex);
143 void SkPathOpsDebug::ShowPath(const SkPath& a, const SkPath& b, SkPathOp shapeOp,
144 const char* testName) {
145 SkAutoMutexAcquire ac(gTestMutex);
146 show_function_header(testName);
147 ShowOnePath(a, "path", true);
148 ShowOnePath(b, "pathB", true);
149 show_op(shapeOp, "path", "pathB");
153 // if not defined by PathOpsDebug.cpp ...
154 #if !defined SK_DEBUG && FORCE_RELEASE
155 bool SkPathOpsDebug::ValidWind(int wind) {
156 return wind > SK_MinS32 + 0xFFFF && wind < SK_MaxS32 - 0xFFFF;
159 void SkPathOpsDebug::WindingPrintf(int wind) {
160 if (wind == SK_MinS32) {
163 SkDebugf("%d", wind);
168 void SkOpAngle::dump() const {
173 void SkOpAngle::dumpOne(bool functionHeader) const {
174 // fSegment->debugValidate();
175 const SkOpSpan& mSpan = fSegment->span(SkMin32(fStart, fEnd));
176 if (functionHeader) {
177 SkDebugf("%s ", __FUNCTION__);
179 SkDebugf("[%d", fSegment->debugID());
180 SkDebugf("/%d", debugID());
183 SkDebugf("%d", fNext->fSegment->debugID());
184 SkDebugf("/%d", fNext->debugID());
188 SkDebugf(" sect=%d/%d ", fSectorStart, fSectorEnd);
189 SkDebugf(" s=%1.9g [%d] e=%1.9g [%d]", fSegment->span(fStart).fT, fStart,
190 fSegment->span(fEnd).fT, fEnd);
191 SkDebugf(" sgn=%d windVal=%d", sign(), mSpan.fWindValue);
193 SkDebugf(" windSum=");
194 SkPathOpsDebug::WindingPrintf(mSpan.fWindSum);
195 if (mSpan.fOppValue != 0 || mSpan.fOppSum != SK_MinS32) {
196 SkDebugf(" oppVal=%d", mSpan.fOppValue);
197 SkDebugf(" oppSum=");
198 SkPathOpsDebug::WindingPrintf(mSpan.fOppSum);
204 SkDebugf(" unorderable");
212 if (fSegment->operand()) {
213 SkDebugf(" operand");
220 void SkOpAngle::dumpTo(const SkOpSegment* segment, const SkOpAngle* to) const {
221 const SkOpAngle* first = this;
222 const SkOpAngle* next = this;
223 const char* indent = "";
225 SkDebugf("%s", indent);
226 next->dumpOne(false);
227 if (segment == next->fSegment) {
229 SkDebugf(" << from");
238 } while (next && next != first);
241 void SkOpAngle::dumpLoop() const {
242 const SkOpAngle* first = this;
243 const SkOpAngle* next = this;
245 next->dumpOne(false);
248 } while (next && next != first);
251 void SkOpAngle::dumpPartials() const {
252 const SkOpAngle* first = this;
253 const SkOpAngle* next = this;
255 next->fCurvePart.dumpNumber();
257 } while (next && next != first);
260 void SkOpAngleSet::dump() const {
261 // FIXME: unimplemented
262 /* This requires access to the internal SkChunkAlloc data
263 Defer implementing this until it is needed for debugging
268 void SkOpContour::dump() const {
269 int segmentCount = fSegments.count();
270 SkDebugf("((SkOpContour*) 0x%p) [%d]\n", this, debugID());
271 for (int test = 0; test < segmentCount; ++test) {
272 SkDebugf(" [%d] ((SkOpSegment*) 0x%p) [%d]\n", test, &fSegments[test],
273 fSegments[test].debugID());
277 void SkOpContour::dumpAngles() const {
278 int segmentCount = fSegments.count();
279 SkDebugf("((SkOpContour*) 0x%p) [%d]\n", this, debugID());
280 for (int test = 0; test < segmentCount; ++test) {
281 SkDebugf(" [%d] ", test);
282 fSegments[test].dumpAngles();
286 void SkOpContour::dumpCoincidence(const SkCoincidence& coin) const {
287 int thisIndex = coin.fSegments[0];
288 const SkOpSegment& s1 = fSegments[thisIndex];
289 int otherIndex = coin.fSegments[1];
290 const SkOpSegment& s2 = coin.fOther->fSegments[otherIndex];
291 SkDebugf("((SkOpSegment*) 0x%p) [%d] ((SkOpSegment*) 0x%p) [%d]\n", &s1, s1.debugID(),
293 for (int index = 0; index < 2; ++index) {
294 SkDebugf(" {%1.9gf, %1.9gf}", coin.fPts[0][index].fX, coin.fPts[0][index].fY);
295 if (coin.fNearly[index]) {
296 SkDebugf(" {%1.9gf, %1.9gf}", coin.fPts[1][index].fX, coin.fPts[1][index].fY);
298 SkDebugf(" seg1t=%1.9g seg2t=%1.9g\n", coin.fTs[0][index], coin.fTs[1][index]);
302 void SkOpContour::dumpCoincidences() const {
303 int count = fCoincidences.count();
305 SkDebugf("fCoincidences count=%d\n", count);
306 for (int test = 0; test < count; ++test) {
307 dumpCoincidence(fCoincidences[test]);
310 count = fPartialCoincidences.count();
314 SkDebugf("fPartialCoincidences count=%d\n", count);
315 for (int test = 0; test < count; ++test) {
316 dumpCoincidence(fPartialCoincidences[test]);
320 void SkOpContour::dumpPt(int index) const {
321 int segmentCount = fSegments.count();
322 for (int test = 0; test < segmentCount; ++test) {
323 const SkOpSegment& segment = fSegments[test];
324 if (segment.debugID() == index) {
325 fSegments[test].dumpPts();
330 void SkOpContour::dumpPts() const {
331 int segmentCount = fSegments.count();
332 SkDebugf("((SkOpContour*) 0x%p) [%d]\n", this, debugID());
333 for (int test = 0; test < segmentCount; ++test) {
334 SkDebugf(" [%d] ", test);
335 fSegments[test].dumpPts();
339 void SkOpContour::dumpSpan(int index) const {
340 int segmentCount = fSegments.count();
341 for (int test = 0; test < segmentCount; ++test) {
342 const SkOpSegment& segment = fSegments[test];
343 if (segment.debugID() == index) {
344 fSegments[test].dumpSpans();
349 void SkOpContour::dumpSpans() const {
350 int segmentCount = fSegments.count();
351 SkDebugf("((SkOpContour*) 0x%p) [%d]\n", this, debugID());
352 for (int test = 0; test < segmentCount; ++test) {
353 SkDebugf(" [%d] ", test);
354 fSegments[test].dumpSpans();
358 void SkDCubic::dump() const {
364 } while (++index < 3);
369 void SkDCubic::dumpNumber() const {
372 bool dumpedOne = false;
374 if (!(fPts[index].fX == fPts[index].fX && fPts[index].fY == fPts[index].fY)) {
382 } while (++index < 3);
383 if (fPts[index].fX == fPts[index].fX && fPts[index].fY == fPts[index].fY) {
392 void SkDLine::dump() const {
400 void SkDPoint::dump() const {
408 void SkDPoint::Dump(const SkPoint& pt) {
410 DebugDumpFloat(pt.fX);
412 DebugDumpFloat(pt.fY);
417 void SkDQuad::dumpComma(const char* comma) const {
423 } while (++index < 2);
425 SkDebugf("}}%s\n", comma ? comma : "");
428 void SkDQuad::dump() const {
432 void SkIntersectionHelper::dump() const {
433 SkDPoint::Dump(pts()[0]);
434 SkDPoint::Dump(pts()[1]);
435 if (verb() >= SkPath::kQuad_Verb) {
436 SkDPoint::Dump(pts()[2]);
438 if (verb() >= SkPath::kCubic_Verb) {
439 SkDPoint::Dump(pts()[3]);
443 const SkTDArray<SkOpSpan>& SkOpSegment::debugSpans() const {
447 void SkOpSegment::dumpAngles() const {
448 SkDebugf("((SkOpSegment*) 0x%p) [%d]\n", this, debugID());
449 const SkOpAngle* fromAngle = NULL;
450 const SkOpAngle* toAngle = NULL;
451 for (int index = 0; index < count(); ++index) {
452 const SkOpAngle* fAngle = fTs[index].fFromAngle;
453 const SkOpAngle* tAngle = fTs[index].fToAngle;
454 if (fromAngle == fAngle && toAngle == tAngle) {
458 SkDebugf(" [%d] from=%d ", index, fAngle->debugID());
459 fAngle->dumpTo(this, tAngle);
462 SkDebugf(" [%d] to=%d ", index, tAngle->debugID());
463 tAngle->dumpTo(this, fAngle);
470 void SkOpSegment::dumpContour(int firstID, int lastID) const {
474 const SkOpSegment* test = this - (debugID() - 1);
475 test += (firstID - 1);
476 const SkOpSegment* last = test + (lastID - firstID);
477 while (test <= last) {
483 void SkOpSegment::dumpPts() const {
484 int last = SkPathOpsVerbToPoints(fVerb);
485 SkDebugf("((SkOpSegment*) 0x%p) [%d] {{", this, debugID());
488 SkDPoint::Dump(fPts[index]);
490 } while (++index < last);
491 SkDPoint::Dump(fPts[index]);
495 void SkOpSegment::dumpDPts() const {
496 int count = SkPathOpsVerbToPoints(fVerb);
497 SkDebugf("((SkOpSegment*) 0x%p) [%d] {{", this, debugID());
500 SkDPoint dPt = {fPts[index].fX, fPts[index].fY};
502 if (index != count) {
505 } while (++index <= count);
509 void SkOpSegment::dumpSpans() const {
510 int count = this->count();
511 SkDebugf("((SkOpSegment*) 0x%p) [%d]\n", this, debugID());
512 for (int index = 0; index < count; ++index) {
513 const SkOpSpan& span = this->span(index);
514 SkDebugf(" [%d] ", index);
519 void SkPathOpsDebug::DumpCoincidence(const SkTArray<SkOpContour, true>& contours) {
520 int count = contours.count();
521 for (int index = 0; index < count; ++index) {
522 contours[index].dumpCoincidences();
526 void SkPathOpsDebug::DumpCoincidence(const SkTArray<SkOpContour* , true>& contours) {
527 int count = contours.count();
528 for (int index = 0; index < count; ++index) {
529 contours[index]->dumpCoincidences();
533 void SkPathOpsDebug::DumpContours(const SkTArray<SkOpContour, true>& contours) {
534 int count = contours.count();
535 for (int index = 0; index < count; ++index) {
536 contours[index].dump();
540 void SkPathOpsDebug::DumpContours(const SkTArray<SkOpContour* , true>& contours) {
541 int count = contours.count();
542 for (int index = 0; index < count; ++index) {
543 contours[index]->dump();
547 void SkPathOpsDebug::DumpContourAngles(const SkTArray<SkOpContour, true>& contours) {
548 int count = contours.count();
549 for (int index = 0; index < count; ++index) {
550 contours[index].dumpAngles();
554 void SkPathOpsDebug::DumpContourAngles(const SkTArray<SkOpContour* , true>& contours) {
555 int count = contours.count();
556 for (int index = 0; index < count; ++index) {
557 contours[index]->dumpAngles();
561 void SkPathOpsDebug::DumpContourPts(const SkTArray<SkOpContour, true>& contours) {
562 int count = contours.count();
563 for (int index = 0; index < count; ++index) {
564 contours[index].dumpPts();
568 void SkPathOpsDebug::DumpContourPts(const SkTArray<SkOpContour* , true>& contours) {
569 int count = contours.count();
570 for (int index = 0; index < count; ++index) {
571 contours[index]->dumpPts();
575 void SkPathOpsDebug::DumpContourPt(const SkTArray<SkOpContour, true>& contours, int segmentID) {
576 int count = contours.count();
577 for (int index = 0; index < count; ++index) {
578 contours[index].dumpPt(segmentID);
582 void SkPathOpsDebug::DumpContourPt(const SkTArray<SkOpContour* , true>& contours, int segmentID) {
583 int count = contours.count();
584 for (int index = 0; index < count; ++index) {
585 contours[index]->dumpPt(segmentID);
589 void SkPathOpsDebug::DumpContourSpans(const SkTArray<SkOpContour, true>& contours) {
590 int count = contours.count();
591 for (int index = 0; index < count; ++index) {
592 contours[index].dumpSpans();
596 void SkPathOpsDebug::DumpContourSpans(const SkTArray<SkOpContour* , true>& contours) {
597 int count = contours.count();
598 for (int index = 0; index < count; ++index) {
599 contours[index]->dumpSpans();
603 void SkPathOpsDebug::DumpContourSpan(const SkTArray<SkOpContour, true>& contours, int segmentID) {
604 int count = contours.count();
605 for (int index = 0; index < count; ++index) {
606 contours[index].dumpSpan(segmentID);
610 void SkPathOpsDebug::DumpContourSpan(const SkTArray<SkOpContour* , true>& contours, int segmentID) {
611 int count = contours.count();
612 for (int index = 0; index < count; ++index) {
613 contours[index]->dumpSpan(segmentID);
617 void SkPathOpsDebug::DumpSpans(const SkTDArray<SkOpSpan *>& spans) {
618 int count = spans.count();
619 for (int index = 0; index < count; ++index) {
620 const SkOpSpan* span = spans[index];
621 const SkOpSpan& oSpan = span->fOther->span(span->fOtherIndex);
622 const SkOpSegment* segment = oSpan.fOther;
623 SkDebugf("((SkOpSegment*) 0x%p) [%d] ", segment, segment->debugID());
624 SkDebugf("spanIndex:%d ", oSpan.fOtherIndex);
629 // this does not require that other T index is initialized or correct
630 const SkOpSegment* SkOpSpan::debugToSegment(ptrdiff_t* spanIndex) const {
634 int oppCount = fOther->count();
635 for (int index = 0; index < oppCount; ++index) {
636 const SkOpSpan& otherSpan = fOther->span(index);
637 double otherTestT = otherSpan.fT;
638 if (otherTestT < fOtherT) {
641 SkASSERT(otherTestT == fOtherT);
642 const SkOpSegment* candidate = otherSpan.fOther;
643 const SkOpSpan* first = candidate->debugSpans().begin();
644 const SkOpSpan* last = candidate->debugSpans().end() - 1;
645 if (first <= this && this <= last) {
647 *spanIndex = this - first;
656 void SkOpSpan::dumpOne() const {
662 SkDebugf(" other.fID=%d", fOther->debugID());
663 SkDebugf(" [%d] otherT=", fOtherIndex);
664 DebugDumpDouble(fOtherT);
666 SkDebugf(" other.fID=? [?] otherT=?");
668 if (fWindSum != SK_MinS32) {
669 SkDebugf(" windSum=%d", fWindSum);
671 if (fOppSum != SK_MinS32 && (SkPathOpsDebug::ValidWind(fOppSum) || fOppValue != 0)) {
672 SkDebugf(" oppSum=%d", fOppSum);
674 SkDebugf(" windValue=%d", fWindValue);
675 if (SkPathOpsDebug::ValidWind(fOppSum) || fOppValue != 0) {
676 SkDebugf(" oppValue=%d", fOppValue);
678 if (fFromAngle && fFromAngle->debugID()) {
679 SkDebugf(" from=%d", fFromAngle->debugID());
681 if (fToAngle && fToAngle->debugID()) {
682 SkDebugf(" to=%d", fToAngle->debugID());
688 SkDebugf(" coincident");
697 SkDebugf(" multiple");
711 void SkOpSpan::dump() const {
713 const SkOpSegment* segment = debugToSegment(&spanIndex);
715 SkDebugf("((SkOpSegment*) 0x%p) [%d]\n", segment, segment->debugID());
716 SkDebugf(" [%d] ", spanIndex);
718 SkDebugf("((SkOpSegment*) ?) [?]\n");
724 void Dump(const SkTArray<class SkOpContour, true>& contours) {
725 SkPathOpsDebug::DumpContours(contours);
728 void Dump(const SkTArray<class SkOpContour* , true>& contours) {
729 SkPathOpsDebug::DumpContours(contours);
732 void Dump(const SkTArray<class SkOpContour, true>* contours) {
733 SkPathOpsDebug::DumpContours(*contours);
736 void Dump(const SkTArray<class SkOpContour* , true>* contours) {
737 SkPathOpsDebug::DumpContours(*contours);
740 void Dump(const SkTDArray<SkOpSpan *>& chase) {
741 SkPathOpsDebug::DumpSpans(chase);
744 void Dump(const SkTDArray<SkOpSpan *>* chase) {
745 SkPathOpsDebug::DumpSpans(*chase);
748 void DumpAngles(const SkTArray<class SkOpContour, true>& contours) {
749 SkPathOpsDebug::DumpContourAngles(contours);
752 void DumpAngles(const SkTArray<class SkOpContour* , true>& contours) {
753 SkPathOpsDebug::DumpContourAngles(contours);
756 void DumpAngles(const SkTArray<class SkOpContour, true>* contours) {
757 SkPathOpsDebug::DumpContourAngles(*contours);
760 void DumpAngles(const SkTArray<class SkOpContour* , true>* contours) {
761 SkPathOpsDebug::DumpContourAngles(*contours);
764 void DumpCoin(const SkTArray<class SkOpContour, true>& contours) {
765 SkPathOpsDebug::DumpCoincidence(contours);
768 void DumpCoin(const SkTArray<class SkOpContour* , true>& contours) {
769 SkPathOpsDebug::DumpCoincidence(contours);
772 void DumpCoin(const SkTArray<class SkOpContour, true>* contours) {
773 SkPathOpsDebug::DumpCoincidence(*contours);
776 void DumpCoin(const SkTArray<class SkOpContour* , true>* contours) {
777 SkPathOpsDebug::DumpCoincidence(*contours);
780 void DumpSpans(const SkTArray<class SkOpContour, true>& contours) {
781 SkPathOpsDebug::DumpContourSpans(contours);
784 void DumpSpans(const SkTArray<class SkOpContour* , true>& contours) {
785 SkPathOpsDebug::DumpContourSpans(contours);
788 void DumpSpans(const SkTArray<class SkOpContour, true>* contours) {
789 SkPathOpsDebug::DumpContourSpans(*contours);
792 void DumpSpans(const SkTArray<class SkOpContour* , true>* contours) {
793 SkPathOpsDebug::DumpContourSpans(*contours);
796 void DumpSpan(const SkTArray<class SkOpContour, true>& contours, int segmentID) {
797 SkPathOpsDebug::DumpContourSpan(contours, segmentID);
800 void DumpSpan(const SkTArray<class SkOpContour* , true>& contours, int segmentID) {
801 SkPathOpsDebug::DumpContourSpan(contours, segmentID);
804 void DumpSpan(const SkTArray<class SkOpContour, true>* contours, int segmentID) {
805 SkPathOpsDebug::DumpContourSpan(*contours, segmentID);
808 void DumpSpan(const SkTArray<class SkOpContour* , true>* contours, int segmentID) {
809 SkPathOpsDebug::DumpContourSpan(*contours, segmentID);
812 void DumpPts(const SkTArray<class SkOpContour, true>& contours) {
813 SkPathOpsDebug::DumpContourPts(contours);
816 void DumpPts(const SkTArray<class SkOpContour* , true>& contours) {
817 SkPathOpsDebug::DumpContourPts(contours);
820 void DumpPts(const SkTArray<class SkOpContour, true>* contours) {
821 SkPathOpsDebug::DumpContourPts(*contours);
824 void DumpPts(const SkTArray<class SkOpContour* , true>* contours) {
825 SkPathOpsDebug::DumpContourPts(*contours);
828 void DumpPt(const SkTArray<class SkOpContour, true>& contours, int segmentID) {
829 SkPathOpsDebug::DumpContourPt(contours, segmentID);
832 void DumpPt(const SkTArray<class SkOpContour* , true>& contours, int segmentID) {
833 SkPathOpsDebug::DumpContourPt(contours, segmentID);
836 void DumpPt(const SkTArray<class SkOpContour, true>* contours, int segmentID) {
837 SkPathOpsDebug::DumpContourPt(*contours, segmentID);
840 void DumpPt(const SkTArray<class SkOpContour* , true>* contours, int segmentID) {
841 SkPathOpsDebug::DumpContourPt(*contours, segmentID);
844 static void dumpTestCase(const SkDQuad& quad1, const SkDQuad& quad2, int testNo) {
845 SkDebugf("<div id=\"quad%d\">\n", testNo);
846 quad1.dumpComma(",");
848 SkDebugf("</div>\n\n");
851 static void dumpTestTrailer() {
852 SkDebugf("</div>\n\n<script type=\"text/javascript\">\n\n");
853 SkDebugf(" var testDivs = [\n");
856 static void dumpTestList(int testNo, double min) {
857 SkDebugf(" quad%d,", testNo);
859 SkDebugf(" // %1.9g", min);
864 void DumpQ(const SkDQuad& quad1, const SkDQuad& quad2, int testNo) {
866 dumpTestCase(quad1, quad2, testNo);
868 dumpTestList(testNo, 0);
872 void DumpT(const SkDQuad& quad, double t) {
873 SkDLine line = {{quad.ptAtT(t), quad[0]}};