| OLD | NEW |
| 1 // Copyright (c) 2006-2008 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2006-2008 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "base/condition_variable.h" | 5 #include "base/condition_variable.h" |
| 6 | 6 |
| 7 #include <stack> | 7 #include <stack> |
| 8 | 8 |
| 9 #include "base/lock.h" | 9 #include "base/lock.h" |
| 10 #include "base/logging.h" | 10 #include "base/logging.h" |
| 11 | 11 |
| 12 using base::TimeDelta; |
| 13 |
| 12 ConditionVariable::ConditionVariable(Lock* user_lock) | 14 ConditionVariable::ConditionVariable(Lock* user_lock) |
| 13 : user_lock_(*user_lock), | 15 : user_lock_(*user_lock), |
| 14 run_state_(RUNNING), | 16 run_state_(RUNNING), |
| 15 allocation_counter_(0), | 17 allocation_counter_(0), |
| 16 recycling_list_size_(0) { | 18 recycling_list_size_(0) { |
| 17 DCHECK(user_lock); | 19 DCHECK(user_lock); |
| 18 } | 20 } |
| 19 | 21 |
| 20 ConditionVariable::~ConditionVariable() { | 22 ConditionVariable::~ConditionVariable() { |
| 21 AutoLock auto_lock(internal_lock_); | 23 AutoLock auto_lock(internal_lock_); |
| (...skipping 413 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 435 use a complex and relatively low efficiency container when a doubly linked list | 437 use a complex and relatively low efficiency container when a doubly linked list |
| 436 provided O(1) performance in all required operations. Since other operations | 438 provided O(1) performance in all required operations. Since other operations |
| 437 to provide performance-and/or-fairness required queue (FIFO) and list (LIFO) | 439 to provide performance-and/or-fairness required queue (FIFO) and list (LIFO) |
| 438 containers, I would also have needed to use an STL list/queue as well as an STL | 440 containers, I would also have needed to use an STL list/queue as well as an STL |
| 439 map. In the end I decided it would be "fun" to just do it right, and I | 441 map. In the end I decided it would be "fun" to just do it right, and I |
| 440 put so many assertions (DCHECKs) into the container class that it is trivial to | 442 put so many assertions (DCHECKs) into the container class that it is trivial to |
| 441 code review and validate its correctness. | 443 code review and validate its correctness. |
| 442 | 444 |
| 443 */ | 445 */ |
| 444 | 446 |
| OLD | NEW |