Replace most LOG statements with DLOG statements in base.

base/synchronization/condition_variable_win.cc

 // Copyright (c) 2011 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "base/synchronization/condition_variable.h"
 
 #include <stack>
 
 #include "base/logging.h"
 #include "base/synchronization/lock.h"
@@ skipping 99 matching lines @@
 // objects as there are threads simultaneously using this instance's Wait()
 // functionality.
 ConditionVariable::Event* ConditionVariable::GetEventForWaiting() {
   // We hold internal_lock, courtesy of Wait().
   Event* cv_event;
   if (0 == recycling_list_size_) {
     DCHECK(recycling_list_.IsEmpty());
     cv_event = new Event();
     cv_event->InitListElement();
     allocation_counter_++;
-    CHECK(cv_event->handle());
+    DCHECK(cv_event->handle());
   } else {
     cv_event = recycling_list_.PopFront();
     recycling_list_size_--;
   }
   waiting_list_.PushBack(cv_event);
   return cv_event;
 }
 
 // RecycleEvent() takes a cv_event that was previously used for Wait()ing, and
 // recycles it for use in future Wait() calls for this or other threads.
@@ skipping 55 matching lines @@
   if (0 != handle_) {
     int ret_val = CloseHandle(handle_);
     DCHECK(ret_val);
   }
 }
 
 // Change a container instance permanently into an element of a list.
 void ConditionVariable::Event::InitListElement() {
   DCHECK(!handle_);
   handle_ = CreateEvent(NULL, false, false, NULL);
-  CHECK(handle_);
+  DCHECK(handle_);
 }
 
 // Methods for use on lists.
 bool ConditionVariable::Event::IsEmpty() const {
   DCHECK(ValidateAsList());
   return IsSingleton();
 }
 
 void ConditionVariable::Event::PushBack(Event* other) {
   DCHECK(ValidateAsList());
@@ skipping 231 matching lines @@
 provided O(1) performance in all required operations.  Since other operations
 to provide performance-and/or-fairness required queue (FIFO) and list (LIFO)
 containers, I would also have needed to use an STL list/queue as well as an STL
 map.  In the end I decided it would be "fun" to just do it right, and I
 put so many assertions (DCHECKs) into the container class that it is trivial to
 code review and validate its correctness.
 
 */
 
 }  // namespace base