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/edk/system/handle_table.h" |
6 | 6 |
| 7 #include <stddef.h> |
| 8 #include <stdint.h> |
| 9 |
7 #include <limits> | 10 #include <limits> |
8 | 11 |
9 #include "base/logging.h" | 12 #include "base/logging.h" |
10 #include "mojo/edk/system/configuration.h" | 13 #include "mojo/edk/system/configuration.h" |
11 #include "mojo/edk/system/dispatcher.h" | 14 #include "mojo/edk/system/dispatcher.h" |
12 | 15 |
13 namespace mojo { | 16 namespace mojo { |
14 namespace edk { | 17 namespace edk { |
15 | 18 |
16 HandleTable::Entry::Entry() : busy(false) { | 19 HandleTable::Entry::Entry() : busy(false) { |
(...skipping 217 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
234 for (uint32_t i = 0; i < num_handles; i++) { | 237 for (uint32_t i = 0; i < num_handles; i++) { |
235 HandleToEntryMap::iterator it = handle_to_entry_map_.find(handles[i]); | 238 HandleToEntryMap::iterator it = handle_to_entry_map_.find(handles[i]); |
236 DCHECK(it != handle_to_entry_map_.end()); | 239 DCHECK(it != handle_to_entry_map_.end()); |
237 DCHECK(it->second.busy); | 240 DCHECK(it->second.busy); |
238 it->second.busy = false; | 241 it->second.busy = false; |
239 } | 242 } |
240 } | 243 } |
241 | 244 |
242 } // namespace edk | 245 } // namespace edk |
243 } // namespace mojo | 246 } // namespace mojo |
OLD | NEW |