OLD | NEW |
1 // Copyright 2013 The Chromium Authors. All rights reserved. | 1 // Copyright 2013 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 "cc/trees/layer_tree_host_common.h" | 5 #include "cc/trees/layer_tree_host_common.h" |
6 | 6 |
| 7 #include <stddef.h> |
| 8 |
7 #include <deque> | 9 #include <deque> |
8 #include <sstream> | 10 #include <sstream> |
9 | 11 |
10 #include "base/files/file_path.h" | 12 #include "base/files/file_path.h" |
11 #include "base/files/file_util.h" | 13 #include "base/files/file_util.h" |
12 #include "base/memory/scoped_ptr.h" | 14 #include "base/memory/scoped_ptr.h" |
13 #include "base/path_service.h" | 15 #include "base/path_service.h" |
14 #include "base/strings/string_piece.h" | 16 #include "base/strings/string_piece.h" |
15 #include "base/threading/thread.h" | 17 #include "base/threading/thread.h" |
16 #include "base/time/time.h" | 18 #include "base/time/time.h" |
(...skipping 246 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
263 | 265 |
264 TEST_F(BspTreePerfTest, BspTreeCubes_4) { | 266 TEST_F(BspTreePerfTest, BspTreeCubes_4) { |
265 SetTestName("bsp_tree_cubes_4"); | 267 SetTestName("bsp_tree_cubes_4"); |
266 SetNumberOfDuplicates(4); | 268 SetNumberOfDuplicates(4); |
267 ReadTestFile("layer_sort_cubes"); | 269 ReadTestFile("layer_sort_cubes"); |
268 RunSortLayers(); | 270 RunSortLayers(); |
269 } | 271 } |
270 | 272 |
271 } // namespace | 273 } // namespace |
272 } // namespace cc | 274 } // namespace cc |
OLD | NEW |