Lines Matching refs:prevEdge
376 OffsetEdge* prevEdge = currEdge->fPrev;
380 while (head && prevEdge != currEdge) {
389 if (compute_intersection(prevEdge->fOffset, currEdge->fOffset,
392 if (s < prevEdge->fTValue) {
394 remove_node(prevEdge, &head);
397 prevEdge = prevEdge->fPrev;
410 prevEdge = currEdge;
417 prevEdge->fOffset.fP0);
421 prevEdge->fOffset.fP0 + prevEdge->fOffset.fV)) {
423 remove_node(prevEdge, &head);
426 prevEdge = prevEdge->fPrev;
1253 OffsetEdge* prevEdge = nullptr;
1277 currEdge->fPrev = prevEdge;
1278 if (prevEdge) {
1279 prevEdge->fNext = currEdge;
1281 prevEdge = currEdge;
1288 currEdge->fPrev = prevEdge;
1289 if (prevEdge) {
1290 prevEdge->fNext = currEdge;
1292 prevEdge = currEdge;
1301 currEdge->fPrev = prevEdge;
1302 if (prevEdge) {
1303 prevEdge->fNext = currEdge;
1305 prevEdge = currEdge;
1308 SkASSERT(prevEdge);
1309 prevEdge->fNext = &edgeData[0];
1310 edgeData[0].fPrev = prevEdge;
1319 while (head && prevEdge != currEdge && offsetVertexCount > 0) {
1328 if (prevEdge->checkIntersection(currEdge, &intersection, &s, &t)) {
1330 if (s < prevEdge->fTValue) {
1332 remove_node(prevEdge, &head);
1335 prevEdge = prevEdge->fPrev;
1346 currEdge->fIndex = prevEdge->fEnd;
1349 prevEdge = currEdge;
1355 OffsetEdge* prevPrevEdge = prevEdge->fPrev;
1358 SkScalar dist1 = prevEdge->computeCrossingDistance(currNextEdge);
1364 prevEdge->fOffset.fP0);
1376 remove_node(prevEdge, &head);
1377 prevEdge = prevPrevEdge;
1385 remove_node(prevEdge, &head);
1386 prevEdge = prevPrevEdge;