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
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
|
// 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 "components/bookmarks/browser/bookmark_utils.h"
#include <stdint.h>
#include <utility>
#include "base/bind.h"
#include "base/containers/hash_tables.h"
#include "base/files/file_path.h"
#include "base/i18n/case_conversion.h"
#include "base/i18n/string_search.h"
#include "base/macros.h"
#include "base/metrics/user_metrics_action.h"
#include "base/strings/string_util.h"
#include "base/strings/stringprintf.h"
#include "base/strings/utf_string_conversions.h"
#include "base/time/time.h"
#include "build/build_config.h"
#include "components/bookmarks/browser/bookmark_client.h"
#include "components/bookmarks/browser/bookmark_model.h"
#include "components/bookmarks/browser/scoped_group_bookmark_actions.h"
#include "components/bookmarks/common/bookmark_pref_names.h"
#include "components/pref_registry/pref_registry_syncable.h"
#include "components/prefs/pref_service.h"
#include "components/query_parser/query_parser.h"
#include "components/url_formatter/url_formatter.h"
#include "ui/base/clipboard/clipboard.h"
#include "ui/base/models/tree_node_iterator.h"
#include "url/gurl.h"
using base::Time;
namespace bookmarks {
namespace {
// The maximum length of URL or title returned by the Cleanup functions.
const size_t kCleanedUpUrlMaxLength = 1024u;
const size_t kCleanedUpTitleMaxLength = 1024u;
void CloneBookmarkNodeImpl(BookmarkModel* model,
const BookmarkNodeData::Element& element,
const BookmarkNode* parent,
int index_to_add_at,
bool reset_node_times) {
// Make sure to not copy non clonable keys.
BookmarkNode::MetaInfoMap meta_info_map = element.meta_info_map;
for (const std::string& key : model->non_cloned_keys())
meta_info_map.erase(key);
if (element.is_url) {
Time date_added = reset_node_times ? Time::Now() : element.date_added;
DCHECK(!date_added.is_null());
model->AddURLWithCreationTimeAndMetaInfo(parent,
index_to_add_at,
element.title,
element.url,
date_added,
&meta_info_map);
} else {
const BookmarkNode* cloned_node = model->AddFolderWithMetaInfo(
parent, index_to_add_at, element.title, &meta_info_map);
if (!reset_node_times) {
DCHECK(!element.date_folder_modified.is_null());
model->SetDateFolderModified(cloned_node, element.date_folder_modified);
}
for (int i = 0; i < static_cast<int>(element.children.size()); ++i)
CloneBookmarkNodeImpl(model, element.children[i], cloned_node, i,
reset_node_times);
}
}
// Comparison function that compares based on date modified of the two nodes.
bool MoreRecentlyModified(const BookmarkNode* n1, const BookmarkNode* n2) {
return n1->date_folder_modified() > n2->date_folder_modified();
}
// Returns true if |text| contains each string in |words|. This is used when
// searching for bookmarks.
bool DoesBookmarkTextContainWords(const base::string16& text,
const std::vector<base::string16>& words) {
for (size_t i = 0; i < words.size(); ++i) {
if (!base::i18n::StringSearchIgnoringCaseAndAccents(
words[i], text, NULL, NULL)) {
return false;
}
}
return true;
}
// Returns true if |node|s title or url contains the strings in |words|.
// |languages| argument is user's accept-language setting to decode IDN.
bool DoesBookmarkContainWords(const BookmarkNode* node,
const std::vector<base::string16>& words,
const std::string& languages) {
return DoesBookmarkTextContainWords(node->GetTitle(), words) ||
DoesBookmarkTextContainWords(base::UTF8ToUTF16(node->url().spec()),
words) ||
DoesBookmarkTextContainWords(
url_formatter::FormatUrl(
node->url(), languages, url_formatter::kFormatUrlOmitNothing,
net::UnescapeRule::NORMAL, NULL, NULL, NULL),
words);
}
// This is used with a tree iterator to skip subtrees which are not visible.
bool PruneInvisibleFolders(const BookmarkNode* node) {
return !node->IsVisible();
}
// This traces parents up to root, determines if node is contained in a
// selected folder.
bool HasSelectedAncestor(BookmarkModel* model,
const std::vector<const BookmarkNode*>& selected_nodes,
const BookmarkNode* node) {
if (!node || model->is_permanent_node(node))
return false;
for (size_t i = 0; i < selected_nodes.size(); ++i)
if (node->id() == selected_nodes[i]->id())
return true;
return HasSelectedAncestor(model, selected_nodes, node->parent());
}
const BookmarkNode* GetNodeByID(const BookmarkNode* node, int64_t id) {
if (node->id() == id)
return node;
for (int i = 0, child_count = node->child_count(); i < child_count; ++i) {
const BookmarkNode* result = GetNodeByID(node->GetChild(i), id);
if (result)
return result;
}
return NULL;
}
// Attempts to shorten a URL safely (i.e., by preventing the end of the URL
// from being in the middle of an escape sequence) to no more than
// kCleanedUpUrlMaxLength characters, returning the result.
std::string TruncateUrl(const std::string& url) {
if (url.length() <= kCleanedUpUrlMaxLength)
return url;
// If we're in the middle of an escape sequence, truncate just before it.
if (url[kCleanedUpUrlMaxLength - 1] == '%')
return url.substr(0, kCleanedUpUrlMaxLength - 1);
if (url[kCleanedUpUrlMaxLength - 2] == '%')
return url.substr(0, kCleanedUpUrlMaxLength - 2);
return url.substr(0, kCleanedUpUrlMaxLength);
}
// Returns the URL from the clipboard. If there is no URL an empty URL is
// returned.
GURL GetUrlFromClipboard() {
base::string16 url_text;
#if !defined(OS_IOS)
ui::Clipboard::GetForCurrentThread()->ReadText(ui::CLIPBOARD_TYPE_COPY_PASTE,
&url_text);
#endif
return GURL(url_text);
}
class VectorIterator {
public:
explicit VectorIterator(std::vector<const BookmarkNode*>* nodes)
: nodes_(nodes), current_(nodes->begin()) {}
bool has_next() { return (current_ != nodes_->end()); }
const BookmarkNode* Next() {
const BookmarkNode* result = *current_;
++current_;
return result;
}
private:
std::vector<const BookmarkNode*>* nodes_;
std::vector<const BookmarkNode*>::iterator current_;
DISALLOW_COPY_AND_ASSIGN(VectorIterator);
};
template <class type>
void GetBookmarksMatchingPropertiesImpl(
type& iterator,
BookmarkModel* model,
const QueryFields& query,
const std::vector<base::string16>& query_words,
size_t max_count,
const std::string& languages,
std::vector<const BookmarkNode*>* nodes) {
while (iterator.has_next()) {
const BookmarkNode* node = iterator.Next();
if ((!query_words.empty() &&
!DoesBookmarkContainWords(node, query_words, languages)) ||
model->is_permanent_node(node)) {
continue;
}
if (query.title && node->GetTitle() != *query.title)
continue;
nodes->push_back(node);
if (nodes->size() == max_count)
return;
}
}
} // namespace
QueryFields::QueryFields() {}
QueryFields::~QueryFields() {}
void CloneBookmarkNode(BookmarkModel* model,
const std::vector<BookmarkNodeData::Element>& elements,
const BookmarkNode* parent,
int index_to_add_at,
bool reset_node_times) {
if (!parent->is_folder() || !model) {
NOTREACHED();
return;
}
for (size_t i = 0; i < elements.size(); ++i) {
CloneBookmarkNodeImpl(model, elements[i], parent,
index_to_add_at + static_cast<int>(i),
reset_node_times);
}
}
void CopyToClipboard(BookmarkModel* model,
const std::vector<const BookmarkNode*>& nodes,
bool remove_nodes) {
if (nodes.empty())
return;
// Create array of selected nodes with descendants filtered out.
std::vector<const BookmarkNode*> filtered_nodes;
for (size_t i = 0; i < nodes.size(); ++i)
if (!HasSelectedAncestor(model, nodes, nodes[i]->parent()))
filtered_nodes.push_back(nodes[i]);
BookmarkNodeData(filtered_nodes).
WriteToClipboard(ui::CLIPBOARD_TYPE_COPY_PASTE);
if (remove_nodes) {
ScopedGroupBookmarkActions group_cut(model);
for (size_t i = 0; i < filtered_nodes.size(); ++i) {
int index = filtered_nodes[i]->parent()->GetIndexOf(filtered_nodes[i]);
if (index > -1)
model->Remove(filtered_nodes[i]);
}
}
}
// Updates |title| such that |url| and |title| pair are unique among the
// children of |parent|.
void MakeTitleUnique(const BookmarkModel* model,
const BookmarkNode* parent,
const GURL& url,
base::string16* title) {
base::hash_set<base::string16> titles;
base::string16 original_title_lower = base::i18n::ToLower(*title);
for (int i = 0; i < parent->child_count(); i++) {
const BookmarkNode* node = parent->GetChild(i);
if (node->is_url() && (url == node->url()) &&
base::StartsWith(base::i18n::ToLower(node->GetTitle()),
original_title_lower,
base::CompareCase::SENSITIVE)) {
titles.insert(node->GetTitle());
}
}
if (titles.find(*title) == titles.end())
return;
for (size_t i = 0; i < titles.size(); i++) {
const base::string16 new_title(*title +
base::ASCIIToUTF16(base::StringPrintf(
" (%lu)", (unsigned long)(i + 1))));
if (titles.find(new_title) == titles.end()) {
*title = new_title;
return;
}
}
NOTREACHED();
}
void PasteFromClipboard(BookmarkModel* model,
const BookmarkNode* parent,
int index) {
if (!parent)
return;
BookmarkNodeData bookmark_data;
if (!bookmark_data.ReadFromClipboard(ui::CLIPBOARD_TYPE_COPY_PASTE)) {
GURL url = GetUrlFromClipboard();
if (!url.is_valid())
return;
BookmarkNode node(url);
node.SetTitle(base::ASCIIToUTF16(url.spec()));
bookmark_data = BookmarkNodeData(&node);
}
if (index == -1)
index = parent->child_count();
ScopedGroupBookmarkActions group_paste(model);
if (bookmark_data.size() == 1 &&
model->IsBookmarked(bookmark_data.elements[0].url)) {
MakeTitleUnique(model,
parent,
bookmark_data.elements[0].url,
&bookmark_data.elements[0].title);
}
CloneBookmarkNode(model, bookmark_data.elements, parent, index, true);
}
bool CanPasteFromClipboard(BookmarkModel* model, const BookmarkNode* node) {
if (!node || !model->client()->CanBeEditedByUser(node))
return false;
return (BookmarkNodeData::ClipboardContainsBookmarks() ||
GetUrlFromClipboard().is_valid());
}
std::vector<const BookmarkNode*> GetMostRecentlyModifiedUserFolders(
BookmarkModel* model,
size_t max_count) {
std::vector<const BookmarkNode*> nodes;
ui::TreeNodeIterator<const BookmarkNode> iterator(
model->root_node(), base::Bind(&PruneInvisibleFolders));
while (iterator.has_next()) {
const BookmarkNode* parent = iterator.Next();
if (!model->client()->CanBeEditedByUser(parent))
continue;
if (parent->is_folder() && parent->date_folder_modified() > Time()) {
if (max_count == 0) {
nodes.push_back(parent);
} else {
std::vector<const BookmarkNode*>::iterator i =
std::upper_bound(nodes.begin(), nodes.end(), parent,
&MoreRecentlyModified);
if (nodes.size() < max_count || i != nodes.end()) {
nodes.insert(i, parent);
while (nodes.size() > max_count)
nodes.pop_back();
}
}
} // else case, the root node, which we don't care about or imported nodes
// (which have a time of 0).
}
if (nodes.size() < max_count) {
// Add the permanent nodes if there is space. The permanent nodes are the
// only children of the root_node.
const BookmarkNode* root_node = model->root_node();
for (int i = 0; i < root_node->child_count(); ++i) {
const BookmarkNode* node = root_node->GetChild(i);
if (node->IsVisible() && model->client()->CanBeEditedByUser(node) &&
std::find(nodes.begin(), nodes.end(), node) == nodes.end()) {
nodes.push_back(node);
if (nodes.size() == max_count)
break;
}
}
}
return nodes;
}
void GetMostRecentlyAddedEntries(BookmarkModel* model,
size_t count,
std::vector<const BookmarkNode*>* nodes) {
ui::TreeNodeIterator<const BookmarkNode> iterator(model->root_node());
while (iterator.has_next()) {
const BookmarkNode* node = iterator.Next();
if (node->is_url()) {
std::vector<const BookmarkNode*>::iterator insert_position =
std::upper_bound(nodes->begin(), nodes->end(), node,
&MoreRecentlyAdded);
if (nodes->size() < count || insert_position != nodes->end()) {
nodes->insert(insert_position, node);
while (nodes->size() > count)
nodes->pop_back();
}
}
}
}
bool MoreRecentlyAdded(const BookmarkNode* n1, const BookmarkNode* n2) {
return n1->date_added() > n2->date_added();
}
void GetBookmarksMatchingProperties(BookmarkModel* model,
const QueryFields& query,
size_t max_count,
const std::string& languages,
std::vector<const BookmarkNode*>* nodes) {
std::vector<base::string16> query_words;
query_parser::QueryParser parser;
if (query.word_phrase_query) {
parser.ParseQueryWords(base::i18n::ToLower(*query.word_phrase_query),
query_parser::MatchingAlgorithm::DEFAULT,
&query_words);
if (query_words.empty())
return;
}
if (query.url) {
// Shortcut into the BookmarkModel if searching for URL.
GURL url(*query.url);
std::vector<const BookmarkNode*> url_matched_nodes;
if (url.is_valid())
model->GetNodesByURL(url, &url_matched_nodes);
VectorIterator iterator(&url_matched_nodes);
GetBookmarksMatchingPropertiesImpl<VectorIterator>(
iterator, model, query, query_words, max_count, languages, nodes);
} else {
ui::TreeNodeIterator<const BookmarkNode> iterator(model->root_node());
GetBookmarksMatchingPropertiesImpl<
ui::TreeNodeIterator<const BookmarkNode>>(
iterator, model, query, query_words, max_count, languages, nodes);
}
}
void RegisterProfilePrefs(user_prefs::PrefRegistrySyncable* registry) {
registry->RegisterBooleanPref(
prefs::kShowBookmarkBar,
false,
user_prefs::PrefRegistrySyncable::SYNCABLE_PREF);
registry->RegisterBooleanPref(prefs::kEditBookmarksEnabled, true);
registry->RegisterBooleanPref(
prefs::kShowAppsShortcutInBookmarkBar,
true,
user_prefs::PrefRegistrySyncable::SYNCABLE_PREF);
registry->RegisterBooleanPref(
prefs::kShowManagedBookmarksInBookmarkBar,
true,
user_prefs::PrefRegistrySyncable::SYNCABLE_PREF);
RegisterManagedBookmarksPrefs(registry);
}
void RegisterManagedBookmarksPrefs(PrefRegistrySimple* registry) {
// Don't sync this, as otherwise, due to a limitation in sync, it
// will cause a deadlock (see http://crbug.com/97955). If we truly
// want to sync the expanded state of folders, it should be part of
// bookmark sync itself (i.e., a property of the sync folder nodes).
registry->RegisterListPref(prefs::kBookmarkEditorExpandedNodes,
new base::ListValue);
registry->RegisterListPref(prefs::kManagedBookmarks);
registry->RegisterStringPref(
prefs::kManagedBookmarksFolderName, std::string());
registry->RegisterListPref(prefs::kSupervisedBookmarks);
}
const BookmarkNode* GetParentForNewNodes(
const BookmarkNode* parent,
const std::vector<const BookmarkNode*>& selection,
int* index) {
const BookmarkNode* real_parent = parent;
if (selection.size() == 1 && selection[0]->is_folder())
real_parent = selection[0];
if (index) {
if (selection.size() == 1 && selection[0]->is_url()) {
*index = real_parent->GetIndexOf(selection[0]) + 1;
if (*index == 0) {
// Node doesn't exist in parent, add to end.
NOTREACHED();
*index = real_parent->child_count();
}
} else {
*index = real_parent->child_count();
}
}
return real_parent;
}
void DeleteBookmarkFolders(BookmarkModel* model,
const std::vector<int64_t>& ids) {
// Remove the folders that were removed. This has to be done after all the
// other changes have been committed.
for (std::vector<int64_t>::const_iterator iter = ids.begin();
iter != ids.end();
++iter) {
const BookmarkNode* node = GetBookmarkNodeByID(model, *iter);
if (!node)
continue;
model->Remove(node);
}
}
void AddIfNotBookmarked(BookmarkModel* model,
const GURL& url,
const base::string16& title) {
if (IsBookmarkedByUser(model, url))
return; // Nothing to do, a user bookmark with that url already exists.
model->client()->RecordAction(base::UserMetricsAction("BookmarkAdded"));
const BookmarkNode* parent = model->GetParentForNewNodes();
model->AddURL(parent, parent->child_count(), title, url);
}
void RemoveAllBookmarks(BookmarkModel* model, const GURL& url) {
std::vector<const BookmarkNode*> bookmarks;
model->GetNodesByURL(url, &bookmarks);
// Remove all the user bookmarks.
for (size_t i = 0; i < bookmarks.size(); ++i) {
const BookmarkNode* node = bookmarks[i];
int index = node->parent()->GetIndexOf(node);
if (index > -1 && model->client()->CanBeEditedByUser(node))
model->Remove(node);
}
}
base::string16 CleanUpUrlForMatching(
const GURL& gurl,
const std::string& languages,
base::OffsetAdjuster::Adjustments* adjustments) {
base::OffsetAdjuster::Adjustments tmp_adjustments;
return base::i18n::ToLower(url_formatter::FormatUrlWithAdjustments(
GURL(TruncateUrl(gurl.spec())), languages,
url_formatter::kFormatUrlOmitUsernamePassword,
net::UnescapeRule::SPACES | net::UnescapeRule::PATH_SEPARATORS |
net::UnescapeRule::URL_SPECIAL_CHARS_EXCEPT_PATH_SEPARATORS,
nullptr, nullptr, adjustments ? adjustments : &tmp_adjustments));
}
base::string16 CleanUpTitleForMatching(const base::string16& title) {
return base::i18n::ToLower(title.substr(0u, kCleanedUpTitleMaxLength));
}
bool CanAllBeEditedByUser(BookmarkClient* client,
const std::vector<const BookmarkNode*>& nodes) {
for (size_t i = 0; i < nodes.size(); ++i) {
if (!client->CanBeEditedByUser(nodes[i]))
return false;
}
return true;
}
bool IsBookmarkedByUser(BookmarkModel* model, const GURL& url) {
std::vector<const BookmarkNode*> nodes;
model->GetNodesByURL(url, &nodes);
for (size_t i = 0; i < nodes.size(); ++i) {
if (model->client()->CanBeEditedByUser(nodes[i]))
return true;
}
return false;
}
const BookmarkNode* GetBookmarkNodeByID(const BookmarkModel* model,
int64_t id) {
// TODO(sky): TreeNode needs a method that visits all nodes using a predicate.
return GetNodeByID(model->root_node(), id);
}
bool IsDescendantOf(const BookmarkNode* node, const BookmarkNode* root) {
return node && node->HasAncestor(root);
}
bool HasDescendantsOf(const std::vector<const BookmarkNode*>& list,
const BookmarkNode* root) {
for (const BookmarkNode* node : list) {
if (IsDescendantOf(node, root))
return true;
}
return false;
}
} // namespace bookmarks
|