| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| H A D | QuadraticReduceOrder.cpp | 104 _Point extrema; local
105 extrema.x = interp_quad_coords(quad[0].x, quad[1].x, quad[2].x, tValue);
106 extrema.y = interp_quad_coords(quad[0].y, quad[1].y, quad[2].y, tValue);
110 if (extrema.x < quad[0].x ^ extrema.x < quad[2].x) {
113 replace = (extrema.x < quad[0].x | extrema.x < quad[2].x)
116 if (extrema.y < quad[0].y ^ extrema.y < quad[2].y) {
119 replace = (extrema
[all...] |
| H A D | CubicReduceOrder.cpp | 135 _Point extrema; local
136 extrema.x = interp_cubic_coords(&cubic[0].x, tValues[index]);
137 extrema.y = interp_cubic_coords(&cubic[0].y, tValues[index]);
141 if (extrema.x < cubic[0].x ^ extrema.x < cubic[3].x) {
144 replace = (extrema.x < cubic[0].x | extrema.x < cubic[3].x)
147 if (extrema.y < cubic[0].y ^ extrema.y < cubic[3].y) {
150 replace = (extrema
[all...] |
| /external/skia/experimental/Intersection/ |
| H A D | QuadraticReduceOrder.cpp | 104 _Point extrema; local
105 extrema.x = interp_quad_coords(quad[0].x, quad[1].x, quad[2].x, tValue);
106 extrema.y = interp_quad_coords(quad[0].y, quad[1].y, quad[2].y, tValue);
110 if (extrema.x < quad[0].x ^ extrema.x < quad[2].x) {
113 replace = (extrema.x < quad[0].x | extrema.x < quad[2].x)
116 if (extrema.y < quad[0].y ^ extrema.y < quad[2].y) {
119 replace = (extrema
[all...] |
| H A D | CubicReduceOrder.cpp | 135 _Point extrema; local
136 extrema.x = interp_cubic_coords(&cubic[0].x, tValues[index]);
137 extrema.y = interp_cubic_coords(&cubic[0].y, tValues[index]);
141 if (extrema.x < cubic[0].x ^ extrema.x < cubic[3].x) {
144 replace = (extrema.x < cubic[0].x | extrema.x < cubic[3].x)
147 if (extrema.y < cubic[0].y ^ extrema.y < cubic[3].y) {
150 replace = (extrema
[all...] |
| /external/chromium_org/third_party/skia/src/pathops/ |
| H A D | SkDCubicLineIntersection.cpp | 115 int extrema = SkDCubic::FindExtrema(c[0].fX, c[1].fX, c[2].fX, c[3].fX, extremeTs); local
116 count = c.searchRoots(extremeTs, extrema, 0, SkDCubic::kXAxis, roots);
172 int extrema = SkDCubic::FindExtrema(c[0].fY, c[1].fY, c[2].fY, c[3].fY, extremeTs); local
173 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kYAxis, roots);
212 int extrema = SkDCubic::FindExtrema(c[0].fX, c[1].fX, c[2].fX, c[3].fX, extremeTs); local
213 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kXAxis, roots);
|
| H A D | SkPathOpsCubic.h | 55 int searchRoots(double extremes[6], int extrema, double axisIntercept,
|
| H A D | SkPathOpsCubic.cpp | 145 int SkDCubic::searchRoots(double extremeTs[6], int extrema, double axisIntercept, argument
147 extrema += findInflections(&extremeTs[extrema]);
148 extremeTs[extrema++] = 0;
149 extremeTs[extrema] = 1;
150 SkTQSort(extremeTs, extremeTs + extrema);
152 for (int index = 0; index < extrema; ) {
|
| /external/skia/src/pathops/ |
| H A D | SkDCubicLineIntersection.cpp | 115 int extrema = SkDCubic::FindExtrema(c[0].fX, c[1].fX, c[2].fX, c[3].fX, extremeTs); local
116 count = c.searchRoots(extremeTs, extrema, 0, SkDCubic::kXAxis, roots);
172 int extrema = SkDCubic::FindExtrema(c[0].fY, c[1].fY, c[2].fY, c[3].fY, extremeTs); local
173 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kYAxis, roots);
212 int extrema = SkDCubic::FindExtrema(c[0].fX, c[1].fX, c[2].fX, c[3].fX, extremeTs); local
213 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kXAxis, roots);
|
| H A D | SkPathOpsCubic.h | 55 int searchRoots(double extremes[6], int extrema, double axisIntercept,
|
| H A D | SkPathOpsCubic.cpp | 145 int SkDCubic::searchRoots(double extremeTs[6], int extrema, double axisIntercept, argument
147 extrema += findInflections(&extremeTs[extrema]);
148 extremeTs[extrema++] = 0;
149 extremeTs[extrema] = 1;
150 SkTQSort(extremeTs, extremeTs + extrema);
152 for (int index = 0; index < extrema; ) {
|