Searched refs:foundRoots (Results 1 - 8 of 8) sorted by relevance
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | QuadraticUtilities.cpp | 78 int foundRoots = 0; local 87 for (int idx2 = 0; idx2 < foundRoots; ++idx2) { 92 t[foundRoots++] = tValue; 97 return foundRoots; 117 int foundRoots = 0; 126 ++foundRoots; 135 if (foundRoots == 0 || !approximately_negative(ratio - t[0])) { 136 t[foundRoots++] = ratio; 138 t[foundRoots++] = t[0]; 145 int foundRoots local [all...] |
H A D | CubicUtilities.cpp | 163 int foundRoots = add_valid_ts(s, realRoots, t); local 164 return foundRoots;
|
/external/skia/experimental/Intersection/ |
H A D | QuadraticUtilities.cpp | 78 int foundRoots = 0; local 87 for (int idx2 = 0; idx2 < foundRoots; ++idx2) { 92 t[foundRoots++] = tValue; 97 return foundRoots; 117 int foundRoots = 0; 126 ++foundRoots; 135 if (foundRoots == 0 || !approximately_negative(ratio - t[0])) { 136 t[foundRoots++] = ratio; 138 t[foundRoots++] = t[0]; 145 int foundRoots local [all...] |
H A D | CubicUtilities.cpp | 163 int foundRoots = add_valid_ts(s, realRoots, t); local 164 return foundRoots;
|
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkPathOpsQuad.cpp | 70 int foundRoots = 0; local 79 for (int idx2 = 0; idx2 < foundRoots; ++idx2) { 84 t[foundRoots++] = tValue; 89 return foundRoots; 100 int foundRoots = AddValidTs(s, realRoots, t); local 101 return foundRoots;
|
H A D | SkPathOpsCubic.cpp | 194 int foundRoots = SkDQuad::AddValidTs(s, realRoots, t); local 195 return foundRoots;
|
/external/skia/src/pathops/ |
H A D | SkPathOpsQuad.cpp | 70 int foundRoots = 0; local 79 for (int idx2 = 0; idx2 < foundRoots; ++idx2) { 84 t[foundRoots++] = tValue; 89 return foundRoots; 100 int foundRoots = AddValidTs(s, realRoots, t); local 101 return foundRoots;
|
H A D | SkPathOpsCubic.cpp | 194 int foundRoots = SkDQuad::AddValidTs(s, realRoots, t); local 195 return foundRoots;
|
Completed in 169 milliseconds