29 // precise about the smaller 2 roots, so we have this arbitrary cutoff for when A is
80     // In either case, we have no finite roots.  in RootsReal()
86     double* roots = solution;  in RootsReal()  local
87     if (R2MinusQ3 < 0) {   // we have 3 real roots  in RootsReal()
93         *roots++ = r;  in RootsReal()
97             *roots++ = r;  in RootsReal()
101             (roots - solution == 1 || !nearly_equal(solution[1], r))) {  in RootsReal()
102             *roots++ = r;  in RootsReal()
115         *roots++ = r;  in RootsReal()
120                 *roots++ = r;  in RootsReal()
124     return static_cast<int>(roots - solution);  in RootsReal()
135             // Make sure we do not already have 1 (or something very close) in the list of roots.  in RootsValidT()
141             // Make sure we do not already have 0 (or something very close) in the list of roots.  in RootsValidT()
164     double roots[2] = {0, 0};  in find_extrema_valid_t()  local
165     int numRoots = SkQuads::RootsReal(3*A, 2*B, C, roots);  in find_extrema_valid_t()
168         double tValue = roots[i];  in find_extrema_valid_t()
222         // While the roots will be in the range 0 to 1 inclusive, they might not be sorted.  in BinarySearchRootsValidT()