Lines Matching defs:fAbove
1376 // callers expect this to only read fAbove, fTangent
1380 return abCompare(fAbove, fBelow, rh.fAbove, rh.fBelow);
1385 return abCompare(fAbove, fBelow, rh.fAbove, rh.fBelow);
1393 line[0] = &rh.fAbove;
1395 curve[0] = &fAbove;
1399 line[0] = &fAbove;
1401 curve[0] = &rh.fAbove;
1506 LineXYAtT(fWorkEdge.fPts, tAbove, &fAbove);
1514 fAbove = quad[0];
1521 fAbove = cubic[0];
1539 if (fAbove.fY == fBelow.fY) {
1540 SkDebugf("%s edge=%d fAbove.fY != fBelow.fY %1.9g\n", __FUNCTION__,
1541 ID(), fAbove.fY);
1549 // OPTIMIZATION: if fAbove, fBelow have already been computed
1558 while (fAbove.fY == fBelow.fY) {
1615 if (fAbove != edge->fAbove || fBelow != edge->fBelow) {
1633 return fAbove == edge->fAbove && fBelow == edge->fBelow;
1703 if (edge->fAbove.fY < fAbove.fY) {
1704 t1 = (edge->fTangent.fY - edge->fAbove.fY) * (fAbove.fX - edge->fAbove.fX);
1705 t2 = (fAbove.fY - edge->fAbove.fY) * (edge->fTangent.fX - edge->fAbove.fX);
1706 } else if (edge->fAbove.fY > fAbove.fY) {
1707 t1 = (fTangent.fY - fAbove.fY) * (fAbove.fX - edge->fAbove.fX);
1708 t2 = (fAbove.fY - edge->fAbove.fY) * (fTangent.fX - fAbove.fX);
1710 t1 = fAbove.fX;
1711 t2 = edge->fAbove.fX;
1714 b1 = (edge->fTangent.fY - edge->fAbove.fY) * (fTangent.fX - edge->fTangent.fX);
1715 b2 = (fTangent.fY - edge->fTangent.fY) * (edge->fTangent.fX - edge->fAbove.fX);
1717 b1 = (fTangent.fY - fAbove.fY) * (fTangent.fX - edge->fTangent.fX);
1718 b2 = (fTangent.fY - edge->fTangent.fY) * (fTangent.fX - fAbove.fX);
1772 return IsCoincident(curveSample, lineEdge->fAbove, lineEdge->fBelow);
1809 extracted.fAbove = fAbove;
1821 extracted.fAbove = curve[0];
1828 SkPoint fAbove;
2242 if (activeEdge.fAbove != activeEdge.fBelow) {
2258 activeEdge.fAbove.fX, activeEdge.fAbove.fY, activeEdge.fTAbove,
2540 // by advancing fAbove/fBelow, the next call to sortHorizontal
2546 activePtr->fAbove = activePtr->fBelow;
