18 static bool controls_inside(const SkDCubic& cubic) {
19     return between(cubic[0].fX, cubic[1].fX, cubic[3].fX)
20             && between(cubic[0].fX, cubic[2].fX, cubic[3].fX)
21             && between(cubic[0].fY, cubic[1].fY, cubic[3].fY)
22             && between(cubic[0].fY, cubic[2].fY, cubic[3].fY);
25 static bool tiny(const SkDCubic& cubic) {
29         if (cubic[minX].fX > cubic[index].fX) {
32         if (cubic[minY].fY > cubic[index].fY) {
35         if (cubic[maxX].fX < cubic[index].fX) {
38         if (cubic[maxY].fY < cubic[index].fY) {
42     return     approximately_equal(cubic[maxX].fX, cubic[minX].fX)
43             && approximately_equal(cubic[maxY].fY, cubic[minY].fY);
46 static void find_tight_bounds(const SkDCubic& cubic, SkDRect& bounds) {
47     SkDCubicPair cubicPair = cubic.chopAt(0.5);
111         SkDCubic cubic;  in DEF_TEST()  local
112         cubic.debugSet(c.fPts);  in DEF_TEST()
113         SkASSERT(ValidCubic(cubic));  in DEF_TEST()
114         order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics);  in DEF_TEST()
122         SkDCubic cubic;  in DEF_TEST()  local
123         cubic.debugSet(c.fPts);  in DEF_TEST()
124         SkASSERT(ValidCubic(cubic));  in DEF_TEST()
125         order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics);  in DEF_TEST()
128             order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics);  in DEF_TEST()
134         SkDCubic cubic;  in DEF_TEST()  local
135         cubic.debugSet(c.fPts);  in DEF_TEST()
136         SkASSERT(ValidCubic(cubic));  in DEF_TEST()
137         order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics);  in DEF_TEST()
145         SkDCubic cubic;  in DEF_TEST()  local
146         cubic.debugSet(c.fPts);  in DEF_TEST()
147         SkASSERT(ValidCubic(cubic));  in DEF_TEST()
148         order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics);  in DEF_TEST()
156         SkDCubic cubic;  in DEF_TEST()  local
157         cubic.debugSet(c.fPts);  in DEF_TEST()
158         SkASSERT(ValidCubic(cubic));  in DEF_TEST()
159         order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics);  in DEF_TEST()
167         SkDCubic cubic;  in DEF_TEST()  local
168         cubic.debugSet(c.fPts);  in DEF_TEST()
169         SkASSERT(ValidCubic(cubic));  in DEF_TEST()
170         order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics);  in DEF_TEST()
173             order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics);  in DEF_TEST()
179         SkDCubic cubic;  in DEF_TEST()  local
180         cubic.debugSet(c.fPts);  in DEF_TEST()
181         SkASSERT(ValidCubic(cubic));  in DEF_TEST()
182         order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics);  in DEF_TEST()
193         SkDCubic cubic = quad.debugToCubic();  in DEF_TEST()  local
194         order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics);  in DEF_TEST()
205         SkDCubic cubic = quad.debugToCubic();  in DEF_TEST()  local
206         order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics);  in DEF_TEST()
217         SkDCubic cubic = quad.debugToCubic();  in DEF_TEST()  local
218         order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics);  in DEF_TEST()
228         const SkDCubic& cubic = lines[index];  in DEF_TEST()
229         SkASSERT(ValidCubic(cubic));  in DEF_TEST()
230         bool controlsInside = controls_inside(cubic);  in DEF_TEST()
231         order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics,  in DEF_TEST()
238             if (       (reducer.fLine[0].fX != cubic[0].fX && reducer.fLine[0].fX != cubic[3].fX)  in DEF_TEST()
239                     || (reducer.fLine[0].fY != cubic[0].fY && reducer.fLine[0].fY != cubic[3].fY)  in DEF_TEST()
240                     || (reducer.fLine[1].fX != cubic[0].fX && reducer.fLine[1].fX != cubic[3].fX)  in DEF_TEST()
241                     || (reducer.fLine[1].fY != cubic[0].fY && reducer.fLine[1].fY != cubic[3].fY)) {  in DEF_TEST()
249             find_tight_bounds(cubic, bounds);  in DEF_TEST()