Lines Matching full:edge
12 #define F (false) // discard the edge
13 #define T (true) // keep the edge
92 // edge leading into junction
349 SkPoint edge[4];
356 subDivide(start, end, edge);
357 ePtr = edge;
402 // add 2 to edge or out of range values to get T extremes
419 // Defer all coincident edge processing until
546 // FIXME: there's probably an edge case that can be constructed where
781 // add edge leading into junction
786 // add edge leading away from junction
841 // find edge on either side of intersection
984 // intersect ray starting at basePt with edge
1019 return SK_MinS32; // if the intersection is edge on, wait for another one
1692 // and use more concise logic like the old edge walker code?
1776 // FIXME: I doubt it makes sense to (necessarily) swap if the edge was not the first
1829 when we start with a vertical intersect, we try to use the dx to determine if the edge is to
2181 SkPoint edge[4];
2182 subDivide(tStart, tEnd, edge);
2184 double sum = (edge[0].fX - edge[points].fX) * (edge[0].fY + edge[points].fY);
2186 SkScalar lesser = SkTMin<SkScalar>(edge[0].fY, edge[3].fY);
2187 if (edge[1].fY < lesser && edge[2].fY < lesser) {
2188 SkDLine tangent1 = {{ {edge[0].fX, edge[0].fY}, {edge[1].fX, edge[1].fY} }};
2189 SkDLine tangent2 = {{ {edge[2].fX, edge[2].fY}, {edge[3].fX, edge[3].fY} }};
2192 sum += (topPt.fX - edge[0].fX) * (topPt.fY + edge[0].fY);
2193 sum += (edge[3].fX - topPt.fX) * (edge[3].fY + topPt.fY);
2199 sum += (edge[idx + 1].fX - edge[idx].fX) * (edge[idx + 1].fY + edge[idx].fY);
2436 // determine starting points for edge detection in find top and the like.
2474 bool SkOpSegment::subDivide(int start, int end, SkPoint edge[4]) const {
2476 edge[0] = fTs[start].fPt;
2478 edge[points] = fTs[end].fPt;
2487 edge[1] = fPts[1];
2492 edge[1] = fPts[1];
2493 edge[2] = fPts[2];
2496 edge[1] = fPts[2];
2497 edge[2] = fPts[1];
2500 const SkDPoint sub[2] = {{ edge[0].fX, edge[0].fY}, {edge[points].fX, edge[points].fY }};
2502 edge[1] = SkDQuad::SubDivide(fPts, sub[0], sub[1], startT, endT).asSkPoint();
2507 edge[1] = ctrl[0].asSkPoint();
2508 edge[2] = ctrl[1].asSkPoint();
2550 SkPoint edge[4];
2551 subDivide(start, end, edge);
2552 (bounds->*SetCurveBounds[SkPathOpsVerbToPoints(fVerb)])(edge);
