Lines Matching refs:tValues

452                        SkScalar tValues[2]) {
458 return SkFindUnitQuadRoots(A, B, C, tValues);
489 valid_unit_divide in SkChopCubicAt(... tValues[], int roots). The reason is
510 const SkScalar tValues[], int roots) {
515 SkASSERT(is_unit_interval(tValues[i]));
516 SkASSERT(is_unit_interval(tValues[i+1]));
517 SkASSERT(tValues[i] < tValues[i+1]);
526 SkScalar t = tValues[0];
541 if (!valid_unit_divide(tValues[i+1] - tValues[i],
542 SK_Scalar1 - tValues[i], &t)) {
587 SkScalar tValues[2];
589 src[3].fY, tValues);
591 SkChopCubicAt(src, dst, tValues, roots);
603 SkScalar tValues[2];
605 src[3].fX, tValues);
607 SkChopCubicAt(src, dst, tValues, roots);
629 int SkFindCubicInflections(const SkPoint src[4], SkScalar tValues[]) {
640 tValues);
644 SkScalar tValues[2];
645 int count = SkFindCubicInflections(src, tValues);
651 SkChopCubicAt(src, dst, tValues, count);
734 Eliminates repeated roots (so that all tValues are distinct, and are always
737 static int solve_cubic_poly(const SkScalar coeff[4], SkScalar tValues[3]) {
739 return SkFindUnitQuadRoots(coeff[1], coeff[2], coeff[3], tValues);
759 SkScalar* roots = tValues;
781 int count = (int)(roots - tValues);
783 bubble_sort(tValues, count);
784 count = collaps_duplicates(tValues, count);
785 roots = tValues + count; // so we compute the proper count below
801 return (int)(roots - tValues);
837 int SkFindCubicMaxCurvature(const SkPoint src[4], SkScalar tValues[3]) {
857 tValues[maxCount++] = t[i];
864 SkScalar tValues[3]) {
867 if (tValues == NULL) {
868 tValues = t_storage;
871 int count = SkFindCubicMaxCurvature(src, tValues);
877 SkChopCubicAt(src, dst, tValues, count);
1250 SkScalar tValues[2];
1251 int roots = SkFindUnitQuadRoots(coeff[0], coeff[1], coeff[2], tValues);
1255 *t = tValues[0];