149 bool SkDCubic::hullIntersects(const SkDPoint* pts, int ptCount, bool* isLinear) const {  in hullIntersects()
194     *isLinear = linear;  in hullIntersects()
198 bool SkDCubic::hullIntersects(const SkDCubic& c2, bool* isLinear) const {  in hullIntersects()
199     return hullIntersects(c2.fPts, SkDCubic::kPointCount, isLinear);  in hullIntersects()
202 bool SkDCubic::hullIntersects(const SkDQuad& quad, bool* isLinear) const {  in hullIntersects()
203     return hullIntersects(quad.fPts, SkDQuad::kPointCount, isLinear);  in hullIntersects()
206 bool SkDCubic::hullIntersects(const SkDConic& conic, bool* isLinear) const {  in hullIntersects()
208     return hullIntersects(conic.fPts, isLinear);  in hullIntersects()
211 bool SkDCubic::isLinear(int startIndex, int endIndex) const {  in isLinear()  function in SkDCubic
213         return ((const SkDQuad *) this)->isLinear(0, 2);  in isLinear()
742 bool SkTCubic::hullIntersects(const SkDQuad& quad, bool* isLinear) const {  in hullIntersects()
743     return quad.hullIntersects(fCubic, isLinear);  in hullIntersects()
746 bool SkTCubic::hullIntersects(const SkDConic& conic, bool* isLinear) const  {  in hullIntersects()
747     return conic.hullIntersects(fCubic, isLinear);  in hullIntersects()