| OLD | NEW |
| 1 // Copyright 2014 The Chromium Authors. All rights reserved. | 1 // Copyright 2014 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 "mojo/edk/system/handle_table.h" | 5 #include "mojo/system/handle_table.h" |
| 6 | 6 |
| 7 #include "base/logging.h" | 7 #include "base/logging.h" |
| 8 #include "base/macros.h" | 8 #include "base/macros.h" |
| 9 #include "mojo/edk/system/constants.h" | 9 #include "mojo/system/constants.h" |
| 10 #include "mojo/edk/system/dispatcher.h" | 10 #include "mojo/system/dispatcher.h" |
| 11 | 11 |
| 12 namespace mojo { | 12 namespace mojo { |
| 13 namespace system { | 13 namespace system { |
| 14 | 14 |
| 15 HandleTable::Entry::Entry() : busy(false) { | 15 HandleTable::Entry::Entry() : busy(false) { |
| 16 } | 16 } |
| 17 | 17 |
| 18 HandleTable::Entry::Entry(const scoped_refptr<Dispatcher>& dispatcher) | 18 HandleTable::Entry::Entry(const scoped_refptr<Dispatcher>& dispatcher) |
| 19 : dispatcher(dispatcher), busy(false) { | 19 : dispatcher(dispatcher), busy(false) { |
| 20 } | 20 } |
| (...skipping 210 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 231 for (uint32_t i = 0; i < num_handles; i++) { | 231 for (uint32_t i = 0; i < num_handles; i++) { |
| 232 HandleToEntryMap::iterator it = handle_to_entry_map_.find(handles[i]); | 232 HandleToEntryMap::iterator it = handle_to_entry_map_.find(handles[i]); |
| 233 DCHECK(it != handle_to_entry_map_.end()); | 233 DCHECK(it != handle_to_entry_map_.end()); |
| 234 DCHECK(it->second.busy); | 234 DCHECK(it->second.busy); |
| 235 it->second.busy = false; | 235 it->second.busy = false; |
| 236 } | 236 } |
| 237 } | 237 } |
| 238 | 238 |
| 239 } // namespace system | 239 } // namespace system |
| 240 } // namespace mojo | 240 } // namespace mojo |
| OLD | NEW |