OLD | NEW |
1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2012 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/file_util.h" | 5 #include "base/file_util.h" |
6 #include "base/files/file_enumerator.h" | |
7 #include "net/disk_cache/block_files.h" | 6 #include "net/disk_cache/block_files.h" |
8 #include "net/disk_cache/disk_cache.h" | 7 #include "net/disk_cache/disk_cache.h" |
9 #include "net/disk_cache/disk_cache_test_base.h" | 8 #include "net/disk_cache/disk_cache_test_base.h" |
10 #include "net/disk_cache/disk_cache_test_util.h" | 9 #include "net/disk_cache/disk_cache_test_util.h" |
11 #include "testing/gtest/include/gtest/gtest.h" | 10 #include "testing/gtest/include/gtest/gtest.h" |
12 | 11 |
13 using base::Time; | 12 using base::Time; |
14 | 13 |
15 namespace { | 14 namespace { |
16 | 15 |
17 // Returns the number of files in this folder. | 16 // Returns the number of files in this folder. |
18 int NumberOfFiles(const base::FilePath& path) { | 17 int NumberOfFiles(const base::FilePath& path) { |
19 base::FileEnumerator iter(path, false, base::FileEnumerator::FILES); | 18 file_util::FileEnumerator iter(path, false, file_util::FileEnumerator::FILES); |
20 int count = 0; | 19 int count = 0; |
21 for (base::FilePath file = iter.Next(); !file.value().empty(); | 20 for (base::FilePath file = iter.Next(); !file.value().empty(); |
22 file = iter.Next()) { | 21 file = iter.Next()) { |
23 count++; | 22 count++; |
24 } | 23 } |
25 return count; | 24 return count; |
26 } | 25 } |
27 | 26 |
28 } // namespace; | 27 } // namespace; |
29 | 28 |
(...skipping 311 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
341 } | 340 } |
342 | 341 |
343 // The allocation map should be empty. | 342 // The allocation map should be empty. |
344 for (int i =0; i < 50; i++) { | 343 for (int i =0; i < 50; i++) { |
345 SCOPED_TRACE(i); | 344 SCOPED_TRACE(i); |
346 EXPECT_EQ(0, buffer[i]); | 345 EXPECT_EQ(0, buffer[i]); |
347 } | 346 } |
348 } | 347 } |
349 | 348 |
350 } // namespace disk_cache | 349 } // namespace disk_cache |
OLD | NEW |