Define NDEBUG instead of SK_DEBUG/SK_RELEASE.

experimental/Intersection/Intersections.h

 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 #ifndef Intersections_DEFINE
 #define Intersections_DEFINE
 
 class Intersections {
 public:
     Intersections()
         : fFlip(0)
-#if SK_DEBUG
+#ifdef SK_DEBUG
         , fDepth(0)
 #endif
         , fSwap(0)
     {
-#if SK_DEBUG
+#ifdef SK_DEBUG
         bzero(fPt, sizeof(fPt));
         bzero(fT, sizeof(fT));
         bzero(fIsCoincident, sizeof(fIsCoincident));
 #endif
         reset();
     }
 
     int coincidentUsed() const {
         if (!fIsCoincident[0]) {
             SkASSERT(!fIsCoincident[0]);
             return 0;
         }
         int count = 0;
         SkDEBUGCODE(int count2 = 0;)
         for (int index = 0; index < fUsed; ++index) {
             if (fIsCoincident[0] & (1 << index)) {
                 ++count;
             }
-    #if SK_DEBUG
+    #ifdef SK_DEBUG
             if (fIsCoincident[1] & (1 << index)) {
                 ++count2;
             }
     #endif
         }
         SkASSERT(count == count2);
         return count;
     }
 
     void offset(int base, double start, double end) {
@@ skipping 63 matching lines @@
     }
 
     void downDepth() {
         SkASSERT(--fDepth >= 0);
     }
 
     void upDepth() {
         SkASSERT(++fDepth < 16);
     }
 
-#if SK_DEBUG
+#ifdef SK_DEBUG
     int depth() const {
         return fDepth;
     }
 #endif
 
     _Point fPt[9];
     double fT[2][9];
     unsigned short fIsCoincident[2]; // bit arrays, one bit set for each coincident T
     unsigned char fUsed;
     bool fFlip;
     bool fUnsortable;
-#if SK_DEBUG
+#ifdef SK_DEBUG
     int fDepth;
 #endif
 protected:
     // used by addCoincident to remove ordinary intersections in range
     void remove(double one, double two, const _Point& startPt, const _Point& endPt);
 private:
     bool fSwap;
 };
 
 #endif