blob: ee06f78a9a27e462dd268854b31f24c5940b2604 [file] [log] [blame]
Chris Dalton419a94d2017-08-28 10:24:22 -06001/*
2 * Copyright 2017 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
8#ifndef GrGrCCPRGeometry_DEFINED
9#define GrGrCCPRGeometry_DEFINED
10
Chris Dalton7f578bf2017-09-05 16:46:48 -060011#include "SkGeometry.h"
Chris Daltonc1e59632017-09-05 00:30:07 -060012#include "SkNx.h"
13#include "SkPoint.h"
14#include "SkTArray.h"
Chris Dalton419a94d2017-08-28 10:24:22 -060015
Chris Daltonc1e59632017-09-05 00:30:07 -060016/**
17 * This class chops device-space contours up into a series of segments that CCPR knows how to
18 * render. (See GrCCPRGeometry::Verb.)
Chris Dalton419a94d2017-08-28 10:24:22 -060019 *
20 * NOTE: This must be done in device space, since an affine transformation can change whether a
21 * curve is monotonic.
Chris Dalton419a94d2017-08-28 10:24:22 -060022 */
Chris Daltonc1e59632017-09-05 00:30:07 -060023class GrCCPRGeometry {
24public:
25 // These are the verbs that CCPR knows how to draw. If a path has any segments that don't map to
26 // this list, then they are chopped into smaller ones that do. A list of these comprise a
27 // compact representation of what can later be expanded into GPU instance data.
28 enum class Verb : uint8_t {
29 kBeginPath, // Included only for caller convenience.
30 kBeginContour,
31 kLineTo,
32 kMonotonicQuadraticTo, // Monotonic relative to the vector between its endpoints [P2 - P0].
Chris Dalton7f578bf2017-09-05 16:46:48 -060033 kMonotonicSerpentineTo,
34 kMonotonicLoopTo,
Chris Daltonc1e59632017-09-05 00:30:07 -060035 kEndClosedContour, // endPt == startPt.
36 kEndOpenContour // endPt != startPt.
37 };
38
39 // These tallies track numbers of CCPR primitives are required to draw a contour.
40 struct PrimitiveTallies {
41 int fTriangles; // Number of triangles in the contour's fan.
42 int fQuadratics;
43 int fSerpentines;
44 int fLoops;
45
46 void operator+=(const PrimitiveTallies&);
47 PrimitiveTallies operator-(const PrimitiveTallies&) const;
48 };
49
50 GrCCPRGeometry(int numSkPoints = 0, int numSkVerbs = 0)
51 : fPoints(numSkPoints * 3) // Reserve for a 3x expansion in points and verbs.
52 , fVerbs(numSkVerbs * 3) {}
53
54 const SkTArray<SkPoint, true>& points() const { SkASSERT(!fBuildingContour); return fPoints; }
55 const SkTArray<Verb, true>& verbs() const { SkASSERT(!fBuildingContour); return fVerbs; }
56
57 void reset() {
58 SkASSERT(!fBuildingContour);
59 fPoints.reset();
60 fVerbs.reset();
61 }
62
63 // This is included in case the caller needs to discard previously added contours. It is up to
64 // the caller to track counts and ensure we don't pop back into the middle of a different
65 // contour.
66 void resize_back(int numPoints, int numVerbs) {
67 SkASSERT(!fBuildingContour);
68 fPoints.resize_back(numPoints);
69 fVerbs.resize_back(numVerbs);
70 SkASSERT(fVerbs.empty() || fVerbs.back() == Verb::kEndOpenContour ||
71 fVerbs.back() == Verb::kEndClosedContour);
72 }
73
74 void beginPath();
75 void beginContour(const SkPoint& devPt);
76 void lineTo(const SkPoint& devPt);
77 void quadraticTo(const SkPoint& devP1, const SkPoint& devP2);
Chris Dalton7f578bf2017-09-05 16:46:48 -060078
79 // We pass through inflection points and loop intersections using a line and quadratic(s)
80 // respectively. 'inflectPad' and 'loopIntersectPad' specify how close (in pixels) cubic
81 // segments are allowed to get to these points. For normal rendering you will want to use the
82 // default values, but these can be overridden for testing purposes.
83 //
84 // NOTE: loops do appear to require two full pixels of padding around the intersection point.
85 // With just one pixel-width of pad, we start to see bad pixels. Ultimately this has a
86 // minimal effect on the total amount of segments produced. Most sections that pass
87 // through the loop intersection can be approximated with a single quadratic anyway,
88 // regardless of whether we are use one pixel of pad or two (1.622 avg. quads per loop
89 // intersection vs. 1.489 on the tiger).
90 void cubicTo(const SkPoint& devP1, const SkPoint& devP2, const SkPoint& devP3,
91 float inflectPad = 0.55f, float loopIntersectPad = 2);
92
Chris Daltonc1e59632017-09-05 00:30:07 -060093 PrimitiveTallies endContour(); // Returns the numbers of primitives needed to draw the contour.
94
95private:
96 inline void appendMonotonicQuadratic(const Sk2f& p1, const Sk2f& p2);
Chris Dalton7f578bf2017-09-05 16:46:48 -060097
98 using AppendCubicFn = void(GrCCPRGeometry::*)(const Sk2f& p0, const Sk2f& p1,
99 const Sk2f& p2, const Sk2f& p3,
100 int maxSubdivisions);
101 static constexpr int kMaxSubdivionsPerCubicSection = 2;
102
103 template<AppendCubicFn AppendLeftRight>
104 inline void chopCubicAtMidTangent(const Sk2f& p0, const Sk2f& p1, const Sk2f& p2,
105 const Sk2f& p3, const Sk2f& tan0, const Sk2f& tan3,
106 int maxFutureSubdivisions = kMaxSubdivionsPerCubicSection);
107
108 template<AppendCubicFn AppendLeft, AppendCubicFn AppendRight>
109 inline void chopCubic(const Sk2f& p0, const Sk2f& p1, const Sk2f& p2, const Sk2f& p3,
110 float T, int maxFutureSubdivisions = kMaxSubdivionsPerCubicSection);
111
112 void appendMonotonicCubics(const Sk2f& p0, const Sk2f& p1, const Sk2f& p2, const Sk2f& p3,
113 int maxSubdivisions = kMaxSubdivionsPerCubicSection);
114 void appendCubicApproximation(const Sk2f& p0, const Sk2f& p1, const Sk2f& p2, const Sk2f& p3,
115 int maxSubdivisions = kMaxSubdivionsPerCubicSection);
Chris Daltonc1e59632017-09-05 00:30:07 -0600116
117 // Transient state used while building a contour.
118 SkPoint fCurrAnchorPoint;
119 SkPoint fCurrFanPoint;
120 PrimitiveTallies fCurrContourTallies;
Chris Dalton7f578bf2017-09-05 16:46:48 -0600121 SkCubicType fCurrCubicType;
Chris Daltonc1e59632017-09-05 00:30:07 -0600122 SkDEBUGCODE(bool fBuildingContour = false);
123
124 // TODO: These points could eventually be written directly to block-allocated GPU buffers.
125 SkSTArray<128, SkPoint, true> fPoints;
126 SkSTArray<128, Verb, true> fVerbs;
127};
128
129inline void GrCCPRGeometry::PrimitiveTallies::operator+=(const PrimitiveTallies& b) {
130 fTriangles += b.fTriangles;
131 fQuadratics += b.fQuadratics;
132 fSerpentines += b.fSerpentines;
133 fLoops += b.fLoops;
134}
135
136GrCCPRGeometry::PrimitiveTallies
137inline GrCCPRGeometry::PrimitiveTallies::operator-(const PrimitiveTallies& b) const {
138 return {fTriangles - b.fTriangles,
139 fQuadratics - b.fQuadratics,
140 fSerpentines - b.fSerpentines,
141 fLoops - b.fLoops};
142}
Chris Dalton419a94d2017-08-28 10:24:22 -0600143
144#endif