Replace uses of GR_DEBUG by SK_DEBUG.

src/gpu/GrRedBlackTree.h

 
 /*
  * Copyright 2011 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 
 #ifndef GrRedBlackTree_DEFINED
@@ skipping 140 matching lines @@
     void rotateLeft(Node* n);
 
     static Node* SuccessorNode(Node* x);
     static Node* PredecessorNode(Node* x);
 
     void deleteAtNode(Node* x);
     static void RecursiveDelete(Node* x);
 
     int onCountOf(const Node* n, const T& t) const;
 
-#if GR_DEBUG
+#ifdef SK_DEBUG
     void validate() const;
     int checkNode(Node* n, int* blackHeight) const;
     // checks relationship between a node and its children. allowRedRed means
     // node may be in an intermediate state where a red parent has a red child.
     bool validateChildRelations(const Node* n, bool allowRedRed) const;
     // place to stick break point if validateChildRelations is failing.
     bool validateChildRelationsFailed() const { return false; }
 #else
     void validate() const {}
 #endif
@@ skipping 664 matching lines @@
 
 template <typename T, typename C>
 void GrRedBlackTree<T,C>::RecursiveDelete(Node* x) {
     if (NULL != x) {
         RecursiveDelete(x->fChildren[kLeft_Child]);
         RecursiveDelete(x->fChildren[kRight_Child]);
         delete x;
     }
 }
 
-#if GR_DEBUG
+#ifdef SK_DEBUG
 template <typename T, typename C>
 void GrRedBlackTree<T,C>::validate() const {
     if (fCount) {
         SkASSERT(NULL == fRoot->fParent);
         SkASSERT(NULL != fFirst);
         SkASSERT(NULL != fLast);
 
         SkASSERT(kBlack_Color == fRoot->fColor);
         if (1 == fCount) {
             SkASSERT(fFirst == fRoot);
@@ skipping 251 matching lines @@
     // remove all entries
     while (!tree.empty()) {
         tree.remove(tree.begin());
     }
 
     // test reset on empty tree.
     tree.reset();
 }
 
 #endif