27 // precise about the smaller 2 roots, so we have this arbitrary cutoff for when A is
78     // In either case, we have no finite roots.  in RootsReal()
84     double* roots = solution;  in RootsReal()  local
85     if (R2MinusQ3 < 0) {   // we have 3 real roots  in RootsReal()
91         *roots++ = r;  in RootsReal()
95             *roots++ = r;  in RootsReal()
99             (roots - solution == 1 || !nearly_equal(solution[1], r))) {  in RootsReal()
100             *roots++ = r;  in RootsReal()
113         *roots++ = r;  in RootsReal()
118                 *roots++ = r;  in RootsReal()
122     return static_cast<int>(roots - solution);  in RootsReal()
133             // Make sure we do not already have 1 (or something very close) in the list of roots.  in RootsValidT()
139             // Make sure we do not already have 0 (or something very close) in the list of roots.  in RootsValidT()
162     double roots[2] = {0, 0};  in find_extrema_valid_t()  local
163     int numRoots = SkQuads::RootsReal(3*A, 2*B, C, roots);  in find_extrema_valid_t()
166         double tValue = roots[i];  in find_extrema_valid_t()
220         // While the roots will be in the range 0 to 1 inclusive, they might not be sorted.  in BinarySearchRootsValidT()