SkOpSegment.cpp gcc 4.7 build failure.

src/pathops/SkOpSegment.cpp

 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 #include "SkIntersections.h"
 #include "SkOpSegment.h"
 #include "SkPathWriter.h"
 #include "SkTSort.h"
@@ skipping 2219 matching lines @@
 SkOpSegment* SkOpSegment::nextChase(int* index, const int step, int* min, SkOpSpan** last) {
     int end = nextExactSpan(*index, step);
     SkASSERT(end >= 0);
     if (multipleSpans(end)) {
         *last = &fTs[end];
         return NULL;
     }
     const SkOpSpan& endSpan = fTs[end];
     SkOpSegment* other = endSpan.fOther;
     *index = endSpan.fOtherIndex;
-    SkASSERT(index >= 0);
+    SkASSERT(*index >= 0);
     int otherEnd = other->nextExactSpan(*index, step);
     SkASSERT(otherEnd >= 0);
     *min = SkMin32(*index, otherEnd);
     return other;
 }
 
 // This has callers for two different situations: one establishes the end
 // of the current span, and one establishes the beginning of the next span
 // (thus the name). When this is looking for the end of the current span,
 // coincidence is found when the beginning Ts contain -step and the end
@@ skipping 539 matching lines @@
         sum += fTs[i].fWindValue;
         slots[fTs[i].fOther->fID - 1] = as_digit(fTs[i].fWindValue);
         sum += fTs[i].fOppValue;
         slots[slotCount + fTs[i].fOther->fID - 1] = as_digit(fTs[i].fOppValue);
     }
     SkDebugf("%s id=%2d %.*s | %.*s\n", __FUNCTION__, fID, slotCount, slots.begin(), slotCount,
             slots.begin() + slotCount);
     return sum;
 }
 #endif