• Home
  • Raw
  • Download

Lines Matching refs:chops

251                                                        SkSTArray<4, float>* chops) {  in find_chops_around_inflection_points()  argument
252 SkASSERT(chops->empty()); in find_chops_around_inflection_points()
307 pts.store(chops->push_back_n(2)); in find_chops_around_inflection_points()
314 pts.store(chops->push_back_n(2)); in find_chops_around_inflection_points()
336 SkSTArray<4, float>* chops) { in find_chops_around_loop_intersection() argument
337 SkASSERT(chops->empty()); in find_chops_around_loop_intersection()
433 chops->push_back(0); in find_chops_around_loop_intersection()
435 chops->push_back(A + B + D[i]); in find_chops_around_loop_intersection()
437 chops->push_back(1); in find_chops_around_loop_intersection()
460 chops->push_back_n(2, &roots[i]); in find_chops_around_loop_intersection()
506 SkSTArray<4, float> chops; in cubicTo() local
508 find_chops_around_inflection_points(inflectPad, t, s, C0, C1, skipTerm, Cdet, &chops); in cubicTo()
510 find_chops_around_loop_intersection(loopIntersectPad, t, s, C0, C1, skipTerm, Cdet, &chops); in cubicTo()
512 if (4 == chops.count() && chops[1] >= chops[2]) { in cubicTo()
518 chops[1] = chops[2] = (ts[0] + ts[1]) / (2*s[0]*s[1]); in cubicTo()
522 for (int i = 1; i < chops.count(); ++i) { in cubicTo()
523 SkASSERT(chops[i] >= chops[i - 1]); in cubicTo()
526 this->appendCubics(AppendCubicMode::kLiteral, p0, p1, p2, p3, chops.begin(), chops.count()); in cubicTo()
541 const Sk2f& p2, const Sk2f& p3, const float chops[], in appendCubics() argument
546 float T = chops[midChopIdx]; in appendCubics()
552 this->appendCubics(rightMode, p0, p1, p2, p3, &chops[midChopIdx + 1], in appendCubics()
559 this->appendCubics(mode, p0, p1, p2, p3, chops, midChopIdx, localT0, localT1); in appendCubics()
566 this->appendCubics(mode, p0, p01, p02, pT, chops, midChopIdx, localT0, T); in appendCubics()
567 this->appendCubics(rightMode, pT, p11, p12, p3, &chops[midChopIdx + 1], in appendCubics()