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
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
|
// 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 "chrome/browser/sync/glue/bookmark_change_processor.h"
#include <stack>
#include <vector>
#include "base/location.h"
#include "base/string16.h"
#include "base/string_util.h"
#include "base/utf_string_conversions.h"
#include "chrome/browser/bookmarks/bookmark_model.h"
#include "chrome/browser/bookmarks/bookmark_utils.h"
#include "chrome/browser/favicon/favicon_service.h"
#include "chrome/browser/profiles/profile.h"
#include "chrome/browser/sync/profile_sync_service.h"
#include "content/public/browser/browser_thread.h"
#include "sync/internal_api/public/change_record.h"
#include "sync/internal_api/public/read_node.h"
#include "sync/internal_api/public/write_node.h"
#include "sync/internal_api/public/write_transaction.h"
#include "sync/syncable/entry.h" // TODO(tim): Investigating bug 121587.
#include "ui/gfx/image/image_util.h"
using content::BrowserThread;
namespace browser_sync {
static const char kMobileBookmarksTag[] = "synced_bookmarks";
BookmarkChangeProcessor::BookmarkChangeProcessor(
BookmarkModelAssociator* model_associator,
DataTypeErrorHandler* error_handler)
: ChangeProcessor(error_handler),
bookmark_model_(NULL),
model_associator_(model_associator) {
DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));
DCHECK(model_associator);
DCHECK(error_handler);
}
void BookmarkChangeProcessor::StartImpl(Profile* profile) {
DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));
DCHECK(!bookmark_model_);
bookmark_model_ = profile->GetBookmarkModel();
DCHECK(bookmark_model_->IsLoaded());
bookmark_model_->AddObserver(this);
}
void BookmarkChangeProcessor::StopImpl() {
DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));
DCHECK(bookmark_model_);
bookmark_model_->RemoveObserver(this);
bookmark_model_ = NULL;
model_associator_ = NULL;
}
void BookmarkChangeProcessor::UpdateSyncNodeProperties(
const BookmarkNode* src, BookmarkModel* model, syncer::WriteNode* dst) {
// Set the properties of the item.
dst->SetIsFolder(src->is_folder());
dst->SetTitle(UTF16ToWideHack(src->GetTitle()));
if (!src->is_folder())
dst->SetURL(src->url());
SetSyncNodeFavicon(src, model, dst);
}
// static
void BookmarkChangeProcessor::EncodeFavicon(const BookmarkNode* src,
BookmarkModel* model,
std::vector<unsigned char>* dst) {
const gfx::Image& favicon = model->GetFavicon(src);
dst->clear();
// Check for empty images. This can happen if the favicon is
// still being loaded.
if (favicon.IsEmpty())
return;
// Re-encode the BookmarkNode's favicon as a PNG, and pass the data to the
// sync subsystem.
if (!gfx::PNGEncodedDataFromImage(favicon, dst))
return;
}
void BookmarkChangeProcessor::RemoveOneSyncNode(
syncer::WriteTransaction* trans, const BookmarkNode* node) {
syncer::WriteNode sync_node(trans);
if (!model_associator_->InitSyncNodeFromChromeId(node->id(), &sync_node)) {
error_handler()->OnSingleDatatypeUnrecoverableError(FROM_HERE,
std::string());
return;
}
// This node should have no children.
DCHECK(!sync_node.HasChildren());
// Remove association and delete the sync node.
model_associator_->Disassociate(sync_node.GetId());
sync_node.Remove();
}
void BookmarkChangeProcessor::RemoveSyncNodeHierarchy(
const BookmarkNode* topmost) {
syncer::WriteTransaction trans(FROM_HERE, share_handle());
// Later logic assumes that |topmost| has been unlinked.
DCHECK(topmost->is_root());
// A BookmarkModel deletion event means that |node| and all its children were
// deleted. Sync backend expects children to be deleted individually, so we do
// a depth-first-search here. At each step, we consider the |index|-th child
// of |node|. |index_stack| stores index values for the parent levels.
std::stack<int> index_stack;
index_stack.push(0); // For the final pop. It's never used.
const BookmarkNode* node = topmost;
int index = 0;
while (node) {
// The top of |index_stack| should always be |node|'s index.
DCHECK(node->is_root() || (node->parent()->GetIndexOf(node) ==
index_stack.top()));
if (index == node->child_count()) {
// If we've processed all of |node|'s children, delete |node| and move
// on to its successor.
RemoveOneSyncNode(&trans, node);
node = node->parent();
index = index_stack.top() + 1; // (top() + 0) was what we removed.
index_stack.pop();
} else {
// If |node| has an unprocessed child, process it next after pushing the
// current state onto the stack.
DCHECK_LT(index, node->child_count());
index_stack.push(index);
node = node->GetChild(index);
index = 0;
}
}
DCHECK(index_stack.empty()); // Nothing should be left on the stack.
}
void BookmarkChangeProcessor::Loaded(BookmarkModel* model,
bool ids_reassigned) {
NOTREACHED();
}
void BookmarkChangeProcessor::BookmarkModelBeingDeleted(
BookmarkModel* model) {
DCHECK(!running()) << "BookmarkModel deleted while ChangeProcessor running.";
bookmark_model_ = NULL;
}
void BookmarkChangeProcessor::BookmarkNodeAdded(BookmarkModel* model,
const BookmarkNode* parent,
int index) {
DCHECK(running());
DCHECK(share_handle());
// Acquire a scoped write lock via a transaction.
syncer::WriteTransaction trans(FROM_HERE, share_handle());
CreateSyncNode(parent, model, index, &trans, model_associator_,
error_handler());
}
// static
int64 BookmarkChangeProcessor::CreateSyncNode(const BookmarkNode* parent,
BookmarkModel* model, int index, syncer::WriteTransaction* trans,
BookmarkModelAssociator* associator,
DataTypeErrorHandler* error_handler) {
const BookmarkNode* child = parent->GetChild(index);
DCHECK(child);
// Create a WriteNode container to hold the new node.
syncer::WriteNode sync_child(trans);
// Actually create the node with the appropriate initial position.
if (!PlaceSyncNode(CREATE, parent, index, trans, &sync_child, associator)) {
error_handler->OnSingleDatatypeUnrecoverableError(FROM_HERE,
"Sync node creation failed; recovery unlikely");
return syncer::kInvalidId;
}
UpdateSyncNodeProperties(child, model, &sync_child);
// Associate the ID from the sync domain with the bookmark node, so that we
// can refer back to this item later.
associator->Associate(child, sync_child.GetId());
return sync_child.GetId();
}
void BookmarkChangeProcessor::BookmarkNodeRemoved(BookmarkModel* model,
const BookmarkNode* parent,
int index,
const BookmarkNode* node) {
DCHECK(running());
RemoveSyncNodeHierarchy(node);
}
void BookmarkChangeProcessor::BookmarkNodeChanged(BookmarkModel* model,
const BookmarkNode* node) {
DCHECK(running());
// We shouldn't see changes to the top-level nodes.
if (model->is_permanent_node(node)) {
NOTREACHED() << "Saw update to permanent node!";
return;
}
// Acquire a scoped write lock via a transaction.
syncer::WriteTransaction trans(FROM_HERE, share_handle());
// Lookup the sync node that's associated with |node|.
syncer::WriteNode sync_node(&trans);
if (!model_associator_->InitSyncNodeFromChromeId(node->id(), &sync_node)) {
// TODO(tim): Investigating bug 121587.
if (model_associator_->GetSyncIdFromChromeId(node->id()) ==
syncer::kInvalidId) {
error_handler()->OnSingleDatatypeUnrecoverableError(FROM_HERE,
"Bookmark id not found in model associator on BookmarkNodeChanged");
LOG(ERROR) << "Bad id.";
} else if (!sync_node.GetEntry()->good()) {
error_handler()->OnSingleDatatypeUnrecoverableError(FROM_HERE,
"Could not InitByIdLookup on BookmarkNodeChanged, good() failed");
LOG(ERROR) << "Bad entry.";
} else if (sync_node.GetEntry()->Get(syncer::syncable::IS_DEL)) {
error_handler()->OnSingleDatatypeUnrecoverableError(FROM_HERE,
"Could not InitByIdLookup on BookmarkNodeChanged, is_del true");
LOG(ERROR) << "Deleted entry.";
} else {
syncer::Cryptographer* crypto = trans.GetCryptographer();
syncer::ModelTypeSet encrypted_types(crypto->GetEncryptedTypes());
const sync_pb::EntitySpecifics& specifics =
sync_node.GetEntry()->Get(syncer::syncable::SPECIFICS);
CHECK(specifics.has_encrypted());
const bool can_decrypt = crypto->CanDecrypt(specifics.encrypted());
const bool agreement = encrypted_types.Has(syncer::BOOKMARKS);
if (!agreement && !can_decrypt) {
error_handler()->OnSingleDatatypeUnrecoverableError(FROM_HERE,
"Could not InitByIdLookup on BookmarkNodeChanged, "
" Cryptographer thinks bookmarks not encrypted, and CanDecrypt"
" failed.");
LOG(ERROR) << "Case 1.";
} else if (agreement && can_decrypt) {
error_handler()->OnSingleDatatypeUnrecoverableError(FROM_HERE,
"Could not InitByIdLookup on BookmarkNodeChanged, "
" Cryptographer thinks bookmarks are encrypted, and CanDecrypt"
" succeeded (?!), but DecryptIfNecessary failed.");
LOG(ERROR) << "Case 2.";
} else if (agreement) {
error_handler()->OnSingleDatatypeUnrecoverableError(FROM_HERE,
"Could not InitByIdLookup on BookmarkNodeChanged, "
" Cryptographer thinks bookmarks are encrypted, but CanDecrypt"
" failed.");
LOG(ERROR) << "Case 3.";
} else {
error_handler()->OnSingleDatatypeUnrecoverableError(FROM_HERE,
"Could not InitByIdLookup on BookmarkNodeChanged, "
" Cryptographer thinks bookmarks not encrypted, but CanDecrypt"
" succeeded (super weird, btw)");
LOG(ERROR) << "Case 4.";
}
}
return;
}
UpdateSyncNodeProperties(node, model, &sync_node);
DCHECK_EQ(sync_node.GetIsFolder(), node->is_folder());
DCHECK_EQ(model_associator_->GetChromeNodeFromSyncId(
sync_node.GetParentId()),
node->parent());
// This node's index should be one more than the predecessor's index.
DCHECK_EQ(node->parent()->GetIndexOf(node),
CalculateBookmarkModelInsertionIndex(node->parent(),
&sync_node));
}
void BookmarkChangeProcessor::BookmarkNodeMoved(BookmarkModel* model,
const BookmarkNode* old_parent, int old_index,
const BookmarkNode* new_parent, int new_index) {
DCHECK(running());
const BookmarkNode* child = new_parent->GetChild(new_index);
// We shouldn't see changes to the top-level nodes.
if (model->is_permanent_node(child)) {
NOTREACHED() << "Saw update to permanent node!";
return;
}
// Acquire a scoped write lock via a transaction.
syncer::WriteTransaction trans(FROM_HERE, share_handle());
// Lookup the sync node that's associated with |child|.
syncer::WriteNode sync_node(&trans);
if (!model_associator_->InitSyncNodeFromChromeId(child->id(), &sync_node)) {
error_handler()->OnSingleDatatypeUnrecoverableError(FROM_HERE,
std::string());
return;
}
if (!PlaceSyncNode(MOVE, new_parent, new_index, &trans, &sync_node,
model_associator_)) {
error_handler()->OnSingleDatatypeUnrecoverableError(FROM_HERE,
std::string());
return;
}
}
void BookmarkChangeProcessor::BookmarkNodeFaviconChanged(
BookmarkModel* model,
const BookmarkNode* node) {
DCHECK(running());
BookmarkNodeChanged(model, node);
}
void BookmarkChangeProcessor::BookmarkNodeChildrenReordered(
BookmarkModel* model, const BookmarkNode* node) {
// Acquire a scoped write lock via a transaction.
syncer::WriteTransaction trans(FROM_HERE, share_handle());
// The given node's children got reordered. We need to reorder all the
// children of the corresponding sync node.
for (int i = 0; i < node->child_count(); ++i) {
syncer::WriteNode sync_child(&trans);
if (!model_associator_->InitSyncNodeFromChromeId(node->GetChild(i)->id(),
&sync_child)) {
error_handler()->OnSingleDatatypeUnrecoverableError(FROM_HERE,
std::string());
return;
}
DCHECK_EQ(sync_child.GetParentId(),
model_associator_->GetSyncIdFromChromeId(node->id()));
if (!PlaceSyncNode(MOVE, node, i, &trans, &sync_child,
model_associator_)) {
error_handler()->OnSingleDatatypeUnrecoverableError(FROM_HERE,
std::string());
return;
}
}
}
// static
bool BookmarkChangeProcessor::PlaceSyncNode(MoveOrCreate operation,
const BookmarkNode* parent, int index, syncer::WriteTransaction* trans,
syncer::WriteNode* dst, BookmarkModelAssociator* associator) {
syncer::ReadNode sync_parent(trans);
if (!associator->InitSyncNodeFromChromeId(parent->id(), &sync_parent)) {
LOG(WARNING) << "Parent lookup failed";
return false;
}
bool success = false;
if (index == 0) {
// Insert into first position.
success = (operation == CREATE) ?
dst->InitByCreation(syncer::BOOKMARKS, sync_parent, NULL) :
dst->SetPosition(sync_parent, NULL);
if (success) {
DCHECK_EQ(dst->GetParentId(), sync_parent.GetId());
DCHECK_EQ(dst->GetId(), sync_parent.GetFirstChildId());
DCHECK_EQ(dst->GetPredecessorId(), syncer::kInvalidId);
}
} else {
// Find the bookmark model predecessor, and insert after it.
const BookmarkNode* prev = parent->GetChild(index - 1);
syncer::ReadNode sync_prev(trans);
if (!associator->InitSyncNodeFromChromeId(prev->id(), &sync_prev)) {
LOG(WARNING) << "Predecessor lookup failed";
return false;
}
success = (operation == CREATE) ?
dst->InitByCreation(syncer::BOOKMARKS, sync_parent, &sync_prev) :
dst->SetPosition(sync_parent, &sync_prev);
if (success) {
DCHECK_EQ(dst->GetParentId(), sync_parent.GetId());
DCHECK_EQ(dst->GetPredecessorId(), sync_prev.GetId());
DCHECK_EQ(dst->GetId(), sync_prev.GetSuccessorId());
}
}
return success;
}
// Determine the bookmark model index to which a node must be moved so that
// predecessor of the node (in the bookmark model) matches the predecessor of
// |source| (in the sync model).
// As a precondition, this assumes that the predecessor of |source| has been
// updated and is already in the correct position in the bookmark model.
int BookmarkChangeProcessor::CalculateBookmarkModelInsertionIndex(
const BookmarkNode* parent,
const syncer::BaseNode* child_info) const {
DCHECK(parent);
DCHECK(child_info);
int64 predecessor_id = child_info->GetPredecessorId();
// A return ID of kInvalidId indicates no predecessor.
if (predecessor_id == syncer::kInvalidId)
return 0;
// Otherwise, insert after the predecessor bookmark node.
const BookmarkNode* predecessor =
model_associator_->GetChromeNodeFromSyncId(predecessor_id);
DCHECK(predecessor);
DCHECK_EQ(predecessor->parent(), parent);
return parent->GetIndexOf(predecessor) + 1;
}
// ApplyModelChanges is called by the sync backend after changes have been made
// to the sync engine's model. Apply these changes to the browser bookmark
// model.
void BookmarkChangeProcessor::ApplyChangesFromSyncModel(
const syncer::BaseTransaction* trans,
const syncer::ImmutableChangeRecordList& changes) {
if (!running())
return;
DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));
// A note about ordering. Sync backend is responsible for ordering the change
// records in the following order:
//
// 1. Deletions, from leaves up to parents.
// 2. Existing items with synced parents & predecessors.
// 3. New items with synced parents & predecessors.
// 4. Items with parents & predecessors in the list.
// 5. Repeat #4 until all items are in the list.
//
// "Predecessor" here means the previous item within a given folder; an item
// in the first position is always said to have a synced predecessor.
// For the most part, applying these changes in the order given will yield
// the correct result. There is one exception, however: for items that are
// moved away from a folder that is being deleted, we will process the delete
// before the move. Since deletions in the bookmark model propagate from
// parent to child, we must move them to a temporary location.
BookmarkModel* model = bookmark_model_;
// We are going to make changes to the bookmarks model, but don't want to end
// up in a feedback loop, so remove ourselves as an observer while applying
// changes.
model->RemoveObserver(this);
// A parent to hold nodes temporarily orphaned by parent deletion. It is
// lazily created inside the loop.
const BookmarkNode* foster_parent = NULL;
// Whether we have passed all the deletes (which should be at the
// front of the list).
bool passed_deletes = false;
for (syncer::ChangeRecordList::const_iterator it =
changes.Get().begin(); it != changes.Get().end(); ++it) {
const BookmarkNode* dst =
model_associator_->GetChromeNodeFromSyncId(it->id);
// Ignore changes to the permanent top-level nodes. We only care about
// their children.
if (model->is_permanent_node(dst))
continue;
if (it->action ==
syncer::ChangeRecord::ACTION_DELETE) {
// Deletions should always be at the front of the list.
DCHECK(!passed_deletes);
// Children of a deleted node should not be deleted; they may be
// reparented by a later change record. Move them to a temporary place.
if (!dst) // Can't do anything if we can't find the chrome node.
continue;
const BookmarkNode* parent = dst->parent();
if (!dst->empty()) {
if (!foster_parent) {
foster_parent = model->AddFolder(model->other_node(),
model->other_node()->child_count(),
string16());
if (!foster_parent) {
error_handler()->OnSingleDatatypeUnrecoverableError(FROM_HERE,
"Failed to create foster parent.");
return;
}
}
for (int i = dst->child_count() - 1; i >= 0; --i) {
model->Move(dst->GetChild(i), foster_parent,
foster_parent->child_count());
}
}
DCHECK_EQ(dst->child_count(), 0) << "Node being deleted has children";
model_associator_->Disassociate(it->id);
int index = parent->GetIndexOf(dst);
if (index > -1)
model->Remove(parent, index);
dst = NULL;
} else {
DCHECK_EQ((it->action ==
syncer::ChangeRecord::ACTION_ADD), (dst == NULL))
<< "ACTION_ADD should be seen if and only if the node is unknown.";
passed_deletes = true;
syncer::ReadNode src(trans);
if (src.InitByIdLookup(it->id) != syncer::BaseNode::INIT_OK) {
error_handler()->OnSingleDatatypeUnrecoverableError(FROM_HERE,
"ApplyModelChanges was passed a bad ID");
return;
}
if (!CreateOrUpdateBookmarkNode(&src, model)) {
// Because the Synced Bookmarks node can be created server side, it's
// possible it'll arrive at the client as an update. In that case it
// won't have been associated at startup, the GetChromeNodeFromSyncId
// call above will return NULL, and we won't detect it as a permanent
// node, resulting in us trying to create it here (which will
// fail). Therefore, we add special logic here just to detect the
// Synced Bookmarks folder.
syncer::ReadNode synced_bookmarks(trans);
if (synced_bookmarks.InitByTagLookup(kMobileBookmarksTag) ==
syncer::BaseNode::INIT_OK &&
synced_bookmarks.GetId() == it->id) {
// This is a newly created Synced Bookmarks node. Associate it.
model_associator_->Associate(model->mobile_node(), it->id);
} else {
// We ignore bookmarks we can't add. Chances are this is caused by
// a bookmark that was not fully associated.
LOG(ERROR) << "Failed to create bookmark node with title "
<< src.GetTitle() + " and url "
<< src.GetURL().possibly_invalid_spec();
}
}
}
}
// Clean up the temporary node.
if (foster_parent) {
// There should be no nodes left under the foster parent.
DCHECK_EQ(foster_parent->child_count(), 0);
model->Remove(foster_parent->parent(),
foster_parent->parent()->GetIndexOf(foster_parent));
foster_parent = NULL;
}
// The visibility of the mobile node may need to change.
model_associator_->UpdatePermanentNodeVisibility();
// We are now ready to hear about bookmarks changes again.
model->AddObserver(this);
}
// Create a bookmark node corresponding to |src| if one is not already
// associated with |src|.
const BookmarkNode* BookmarkChangeProcessor::CreateOrUpdateBookmarkNode(
syncer::BaseNode* src,
BookmarkModel* model) {
const BookmarkNode* parent =
model_associator_->GetChromeNodeFromSyncId(src->GetParentId());
if (!parent) {
DLOG(WARNING) << "Could not find parent of node being added/updated."
<< " Node title: " << src->GetTitle()
<< ", parent id = " << src->GetParentId();
return NULL;
}
int index = CalculateBookmarkModelInsertionIndex(parent, src);
const BookmarkNode* dst = model_associator_->GetChromeNodeFromSyncId(
src->GetId());
if (!dst) {
dst = CreateBookmarkNode(src, parent, model, index);
if (dst)
model_associator_->Associate(dst, src->GetId());
} else {
// URL and is_folder are not expected to change.
// TODO(ncarter): Determine if such changes should be legal or not.
DCHECK_EQ(src->GetIsFolder(), dst->is_folder());
// Handle reparenting and/or repositioning.
model->Move(dst, parent, index);
if (!src->GetIsFolder())
model->SetURL(dst, src->GetURL());
model->SetTitle(dst, UTF8ToUTF16(src->GetTitle()));
SetBookmarkFavicon(src, dst, model);
}
return dst;
}
// static
// Creates a bookmark node under the given parent node from the given sync
// node. Returns the newly created node.
const BookmarkNode* BookmarkChangeProcessor::CreateBookmarkNode(
syncer::BaseNode* sync_node,
const BookmarkNode* parent,
BookmarkModel* model,
int index) {
DCHECK(parent);
DCHECK(index >= 0 && index <= parent->child_count());
const BookmarkNode* node;
if (sync_node->GetIsFolder()) {
node = model->AddFolder(parent, index,
UTF8ToUTF16(sync_node->GetTitle()));
} else {
node = model->AddURL(parent, index,
UTF8ToUTF16(sync_node->GetTitle()),
sync_node->GetURL());
if (node)
SetBookmarkFavicon(sync_node, node, model);
}
return node;
}
// static
// Sets the favicon of the given bookmark node from the given sync node.
bool BookmarkChangeProcessor::SetBookmarkFavicon(
syncer::BaseNode* sync_node,
const BookmarkNode* bookmark_node,
BookmarkModel* bookmark_model) {
std::vector<unsigned char> icon_bytes_vector;
sync_node->GetFaviconBytes(&icon_bytes_vector);
if (icon_bytes_vector.empty())
return false;
ApplyBookmarkFavicon(bookmark_node, bookmark_model->profile(),
icon_bytes_vector);
return true;
}
// static
// Applies the given favicon bytes vector to the given bookmark node.
void BookmarkChangeProcessor::ApplyBookmarkFavicon(
const BookmarkNode* bookmark_node,
Profile* profile,
const std::vector<unsigned char>& icon_bytes_vector) {
// Registering a favicon requires that we provide a source URL, but we
// don't know where these came from. Currently we just use the
// destination URL, which is not correct, but since the favicon URL
// is used as a key in the history's thumbnail DB, this gives us a value
// which does not collide with others.
GURL fake_icon_url = bookmark_node->url();
HistoryService* history =
profile->GetHistoryService(Profile::EXPLICIT_ACCESS);
FaviconService* favicon_service =
profile->GetFaviconService(Profile::EXPLICIT_ACCESS);
history->AddPageNoVisitForBookmark(bookmark_node->url(),
bookmark_node->GetTitle());
favicon_service->SetFavicon(bookmark_node->url(),
fake_icon_url,
icon_bytes_vector,
history::FAVICON);
}
// static
void BookmarkChangeProcessor::SetSyncNodeFavicon(
const BookmarkNode* bookmark_node,
BookmarkModel* model,
syncer::WriteNode* sync_node) {
std::vector<unsigned char> favicon_bytes;
EncodeFavicon(bookmark_node, model, &favicon_bytes);
if (!favicon_bytes.empty())
sync_node->SetFaviconBytes(favicon_bytes);
}
} // namespace browser_sync
|