aboutsummaryrefslogtreecommitdiffhomepage
path: root/tests
diff options
context:
space:
mode:
authorGravatar reed@google.com <reed@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81>2014-04-18 19:36:22 +0000
committerGravatar reed@google.com <reed@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81>2014-04-18 19:36:22 +0000
commit33a94e2ba79d41de91d3412d8ae1504c187aacb1 (patch)
tree0408522f8c7760017abe8b0b80912e570dbf76bf /tests
parentaec406650cbfa4ef65d83db5ff4f82572e8e098f (diff)
remove unused fOverflowed from SkClampRange
TBR=scroggo@google.com Review URL: https://codereview.chromium.org/243563002 git-svn-id: http://skia.googlecode.com/svn/trunk@14260 2bbb7eff-a529-9590-31e7-b0007b416f81
Diffstat (limited to 'tests')
-rw-r--r--tests/ClampRangeTest.cpp45
1 files changed, 18 insertions, 27 deletions
diff --git a/tests/ClampRangeTest.cpp b/tests/ClampRangeTest.cpp
index b8059bc485..28fcffc5e7 100644
--- a/tests/ClampRangeTest.cpp
+++ b/tests/ClampRangeTest.cpp
@@ -50,33 +50,24 @@ static void slow_check(const SkClampRange& range,
SkFixed fx, SkFixed dx, int count) {
SkASSERT(range.fCount0 + range.fCount1 + range.fCount2 == count);
- int i;
- if (range.fOverflowed) {
- fx = range.fFx1;
- for (i = 0; i < range.fCount1; i++) {
- R_ASSERT(fx >= 0 && fx <= 0xFFFF);
- fx += dx;
- }
- } else {
- for (i = 0; i < range.fCount0; i++) {
- int v = classify_value(fx, V0, V1);
- R_ASSERT(v == range.fV0);
- fx += dx;
- }
- if (range.fCount1 > 0 && fx != range.fFx1) {
- SkDebugf("%x %x\n", fx, range.fFx1);
- R_ASSERT(false); // bad fFx1
- return;
- }
- for (i = 0; i < range.fCount1; i++) {
- R_ASSERT(fx >= 0 && fx <= 0xFFFF);
- fx += dx;
- }
- for (i = 0; i < range.fCount2; i++) {
- int v = classify_value(fx, V0, V1);
- R_ASSERT(v == range.fV1);
- fx += dx;
- }
+ for (int i = 0; i < range.fCount0; i++) {
+ int v = classify_value(fx, V0, V1);
+ R_ASSERT(v == range.fV0);
+ fx += dx;
+ }
+ if (range.fCount1 > 0 && fx != range.fFx1) {
+ SkDebugf("%x %x\n", fx, range.fFx1);
+ R_ASSERT(false); // bad fFx1
+ return;
+ }
+ for (int i = 0; i < range.fCount1; i++) {
+ R_ASSERT(fx >= 0 && fx <= 0xFFFF);
+ fx += dx;
+ }
+ for (int i = 0; i < range.fCount2; i++) {
+ int v = classify_value(fx, V0, V1);
+ R_ASSERT(v == range.fV1);
+ fx += dx;
}
}