diff options
author | commit-bot@chromium.org <commit-bot@chromium.org@2bbb7eff-a529-9590-31e7-b0007b416f81> | 2013-11-21 17:04:29 +0000 |
---|---|---|
committer | commit-bot@chromium.org <commit-bot@chromium.org@2bbb7eff-a529-9590-31e7-b0007b416f81> | 2013-11-21 17:04:29 +0000 |
commit | 866f4e34a943c115ac372c22123a1520aa5f9b06 (patch) | |
tree | d2b7e2b36ae069cc1a6936d797d94cf1d3e86d27 /src/pathops/SkIntersections.cpp | |
parent | 8660783e196dc3cb4ead492253a493844fa43f7a (diff) |
optimize pathops coverage
Remove unused code from SkOpSegment.cpp and friends.
Add new tests exposed by coverage.
Fix a bug exposed by coverage -- removing the need to detect points that are nearby when intersecting.
Add gyp rule for building coverage flavor on Mac.
R=mtklein@google.com
Author: caryclark@google.com
Review URL: https://codereview.chromium.org/75453003
git-svn-id: http://skia.googlecode.com/svn/trunk@12344 2bbb7eff-a529-9590-31e7-b0007b416f81
Diffstat (limited to 'src/pathops/SkIntersections.cpp')
-rw-r--r-- | src/pathops/SkIntersections.cpp | 10 |
1 files changed, 0 insertions, 10 deletions
diff --git a/src/pathops/SkIntersections.cpp b/src/pathops/SkIntersections.cpp index 35846f6cc9..53cd6feb43 100644 --- a/src/pathops/SkIntersections.cpp +++ b/src/pathops/SkIntersections.cpp @@ -108,7 +108,6 @@ int SkIntersections::insert(double one, double two, const SkDPoint& pt) { int clearMask = ~((1 << index) - 1); fIsCoincident[0] += fIsCoincident[0] & clearMask; fIsCoincident[1] += fIsCoincident[1] & clearMask; - fIsNear += fIsNear & clearMask; } fPt[index] = pt; fT[0][index] = one; @@ -117,14 +116,6 @@ int SkIntersections::insert(double one, double two, const SkDPoint& pt) { return index; } -void SkIntersections::insertNear(double one, double two, const SkDPoint& pt) { - int index = insert(one, two, pt); - if (index < 0) { - return; - } - fIsNear |= 1 << index; -} - void SkIntersections::insertCoincident(double one, double two, const SkDPoint& pt) { int index = insertSwap(one, two, pt); int bit = 1 << index; @@ -188,7 +179,6 @@ void SkIntersections::removeOne(int index) { fIsCoincident[0] -= ((fIsCoincident[0] >> 1) & ~((1 << index) - 1)) + coBit; SkASSERT(!(coBit ^ (fIsCoincident[1] & (1 << index)))); fIsCoincident[1] -= ((fIsCoincident[1] >> 1) & ~((1 << index) - 1)) + coBit; - fIsNear -= ((fIsNear >> 1) & ~((1 << index) - 1)) + (fIsNear & (1 << index)); } void SkIntersections::swapPts() { |