Lines Matching refs:pts
14 bool SkXRayCrossesLine(const SkXRay& pt, const SkPoint pts[2], bool* ambiguous) {
21 if (pt.fY == pts[0].fY) {
27 if (pt.fY < pts[0].fY && pt.fY < pts[1].fY)
29 if (pt.fY > pts[0].fY && pt.fY > pts[1].fY)
31 if (pt.fX > pts[0].fX && pt.fX > pts[1].fX)
34 if (SkScalarNearlyZero(pts[0].fY - pts[1].fY))
36 if (SkScalarNearlyZero(pts[0].fX - pts[1].fX)) {
39 if (pt.fX <= pts[0].fX) {
41 *ambiguous = (pt.fY == pts[1].fY);
48 if (pt.fY == pts[1].fY) {
49 if (pt.fX <= pts[1].fX) {
58 SkScalar delta_y = pts[1].fY - pts[0].fY;
59 SkScalar delta_x = pts[1].fX - pts[0].fX;
61 SkScalar b = pts[0].fY - SkScalarMul(slope, pts[0].fX);
472 void SkGetCubicCoeff(const SkPoint pts[4], SkScalar cx[4], SkScalar cy[4])
474 SkASSERT(pts);
477 get_cubic_coeff(&pts[0].fX, cx);
479 get_cubic_coeff(&pts[0].fY, cy);
1587 static SkPoint* subdivide(const SkConic& src, SkPoint pts[], int level) {
1591 memcpy(pts, &src.fPts[1], 2 * sizeof(SkPoint));
1592 return pts + 2;
1597 pts = subdivide(dst[0], pts, level);
1598 return subdivide(dst[1], pts, level);
1602 int SkConic::chopIntoQuadsPOW2(SkPoint pts[], int pow2) const {
1604 *pts = fPts[0];
1605 SkDEBUGCODE(SkPoint* endPts =) subdivide(*this, pts + 1, pow2);
1606 SkASSERT(endPts - pts == (2 * (1 << pow2) + 1));
1649 SkPoint pts[4];
1650 pts[0] = fPts[0];
1651 pts[1] = fPts[2];
1656 this->evalAt(t, &pts[count++]);
1659 this->evalAt(t, &pts[count++]);
1661 bounds->set(pts, count);