HomeSort by relevance Sort by last modified time
    Searched full:nextpt (Results 1 - 8 of 8) sorted by null

  /external/chromium_org/third_party/skia/src/core/
SkStroke.cpp 436 const SkPoint* nextPt = &pt1;
438 nextPt = &pt2;
439 this->preJoinTo(*nextPt, &normalAB, &unitAB, false);
SkPath.cpp 252 int nextPt = -1;
260 nextPt = 1;
268 nextPt = 2;
273 nextPt = 3;
281 if (-1 != nextPt) {
282 if (!check_edge_against_rect(prevPt, pts[nextPt], rect, direction)) {
285 prevPt = pts[nextPt];
    [all...]
  /external/skia/src/core/
SkStroke.cpp 436 const SkPoint* nextPt = &pt1;
438 nextPt = &pt2;
439 this->preJoinTo(*nextPt, &normalAB, &unitAB, false);
SkPath.cpp 252 int nextPt = -1;
260 nextPt = 1;
268 nextPt = 2;
273 nextPt = 3;
281 if (-1 != nextPt) {
282 if (!check_edge_against_rect(prevPt, pts[nextPt], rect, direction)) {
285 prevPt = pts[nextPt];
    [all...]
  /external/chromium_org/third_party/skia/experimental/Intersection/
EdgeWalker.cpp 875 goto nextPt;
882 nextPt:
    [all...]
  /external/skia/experimental/Intersection/
EdgeWalker.cpp 875 goto nextPt;
882 nextPt:
    [all...]
  /external/chromium_org/third_party/skia/src/pathops/
SkOpSegment.cpp 226 const SkPoint* nextPt;
228 nextPt = &fTs[++tIndex].fPt;
229 SkASSERT(fTs[tIndex].fT < 1 || startPt != *nextPt);
230 } while (startPt == *nextPt);
331 SkPoint nextPt = startPt;
336 } while (nextPt == *workPt);
340 } while (nextPt == *oWorkPt);
341 nextPt = *workPt;
348 addTPair(tStart, other, oStart, false, nextPt);
350 } while (endPt != nextPt);
    [all...]
  /external/skia/src/pathops/
SkOpSegment.cpp 226 const SkPoint* nextPt;
228 nextPt = &fTs[++tIndex].fPt;
229 SkASSERT(fTs[tIndex].fT < 1 || startPt != *nextPt);
230 } while (startPt == *nextPt);
331 SkPoint nextPt = startPt;
336 } while (nextPt == *workPt);
340 } while (nextPt == *oWorkPt);
341 nextPt = *workPt;
348 addTPair(tStart, other, oStart, false, nextPt);
350 } while (endPt != nextPt);
    [all...]

Completed in 571 milliseconds