Home
last modified time | relevance | path

Searched refs:cubicPair (Results 1 – 3 of 3) sorted by relevance

/external/skia/tests/
DPathOpsCubicReduceOrderTest.cpp45 SkDCubicPair cubicPair = cubic.chopAt(0.5);
46 if (!tiny(cubicPair.first()) && !controls_inside(cubicPair.first())) {
47 find_tight_bounds(cubicPair.first(), bounds);
49 bounds.add(cubicPair.first()[0]);
50 bounds.add(cubicPair.first()[3]);
52 if (!tiny(cubicPair.second()) && !controls_inside(cubicPair.second())) {
53 find_tight_bounds(cubicPair.second(), bounds);
55 bounds.add(cubicPair.second()[0]);
56 bounds.add(cubicPair.second()[3]);
DPathOpsOpTest.cpp3849 SkPoint cubicPair[7]; in complex_to_quads() local
3850 SkChopCubicAt(pts, cubicPair, loopT); in complex_to_quads()
3852 c1.set(cubicPair); in complex_to_quads()
3853 c2.set(&cubicPair[3]); in complex_to_quads()
/external/skia/src/pathops/
DSkOpEdgeBuilder.cpp206 SkPoint cubicPair[7]; in walk() local
207 SkChopCubicAt(pointsPtr, cubicPair, loopT); in walk()
208 if (!SkScalarsAreFinite(&cubicPair[0].fX, SK_ARRAY_COUNT(cubicPair) * 2)) { in walk()
212 SkPath::Verb v1 = SkReduceOrder::Cubic(&cubicPair[0], cStorage[0]); in walk()
213 SkPath::Verb v2 = SkReduceOrder::Cubic(&cubicPair[3], cStorage[1]); in walk()
215 SkPoint* curve1 = v1 == SkPath::kCubic_Verb ? &cubicPair[0] : cStorage[0]; in walk()
216 SkPoint* curve2 = v2 == SkPath::kCubic_Verb ? &cubicPair[3] : cStorage[1]; in walk()