Replace uses of GR_DEBUG by SK_DEBUG.

src/gpu/GrTHashCache.h

 
 /*
  * Copyright 2010 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 
 
@@ skipping 35 matching lines @@
     T* removeAt(int index, uint32_t hash);
     void removeAll();
     void deleteAll();
     void unrefAll();
 
     /**
      *  Return the index for the element, using a linear search.
      */
     int slowFindIndex(T* elem) const { return fSorted.find(elem); }
 
-#if GR_DEBUG
+#ifdef SK_DEBUG
     void validate() const;
     bool contains(T*) const;
 #endif
 
     // testing
     const SkTDArray<T*>& getArray() const { return fSorted; }
     SkTDArray<T*>& getArray() { return fSorted; }
 private:
     enum {
         kHashCount = 1 << kHashBits,
@@ skipping 151 matching lines @@
     fSorted.deleteAll();
     Gr_bzero(fHash, sizeof(fHash));
 }
 
 template <typename T, typename Key, size_t kHashBits>
 void GrTHashTable<T, Key, kHashBits>::unrefAll() {
     fSorted.unrefAll();
     Gr_bzero(fHash, sizeof(fHash));
 }
 
-#if GR_DEBUG
+#ifdef SK_DEBUG
 template <typename T, typename Key, size_t kHashBits>
 void GrTHashTable<T, Key, kHashBits>::validate() const {
     int count = fSorted.count();
     for (int i = 1; i < count; i++) {
         SkASSERT(Key::LT(*fSorted[i - 1], *fSorted[i]) ||
                  Key::EQ(*fSorted[i - 1], *fSorted[i]));
     }
 }
 
 template <typename T, typename Key, size_t kHashBits>
 bool GrTHashTable<T, Key, kHashBits>::contains(T* elem) const {
     int index = fSorted.find(elem);
     return index >= 0;
 }
 
 #endif
 
 #endif