1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
|
// Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "content/browser/storage_partition_impl_map.h"
#include <utility>
#include "base/files/file_util.h"
#include "base/run_loop.h"
#include "base/test/scoped_task_environment.h"
#include "content/public/test/test_browser_context.h"
#include "testing/gtest/include/gtest/gtest.h"
namespace content {
// Test that the Less comparison function is implemented properly to uniquely
// identify storage partitions used as keys in a std::map.
TEST(StoragePartitionConfigTest, OperatorLess) {
StoragePartitionImplMap::StoragePartitionConfig c1(
std::string(), std::string(), false);
StoragePartitionImplMap::StoragePartitionConfig c2(
std::string(), std::string(), false);
StoragePartitionImplMap::StoragePartitionConfig c3(
std::string(), std::string(), true);
StoragePartitionImplMap::StoragePartitionConfig c4("a", std::string(), true);
StoragePartitionImplMap::StoragePartitionConfig c5("b", std::string(), true);
StoragePartitionImplMap::StoragePartitionConfig c6(
std::string(), "abc", false);
StoragePartitionImplMap::StoragePartitionConfig c7(
std::string(), "abc", true);
StoragePartitionImplMap::StoragePartitionConfig c8("a", "abc", false);
StoragePartitionImplMap::StoragePartitionConfig c9("a", "abc", true);
StoragePartitionImplMap::StoragePartitionConfigLess less;
// Let's ensure basic comparison works.
EXPECT_TRUE(less(c1, c3));
EXPECT_TRUE(less(c1, c4));
EXPECT_TRUE(less(c3, c4));
EXPECT_TRUE(less(c4, c5));
EXPECT_TRUE(less(c4, c8));
EXPECT_TRUE(less(c6, c4));
EXPECT_TRUE(less(c6, c7));
EXPECT_TRUE(less(c8, c9));
// Now, ensure antisymmetry for each pair we've tested.
EXPECT_FALSE(less(c3, c1));
EXPECT_FALSE(less(c4, c1));
EXPECT_FALSE(less(c4, c3));
EXPECT_FALSE(less(c5, c4));
EXPECT_FALSE(less(c8, c4));
EXPECT_FALSE(less(c4, c6));
EXPECT_FALSE(less(c7, c6));
EXPECT_FALSE(less(c9, c8));
// Check for irreflexivity.
EXPECT_FALSE(less(c1, c1));
// Check for transitivity.
EXPECT_TRUE(less(c1, c4));
// Let's enforce that two identical elements obey strict weak ordering.
EXPECT_TRUE(!less(c1, c2) && !less(c2, c1));
}
TEST(StoragePartitionImplMapTest, GarbageCollect) {
TestBrowserContext browser_context;
base::test::ScopedTaskEnvironment scoped_task_environment;
StoragePartitionImplMap storage_partition_impl_map(&browser_context);
std::unique_ptr<base::hash_set<base::FilePath>> active_paths(
new base::hash_set<base::FilePath>);
base::FilePath active_path = browser_context.GetPath().Append(
StoragePartitionImplMap::GetStoragePartitionPath(
"active", std::string()));
ASSERT_TRUE(base::CreateDirectory(active_path));
active_paths->insert(active_path);
base::FilePath inactive_path = browser_context.GetPath().Append(
StoragePartitionImplMap::GetStoragePartitionPath(
"inactive", std::string()));
ASSERT_TRUE(base::CreateDirectory(inactive_path));
base::RunLoop run_loop;
storage_partition_impl_map.GarbageCollect(std::move(active_paths),
run_loop.QuitClosure());
run_loop.Run();
scoped_task_environment.RunUntilIdle();
EXPECT_TRUE(base::PathExists(active_path));
EXPECT_FALSE(base::PathExists(inactive_path));
}
} // namespace content
|
