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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
|
// Copyright 2015 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/supervised_user/supervised_user_bookmarks_handler.h"
#include "base/logging.h"
#include "base/strings/string_number_conversions.h"
#include "base/values.h"
#include "components/url_formatter/url_fixer.h"
namespace {
// Keys of relevant managed user settings.
const char kKeyLink[] = "SupervisedBookmarkLink";
const char kKeyFolder[] = "SupervisedBookmarkFolder";
// Keys for elements of the bookmarks json tree.
const char kId[] = "id";
const char kName[] = "name";
const char kUrl[] = "url";
const char kChildren[] = "children";
bool ExtractId(const std::string& key, int* id) {
// |key| can be either "<ID>:<Value>" (for links and for "parentID:name"
// pairs) or just "<ID>" (for folders).
std::string id_str = key.substr(0, key.find_first_of(':'));
if (!base::StringToInt(id_str, id)) {
LOG(WARNING) << "Failed to parse id from " << key;
return false;
}
LOG_IF(WARNING, *id < 0) << "IDs should be >= 0, but got "
<< *id << " from " << key;
return true;
}
bool ExtractValue(const std::string& key, std::string* value) {
// |key| must be "<ID>:<Value>".
size_t pos = key.find_first_of(':');
if (pos == std::string::npos) {
LOG(WARNING) << "Failed to parse value from " << key;
return false;
}
*value = key.substr(pos + 1);
return true;
}
bool ExtractIdAndValue(const std::string& key, int* id, std::string* value) {
return ExtractId(key, id) && ExtractValue(key, value);
}
// Recursively searches the tree from |root| for a folder with the given |id|.
// Returns the list of children of that folder if found, otherwise returns null.
base::ListValue* FindFolder(base::ListValue* root, int id) {
if (id == 0) // We're looking for the root folder. Assume this is it.
return root;
for (size_t i = 0; i < root->GetSize(); ++i) {
base::DictionaryValue* item = nullptr;
root->GetDictionary(i, &item);
DCHECK_NE(item, (base::DictionaryValue*)nullptr);
base::ListValue* children;
if (!item->GetList(kChildren, &children))
continue; // Skip bookmarks. Only interested in folders.
// Is this it?
int node_id;
if (item->GetInteger(kId, &node_id) && node_id == id)
return children;
// Recurse.
base::ListValue* result = FindFolder(children, id);
if (result)
return result;
}
return nullptr;
}
} // namespace
SupervisedUserBookmarksHandler::Folder::Folder(
int id, const std::string& name, int parent_id)
: id(id), name(name), parent_id(parent_id) {
}
SupervisedUserBookmarksHandler::Link::Link(
const std::string& url, const std::string& name, int parent_id)
: url(url), name(name), parent_id(parent_id) {
}
SupervisedUserBookmarksHandler::SupervisedUserBookmarksHandler() {
}
SupervisedUserBookmarksHandler::~SupervisedUserBookmarksHandler() {
}
scoped_ptr<base::ListValue> SupervisedUserBookmarksHandler::BuildBookmarksTree(
const base::DictionaryValue& settings) {
SupervisedUserBookmarksHandler handler;
handler.ParseSettings(settings);
return handler.BuildTree();
}
void SupervisedUserBookmarksHandler::ParseSettings(
const base::DictionaryValue& settings) {
const base::DictionaryValue* folders;
if (settings.GetDictionary(kKeyFolder, &folders))
ParseFolders(*folders);
const base::DictionaryValue* links;
if (settings.GetDictionary(kKeyLink, &links))
ParseLinks(*links);
}
void SupervisedUserBookmarksHandler::ParseFolders(
const base::DictionaryValue& folders) {
for (base::DictionaryValue::Iterator it(folders); !it.IsAtEnd();
it.Advance()) {
int id;
if (!ExtractId(it.key(), &id))
continue;
std::string value;
it.value().GetAsString(&value);
std::string name;
int parent_id;
if (!ExtractIdAndValue(value, &parent_id, &name))
continue;
folders_.push_back(Folder(id, name, parent_id));
}
}
void SupervisedUserBookmarksHandler::ParseLinks(
const base::DictionaryValue& links) {
for (base::DictionaryValue::Iterator it(links); !it.IsAtEnd(); it.Advance()) {
std::string url;
if (!ExtractValue(it.key(), &url))
continue;
std::string value;
it.value().GetAsString(&value);
std::string name;
int parent_id;
if (!ExtractIdAndValue(value, &parent_id, &name))
continue;
links_.push_back(Link(url, name, parent_id));
}
}
scoped_ptr<base::ListValue> SupervisedUserBookmarksHandler::BuildTree() {
root_.reset(new base::ListValue);
AddFoldersToTree();
AddLinksToTree();
return root_.Pass();
}
void SupervisedUserBookmarksHandler::AddFoldersToTree() {
// Go over all folders and try inserting them into the correct position in the
// tree. This requires the respective parent folder to be there already. Since
// the parent might appear later in |folders_|, we might need multiple rounds
// until all folders can be added successfully.
// To avoid an infinite loop in the case of a non-existing parent, we take
// care to stop when no folders could be added in a round.
std::vector<Folder> folders = folders_;
std::vector<Folder> folders_failed;
while (!folders.empty() && folders.size() != folders_failed.size()) {
folders_failed.clear();
for (const auto& folder : folders) {
scoped_ptr<base::DictionaryValue> node(new base::DictionaryValue);
node->SetIntegerWithoutPathExpansion(kId, folder.id);
node->SetStringWithoutPathExpansion(kName, folder.name);
node->SetWithoutPathExpansion(kChildren, new base::ListValue);
if (!AddNodeToTree(folder.parent_id, node.Pass()))
folders_failed.push_back(folder);
}
folders.swap(folders_failed);
}
if (!folders_failed.empty()) {
LOG(WARNING) << "SupervisedUserBookmarksHandler::AddFoldersToTree"
<< " failed adding the following folders (id,name,parent):";
for (const Folder& folder : folders_failed) {
LOG(WARNING) << folder.id << ", " << folder.name << ", "
<< folder.parent_id;
}
}
}
void SupervisedUserBookmarksHandler::AddLinksToTree() {
for (const auto& link : links_) {
scoped_ptr<base::DictionaryValue> node(new base::DictionaryValue);
GURL url = url_formatter::FixupURL(link.url, std::string());
if (!url.is_valid()) {
LOG(WARNING) << "Got invalid URL: " << link.url;
continue;
}
node->SetStringWithoutPathExpansion(kUrl, url.spec());
node->SetStringWithoutPathExpansion(kName, link.name);
if (!AddNodeToTree(link.parent_id, node.Pass())) {
LOG(WARNING) << "SupervisedUserBookmarksHandler::AddLinksToTree"
<< " failed to add link (url,name,parent): "
<< link.url << ", " << link.name << ", " << link.parent_id;
}
}
}
bool SupervisedUserBookmarksHandler::AddNodeToTree(
int parent_id,
scoped_ptr<base::DictionaryValue> node) {
base::ListValue* parent = FindFolder(root_.get(), parent_id);
if (!parent)
return false;
parent->Append(node.release());
return true;
}
|
