| 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 #include "base/time.h" |
| 11 | 12 |
| 12 using base::TimeDelta; | 13 using base::TimeDelta; |
| 13 | 14 |
| 14 ConditionVariable::ConditionVariable(Lock* user_lock) | 15 ConditionVariable::ConditionVariable(Lock* user_lock) |
| 15 : user_lock_(*user_lock), | 16 : user_lock_(*user_lock), |
| 16 run_state_(RUNNING), | 17 run_state_(RUNNING), |
| 17 allocation_counter_(0), | 18 allocation_counter_(0), |
| 18 recycling_list_size_(0) { | 19 recycling_list_size_(0) { |
| 19 DCHECK(user_lock); | 20 DCHECK(user_lock); |
| 20 } | 21 } |
| (...skipping 415 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 436 waiting_list. A hash table (STL map) could be used, but I was embarrased to | 437 waiting_list. A hash table (STL map) could be used, but I was embarrased to |
| 437 use a complex and relatively low efficiency container when a doubly linked list | 438 use a complex and relatively low efficiency container when a doubly linked list |
| 438 provided O(1) performance in all required operations. Since other operations | 439 provided O(1) performance in all required operations. Since other operations |
| 439 to provide performance-and/or-fairness required queue (FIFO) and list (LIFO) | 440 to provide performance-and/or-fairness required queue (FIFO) and list (LIFO) |
| 440 containers, I would also have needed to use an STL list/queue as well as an STL | 441 containers, I would also have needed to use an STL list/queue as well as an STL |
| 441 map. In the end I decided it would be "fun" to just do it right, and I | 442 map. In the end I decided it would be "fun" to just do it right, and I |
| 442 put so many assertions (DCHECKs) into the container class that it is trivial to | 443 put so many assertions (DCHECKs) into the container class that it is trivial to |
| 443 code review and validate its correctness. | 444 code review and validate its correctness. |
| 444 | 445 |
| 445 */ | 446 */ |
| OLD | NEW |