blob: 344356e65ed5f535bf3ea7f5cc50776c8db69d20 (
plain)
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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
|
// Copyright 2014 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 "chrome/browser/sync_file_system/subtree_set.h"
#include "base/logging.h"
#include "base/stl_util.h"
#include "storage/common/fileapi/file_system_util.h"
namespace sync_file_system {
SubtreeSet::Node::Node()
: contained_as_subtree_root(false),
number_of_subtrees_below(0) {
}
SubtreeSet::Node::Node(bool contained_as_subtree_root,
size_t number_of_subtrees_below)
: contained_as_subtree_root(contained_as_subtree_root),
number_of_subtrees_below(number_of_subtrees_below) {
}
SubtreeSet::SubtreeSet() {}
SubtreeSet::~SubtreeSet() {}
bool SubtreeSet::IsDisjointWith(const base::FilePath& subtree_root) const {
base::FilePath::StringType normalized_subtree_root =
storage::VirtualPath::GetNormalizedFilePath(subtree_root);
// Check if |subtree_root| contains any of subtrees in the container.
if (ContainsKey(inclusive_ancestors_of_subtree_roots_,
normalized_subtree_root))
return false;
base::FilePath path(normalized_subtree_root);
while (!storage::VirtualPath::IsRootPath(path)) {
path = storage::VirtualPath::DirName(path);
Subtrees::const_iterator found =
inclusive_ancestors_of_subtree_roots_.find(path.value());
if (found != inclusive_ancestors_of_subtree_roots_.end())
return !found->second.contained_as_subtree_root;
}
return true;
}
bool SubtreeSet::insert(const base::FilePath& subtree_root) {
base::FilePath::StringType normalized_subtree_root =
storage::VirtualPath::GetNormalizedFilePath(subtree_root);
if (!IsDisjointWith(subtree_root))
return false;
inclusive_ancestors_of_subtree_roots_[normalized_subtree_root]
= Node(true, 1);
base::FilePath path(normalized_subtree_root);
while (!storage::VirtualPath::IsRootPath(path)) {
path = storage::VirtualPath::DirName(path);
DCHECK(!inclusive_ancestors_of_subtree_roots_[path.value()]
.contained_as_subtree_root);
++(inclusive_ancestors_of_subtree_roots_[path.value()]
.number_of_subtrees_below);
}
return true;
}
bool SubtreeSet::erase(const base::FilePath& subtree_root) {
base::FilePath::StringType normalized_subtree_root =
storage::VirtualPath::GetNormalizedFilePath(subtree_root);
{
Subtrees::iterator found =
inclusive_ancestors_of_subtree_roots_.find(normalized_subtree_root);
if (found == inclusive_ancestors_of_subtree_roots_.end() ||
!found->second.contained_as_subtree_root)
return false;
DCHECK_EQ(1u, found->second.number_of_subtrees_below);
inclusive_ancestors_of_subtree_roots_.erase(found);
}
base::FilePath path(normalized_subtree_root);
while (!storage::VirtualPath::IsRootPath(path)) {
path = storage::VirtualPath::DirName(path);
Subtrees::iterator found =
inclusive_ancestors_of_subtree_roots_.find(path.value());
if (found == inclusive_ancestors_of_subtree_roots_.end()) {
NOTREACHED();
continue;
}
DCHECK(!found->second.contained_as_subtree_root);
if (!--(found->second.number_of_subtrees_below))
inclusive_ancestors_of_subtree_roots_.erase(found);
}
return true;
}
size_t SubtreeSet::size() const {
Subtrees::const_iterator found =
inclusive_ancestors_of_subtree_roots_.find(storage::VirtualPath::kRoot);
if (found == inclusive_ancestors_of_subtree_roots_.end())
return 0;
return found->second.number_of_subtrees_below;
}
} // namespace sync_file_system
|
