Switch usage of _DEBUG macro to NDEBUG.

webrtc/base/diskcache.cc

 /*
  *  Copyright 2004 The WebRTC Project Authors. All rights reserved.
  *
  *  Use of this source code is governed by a BSD-style license
  *  that can be found in the LICENSE file in the root of the source
  *  tree. An additional intellectual property rights grant can be found
  *  in the file PATENTS.  All contributing project authors may
  *  be found in the AUTHORS file in the root of the source tree.
  */
 
 #include <time.h>
 
 #if defined(WEBRTC_WIN)
 #include "webrtc/base/win32.h"
 #endif
 
 #include <algorithm>
 #include "webrtc/base/common.h"
 #include "webrtc/base/diskcache.h"
 #include "webrtc/base/fileutils.h"
 #include "webrtc/base/pathutils.h"
 #include "webrtc/base/stream.h"
 #include "webrtc/base/stringencode.h"
 #include "webrtc/base/stringutils.h"
 
-#ifdef _DEBUG
+#if !defined(NDEBUG)
 #define TRANSPARENT_CACHE_NAMES 1
-#else  // !_DEBUG
+#else
 #define TRANSPARENT_CACHE_NAMES 0
-#endif  // !_DEBUG
+#endif
 
 namespace rtc {
 
 class DiskCache;
 
 ///////////////////////////////////////////////////////////////////////////////
 // DiskCacheAdapter
 ///////////////////////////////////////////////////////////////////////////////
 
 class DiskCacheAdapter : public StreamAdapterInterface {
@@ skipping 163 matching lines @@
       success = false;
     }
   }
 
   total_size_ -= entry->size;
   map_.erase(id);
   return success;
 }
 
 bool DiskCache::CheckLimit() {
-#ifdef _DEBUG
+#if !defined(NDEBUG)
   // Temporary check to make sure everything is working correctly.
   size_t cache_size = 0;
   for (EntryMap::iterator it = map_.begin(); it != map_.end(); ++it) {
     cache_size += it->second.size;
   }
   ASSERT(cache_size == total_size_);
-#endif  // _DEBUG
+#endif
 
   // TODO: Replace this with a non-brain-dead algorithm for clearing out the
   // oldest resources... something that isn't O(n^2)
   while (total_size_ > max_cache_) {
     EntryMap::iterator oldest = map_.end();
     for (EntryMap::iterator it = map_.begin(); it != map_.end(); ++it) {
       if ((LS_UNLOCKED != it->second.lock_state) || (it->second.accessors > 0))
         continue;
       oldest = it;
       break;
@@ skipping 107 matching lines @@
       entry2->last_modified = time(0);
       entry2->lock_state = LS_UNLOCKED;
       this2->CheckLimit();
     }
   }
 }
 
 ///////////////////////////////////////////////////////////////////////////////
 
 } // namespace rtc