384                        SkScalar tValues[2]) {  in SkFindCubicExtrema()
390     return SkFindUnitQuadRoots(A, B, C, tValues);  in SkFindCubicExtrema()
442                    const SkScalar tValues[], int roots) {  in SkChopCubicAt()  argument
447             SkASSERT(is_unit_interval(tValues[i]));  in SkChopCubicAt()
448             SkASSERT(is_unit_interval(tValues[i+1]));  in SkChopCubicAt()
449             SkASSERT(tValues[i] < tValues[i+1]);  in SkChopCubicAt()
458             SkScalar    t = tValues[0];  in SkChopCubicAt()
473                 if (!valid_unit_divide(tValues[i+1] - tValues[i],  in SkChopCubicAt()
474                                        SK_Scalar1 - tValues[i], &t)) {  in SkChopCubicAt()
501     SkScalar    tValues[2];  in SkChopCubicAtYExtrema()  local
503                                            src[3].fY, tValues);  in SkChopCubicAtYExtrema()
505     SkChopCubicAt(src, dst, tValues, roots);  in SkChopCubicAtYExtrema()
517     SkScalar    tValues[2];  in SkChopCubicAtXExtrema()  local
519                                            src[3].fX, tValues);  in SkChopCubicAtXExtrema()
521     SkChopCubicAt(src, dst, tValues, roots);  in SkChopCubicAtXExtrema()
543 int SkFindCubicInflections(const SkPoint src[4], SkScalar tValues[]) {  in SkFindCubicInflections()  argument
554                                tValues);  in SkFindCubicInflections()
558     SkScalar    tValues[2];  in SkChopCubicAtInflections()  local
559     int         count = SkFindCubicInflections(src, tValues);  in SkChopCubicAtInflections()
565             SkChopCubicAt(src, dst, tValues, count);  in SkChopCubicAtInflections()
720 static int solve_cubic_poly(const SkScalar coeff[4], SkScalar tValues[3]) {  in solve_cubic_poly()
722         return SkFindUnitQuadRoots(coeff[1], coeff[2], coeff[3], tValues);  in solve_cubic_poly()
742     SkScalar*   roots = tValues;  in solve_cubic_poly()
764         int count = (int)(roots - tValues);  in solve_cubic_poly()
766         bubble_sort(tValues, count);  in solve_cubic_poly()
767         count = collaps_duplicates(tValues, count);  in solve_cubic_poly()
768         roots = tValues + count;    // so we compute the proper count below  in solve_cubic_poly()
784     return (int)(roots - tValues);  in solve_cubic_poly()
820 int SkFindCubicMaxCurvature(const SkPoint src[4], SkScalar tValues[3]) {  in SkFindCubicMaxCurvature()
840             tValues[maxCount++] = t[i];  in SkFindCubicMaxCurvature()
847                               SkScalar tValues[3]) {  in SkChopCubicAtMaxCurvature()
850     if (tValues == nullptr) {  in SkChopCubicAtMaxCurvature()
851         tValues = t_storage;  in SkChopCubicAtMaxCurvature()
854     int count = SkFindCubicMaxCurvature(src, tValues);  in SkChopCubicAtMaxCurvature()
860             SkChopCubicAt(src, dst, tValues, count);  in SkChopCubicAtMaxCurvature()
939     SkScalar tValues[2];  in conic_find_extrema()  local
940     int roots = SkFindUnitQuadRoots(coeff[0], coeff[1], coeff[2], tValues);  in conic_find_extrema()
944         *t = tValues[0];  in conic_find_extrema()