src/components/bookmarks/browser/bookmark_model.cc

   1 // Copyright 2014 The Chromium Authors. All rights reserved.
   2 // Use of this source code is governed by a BSD-style license that can be
   3 // found in the LICENSE file.
   4
   5 #include "components/bookmarks/browser/bookmark_model.h"
   6
   7 #include <algorithm>
   8 #include <functional>
   9
  10 #include "base/bind.h"
  11 #include "base/bind_helpers.h"
  12 #include "base/i18n/string_compare.h"
  13 #include "base/logging.h"
  14 #include "base/macros.h"
  15 #include "base/strings/string_util.h"
  16 #include "components/bookmarks/browser/bookmark_expanded_state_tracker.h"
  17 #include "components/bookmarks/browser/bookmark_index.h"
  18 #include "components/bookmarks/browser/bookmark_match.h"
  19 #include "components/bookmarks/browser/bookmark_model_observer.h"
  20 #include "components/bookmarks/browser/bookmark_node_data.h"
  21 #include "components/bookmarks/browser/bookmark_storage.h"
  22 #include "components/bookmarks/browser/bookmark_utils.h"
  23 #include "components/favicon_base/favicon_types.h"
  24 #include "grit/components_strings.h"
  25 #include "ui/base/l10n/l10n_util.h"
  26 #include "ui/gfx/favicon_size.h"
  27
  28 using base::Time;
  29 using bookmarks::BookmarkClient;
  30 using bookmarks::BookmarkExpandedStateTracker;
  31 using bookmarks::BookmarkIndex;
  32 using bookmarks::BookmarkLoadDetails;
  33 using bookmarks::BookmarkMatch;
  34 using bookmarks::BookmarkNodeData;
  35 using bookmarks::BookmarkStorage;
  36
  37 namespace {
  38
  39 // Helper to get a mutable bookmark node.
  40 BookmarkNode* AsMutable(const BookmarkNode* node) {
  41   return const_cast<BookmarkNode*>(node);
  42 }
  43
  44 // Helper to get a mutable permanent bookmark node.
  45 BookmarkPermanentNode* AsMutable(const BookmarkPermanentNode* node) {
  46   return const_cast<BookmarkPermanentNode*>(node);
  47 }
  48
  49 // Comparator used when sorting permanent nodes. Nodes that are initially
  50 // visible are sorted before nodes that are initially hidden.
  51 class VisibilityComparator
  52     : public std::binary_function<const BookmarkPermanentNode*,
  53                                   const BookmarkPermanentNode*,
  54                                   bool> {
  55  public:
  56   explicit VisibilityComparator(BookmarkClient* client) : client_(client) {}
  57
  58   // Returns true if |n1| preceeds |n2|.
  59   bool operator()(const BookmarkPermanentNode* n1,
  60                   const BookmarkPermanentNode* n2) {
  61     bool n1_visible = client_->IsPermanentNodeVisible(n1);
  62     bool n2_visible = client_->IsPermanentNodeVisible(n2);
  63     return n1_visible != n2_visible && n1_visible;
  64   }
  65
  66  private:
  67   BookmarkClient* client_;
  68 };
  69
  70 // Comparator used when sorting bookmarks. Folders are sorted first, then
  71 // bookmarks.
  72 class SortComparator : public std::binary_function<const BookmarkNode*,
  73                                                    const BookmarkNode*,
  74                                                    bool> {
  75  public:
  76   explicit SortComparator(icu::Collator* collator) : collator_(collator) {}
  77
  78   // Returns true if |n1| preceeds |n2|.
  79   bool operator()(const BookmarkNode* n1, const BookmarkNode* n2) {
  80     if (n1->type() == n2->type()) {
  81       // Types are the same, compare the names.
  82       if (!collator_)
  83         return n1->GetTitle() < n2->GetTitle();
  84       return base::i18n::CompareString16WithCollator(
  85           collator_, n1->GetTitle(), n2->GetTitle()) == UCOL_LESS;
  86     }
  87     // Types differ, sort such that folders come first.
  88     return n1->is_folder();
  89   }
  90
  91  private:
  92   icu::Collator* collator_;
  93 };
  94
  95 }  // namespace
  96
  97 // BookmarkModel --------------------------------------------------------------
  98
  99 BookmarkModel::BookmarkModel(BookmarkClient* client)
 100     : client_(client),
 101       loaded_(false),
 102       root_(GURL()),
 103       bookmark_bar_node_(NULL),
 104       other_node_(NULL),
 105       mobile_node_(NULL),
 106       next_node_id_(1),
 107       observers_(ObserverList<BookmarkModelObserver>::NOTIFY_EXISTING_ONLY),
 108       loaded_signal_(true, false),
 109       extensive_changes_(0) {
 110   DCHECK(client_);
 111 }
 112
 113 BookmarkModel::~BookmarkModel() {
 114   FOR_EACH_OBSERVER(BookmarkModelObserver, observers_,
 115                     BookmarkModelBeingDeleted(this));
 116
 117   if (store_.get()) {
 118     // The store maintains a reference back to us. We need to tell it we're gone
 119     // so that it doesn't try and invoke a method back on us again.
 120     store_->BookmarkModelDeleted();
 121   }
 122 }
 123
 124 void BookmarkModel::Shutdown() {
 125   if (loaded_)
 126     return;
 127
 128   // See comment in HistoryService::ShutdownOnUIThread where this is invoked for
 129   // details. It is also called when the BookmarkModel is deleted.
 130   loaded_signal_.Signal();
 131 }
 132
 133 void BookmarkModel::Load(
 134     PrefService* pref_service,
 135     const std::string& accept_languages,
 136     const base::FilePath& profile_path,
 137     const scoped_refptr<base::SequencedTaskRunner>& io_task_runner,
 138     const scoped_refptr<base::SequencedTaskRunner>& ui_task_runner) {
 139   if (store_.get()) {
 140     // If the store is non-null, it means Load was already invoked. Load should
 141     // only be invoked once.
 142     NOTREACHED();
 143     return;
 144   }
 145
 146   expanded_state_tracker_.reset(
 147       new BookmarkExpandedStateTracker(this, pref_service));
 148
 149   // Load the bookmarks. BookmarkStorage notifies us when done.
 150   store_ .reset(new BookmarkStorage(this, profile_path, io_task_runner.get()));
 151   store_->LoadBookmarks(CreateLoadDetails(accept_languages), ui_task_runner);
 152 }
 153
 154 const BookmarkNode* BookmarkModel::GetParentForNewNodes() {
 155   std::vector<const BookmarkNode*> nodes =
 156       bookmarks::GetMostRecentlyModifiedUserFolders(this, 1);
 157   DCHECK(!nodes.empty());  // This list is always padded with default folders.
 158   return nodes[0];
 159 }
 160
 161 void BookmarkModel::AddObserver(BookmarkModelObserver* observer) {
 162   observers_.AddObserver(observer);
 163 }
 164
 165 void BookmarkModel::RemoveObserver(BookmarkModelObserver* observer) {
 166   observers_.RemoveObserver(observer);
 167 }
 168
 169 void BookmarkModel::BeginExtensiveChanges() {
 170   if (++extensive_changes_ == 1) {
 171     FOR_EACH_OBSERVER(BookmarkModelObserver, observers_,
 172                       ExtensiveBookmarkChangesBeginning(this));
 173   }
 174 }
 175
 176 void BookmarkModel::EndExtensiveChanges() {
 177   --extensive_changes_;
 178   DCHECK_GE(extensive_changes_, 0);
 179   if (extensive_changes_ == 0) {
 180     FOR_EACH_OBSERVER(BookmarkModelObserver, observers_,
 181                       ExtensiveBookmarkChangesEnded(this));
 182   }
 183 }
 184
 185 void BookmarkModel::BeginGroupedChanges() {
 186   FOR_EACH_OBSERVER(BookmarkModelObserver, observers_,
 187                     GroupedBookmarkChangesBeginning(this));
 188 }
 189
 190 void BookmarkModel::EndGroupedChanges() {
 191   FOR_EACH_OBSERVER(BookmarkModelObserver, observers_,
 192                     GroupedBookmarkChangesEnded(this));
 193 }
 194
 195 void BookmarkModel::Remove(const BookmarkNode* parent, int index) {
 196   if (!loaded_ || !IsValidIndex(parent, index, false) || is_root_node(parent)) {
 197     NOTREACHED();
 198     return;
 199   }
 200   RemoveAndDeleteNode(AsMutable(parent->GetChild(index)));
 201 }
 202
 203 void BookmarkModel::RemoveAllUserBookmarks() {
 204   std::set<GURL> removed_urls;
 205   ScopedVector<BookmarkNode> removed_nodes;
 206
 207   FOR_EACH_OBSERVER(BookmarkModelObserver, observers_,
 208                     OnWillRemoveAllUserBookmarks(this));
 209
 210   BeginExtensiveChanges();
 211   // Skip deleting permanent nodes. Permanent bookmark nodes are the root and
 212   // its immediate children. For removing all non permanent nodes just remove
 213   // all children of non-root permanent nodes.
 214   {
 215     base::AutoLock url_lock(url_lock_);
 216     for (int i = 0; i < root_.child_count(); ++i) {
 217       BookmarkNode* permanent_node = root_.GetChild(i);
 218
 219       if (!client_->CanBeEditedByUser(permanent_node))
 220         continue;
 221
 222       for (int j = permanent_node->child_count() - 1; j >= 0; --j) {
 223         BookmarkNode* child_node = permanent_node->GetChild(j);
 224         removed_nodes.push_back(child_node);
 225         RemoveNodeAndGetRemovedUrls(child_node, &removed_urls);
 226       }
 227     }
 228   }
 229   EndExtensiveChanges();
 230   if (store_.get())
 231     store_->ScheduleSave();
 232
 233   FOR_EACH_OBSERVER(BookmarkModelObserver, observers_,
 234                     BookmarkAllUserNodesRemoved(this, removed_urls));
 235 }
 236
 237 void BookmarkModel::Move(const BookmarkNode* node,
 238                          const BookmarkNode* new_parent,
 239                          int index) {
 240   if (!loaded_ || !node || !IsValidIndex(new_parent, index, true) ||
 241       is_root_node(new_parent) || is_permanent_node(node)) {
 242     NOTREACHED();
 243     return;
 244   }
 245
 246   if (new_parent->HasAncestor(node)) {
 247     // Can't make an ancestor of the node be a child of the node.
 248     NOTREACHED();
 249     return;
 250   }
 251
 252   const BookmarkNode* old_parent = node->parent();
 253   int old_index = old_parent->GetIndexOf(node);
 254
 255   if (old_parent == new_parent &&
 256       (index == old_index || index == old_index + 1)) {
 257     // Node is already in this position, nothing to do.
 258     return;
 259   }
 260
 261   SetDateFolderModified(new_parent, Time::Now());
 262
 263   if (old_parent == new_parent && index > old_index)
 264     index--;
 265   BookmarkNode* mutable_new_parent = AsMutable(new_parent);
 266   mutable_new_parent->Add(AsMutable(node), index);
 267
 268   if (store_.get())
 269     store_->ScheduleSave();
 270
 271   FOR_EACH_OBSERVER(BookmarkModelObserver, observers_,
 272                     BookmarkNodeMoved(this, old_parent, old_index,
 273                                       new_parent, index));
 274 }
 275
 276 void BookmarkModel::Copy(const BookmarkNode* node,
 277                          const BookmarkNode* new_parent,
 278                          int index) {
 279   if (!loaded_ || !node || !IsValidIndex(new_parent, index, true) ||
 280       is_root_node(new_parent) || is_permanent_node(node)) {
 281     NOTREACHED();
 282     return;
 283   }
 284
 285   if (new_parent->HasAncestor(node)) {
 286     // Can't make an ancestor of the node be a child of the node.
 287     NOTREACHED();
 288     return;
 289   }
 290
 291   SetDateFolderModified(new_parent, Time::Now());
 292   BookmarkNodeData drag_data(node);
 293   std::vector<BookmarkNodeData::Element> elements(drag_data.elements);
 294   // CloneBookmarkNode will use BookmarkModel methods to do the job, so we
 295   // don't need to send notifications here.
 296   bookmarks::CloneBookmarkNode(this, elements, new_parent, index, true);
 297
 298   if (store_.get())
 299     store_->ScheduleSave();
 300 }
 301
 302 const gfx::Image& BookmarkModel::GetFavicon(const BookmarkNode* node) {
 303   DCHECK(node);
 304   if (node->favicon_state() == BookmarkNode::INVALID_FAVICON) {
 305     BookmarkNode* mutable_node = AsMutable(node);
 306     LoadFavicon(
 307         mutable_node,
 308         client_->PreferTouchIcon() ?
 309             favicon_base::TOUCH_ICON :
 310             favicon_base::FAVICON);
 311   }
 312   return node->favicon();
 313 }
 314
 315 favicon_base::IconType BookmarkModel::GetFaviconType(const BookmarkNode* node) {
 316   DCHECK(node);
 317   return node->favicon_type();
 318 }
 319
 320 void BookmarkModel::SetTitle(const BookmarkNode* node,
 321                              const base::string16& title) {
 322   if (!node) {
 323     NOTREACHED();
 324     return;
 325   }
 326   if (node->GetTitle() == title)
 327     return;
 328
 329   if (is_permanent_node(node) && !client_->CanSetPermanentNodeTitle(node)) {
 330     NOTREACHED();
 331     return;
 332   }
 333
 334   FOR_EACH_OBSERVER(BookmarkModelObserver, observers_,
 335                     OnWillChangeBookmarkNode(this, node));
 336
 337   // The title index doesn't support changing the title, instead we remove then
 338   // add it back.
 339   index_->Remove(node);
 340   AsMutable(node)->SetTitle(title);
 341   index_->Add(node);
 342
 343   if (store_.get())
 344     store_->ScheduleSave();
 345
 346   FOR_EACH_OBSERVER(BookmarkModelObserver, observers_,
 347                     BookmarkNodeChanged(this, node));
 348 }
 349
 350 void BookmarkModel::SetURL(const BookmarkNode* node, const GURL& url) {
 351   if (!node) {
 352     NOTREACHED();
 353     return;
 354   }
 355
 356   // We cannot change the URL of a folder.
 357   if (node->is_folder()) {
 358     NOTREACHED();
 359     return;
 360   }
 361
 362   if (node->url() == url)
 363     return;
 364
 365   BookmarkNode* mutable_node = AsMutable(node);
 366   mutable_node->InvalidateFavicon();
 367   CancelPendingFaviconLoadRequests(mutable_node);
 368
 369   FOR_EACH_OBSERVER(BookmarkModelObserver, observers_,
 370                     OnWillChangeBookmarkNode(this, node));
 371
 372   {
 373     base::AutoLock url_lock(url_lock_);
 374     RemoveNodeFromInternalMaps(mutable_node);
 375     mutable_node->set_url(url);
 376     AddNodeToInternalMaps(mutable_node);
 377   }
 378
 379   if (store_.get())
 380     store_->ScheduleSave();
 381
 382   FOR_EACH_OBSERVER(BookmarkModelObserver, observers_,
 383                     BookmarkNodeChanged(this, node));
 384 }
 385
 386 void BookmarkModel::SetNodeMetaInfo(const BookmarkNode* node,
 387                                     const std::string& key,
 388                                     const std::string& value) {
 389   std::string old_value;
 390   if (node->GetMetaInfo(key, &old_value) && old_value == value)
 391     return;
 392
 393   FOR_EACH_OBSERVER(BookmarkModelObserver, observers_,
 394                     OnWillChangeBookmarkMetaInfo(this, node));
 395
 396   if (AsMutable(node)->SetMetaInfo(key, value) && store_.get())
 397     store_->ScheduleSave();
 398
 399   FOR_EACH_OBSERVER(BookmarkModelObserver, observers_,
 400                     BookmarkMetaInfoChanged(this, node));
 401 }
 402
 403 void BookmarkModel::SetNodeMetaInfoMap(
 404     const BookmarkNode* node,
 405     const BookmarkNode::MetaInfoMap& meta_info_map) {
 406   const BookmarkNode::MetaInfoMap* old_meta_info_map = node->GetMetaInfoMap();
 407   if ((!old_meta_info_map && meta_info_map.empty()) ||
 408       (old_meta_info_map && meta_info_map == *old_meta_info_map))
 409     return;
 410
 411   FOR_EACH_OBSERVER(BookmarkModelObserver, observers_,
 412                     OnWillChangeBookmarkMetaInfo(this, node));
 413
 414   AsMutable(node)->SetMetaInfoMap(meta_info_map);
 415   if (store_.get())
 416     store_->ScheduleSave();
 417
 418   FOR_EACH_OBSERVER(BookmarkModelObserver, observers_,
 419                     BookmarkMetaInfoChanged(this, node));
 420 }
 421
 422 void BookmarkModel::DeleteNodeMetaInfo(const BookmarkNode* node,
 423                                        const std::string& key) {
 424   const BookmarkNode::MetaInfoMap* meta_info_map = node->GetMetaInfoMap();
 425   if (!meta_info_map || meta_info_map->find(key) == meta_info_map->end())
 426     return;
 427
 428   FOR_EACH_OBSERVER(BookmarkModelObserver, observers_,
 429                     OnWillChangeBookmarkMetaInfo(this, node));
 430
 431   if (AsMutable(node)->DeleteMetaInfo(key) && store_.get())
 432     store_->ScheduleSave();
 433
 434   FOR_EACH_OBSERVER(BookmarkModelObserver, observers_,
 435                     BookmarkMetaInfoChanged(this, node));
 436 }
 437
 438 void BookmarkModel::SetNodeSyncTransactionVersion(
 439     const BookmarkNode* node,
 440     int64 sync_transaction_version) {
 441   DCHECK(client_->CanSyncNode(node));
 442
 443   if (sync_transaction_version == node->sync_transaction_version())
 444     return;
 445
 446   AsMutable(node)->set_sync_transaction_version(sync_transaction_version);
 447   if (store_.get())
 448     store_->ScheduleSave();
 449 }
 450
 451 void BookmarkModel::OnFaviconChanged(const std::set<GURL>& urls) {
 452   // Ignore events if |Load| has not been called yet.
 453   if (!store_)
 454     return;
 455
 456   // Prevent the observers from getting confused for multiple favicon loads.
 457   for (std::set<GURL>::const_iterator i = urls.begin(); i != urls.end(); ++i) {
 458     std::vector<const BookmarkNode*> nodes;
 459     GetNodesByURL(*i, &nodes);
 460     for (size_t i = 0; i < nodes.size(); ++i) {
 461       // Got an updated favicon, for a URL, do a new request.
 462       BookmarkNode* node = AsMutable(nodes[i]);
 463       node->InvalidateFavicon();
 464       CancelPendingFaviconLoadRequests(node);
 465       FOR_EACH_OBSERVER(BookmarkModelObserver,
 466                         observers_,
 467                         BookmarkNodeFaviconChanged(this, node));
 468     }
 469   }
 470 }
 471
 472 void BookmarkModel::SetDateAdded(const BookmarkNode* node,
 473                                  Time date_added) {
 474   if (!node) {
 475     NOTREACHED();
 476     return;
 477   }
 478
 479   if (node->date_added() == date_added)
 480     return;
 481
 482   if (is_permanent_node(node)) {
 483     NOTREACHED();
 484     return;
 485   }
 486
 487   AsMutable(node)->set_date_added(date_added);
 488
 489   // Syncing might result in dates newer than the folder's last modified date.
 490   if (date_added > node->parent()->date_folder_modified()) {
 491     // Will trigger store_->ScheduleSave().
 492     SetDateFolderModified(node->parent(), date_added);
 493   } else if (store_.get()) {
 494     store_->ScheduleSave();
 495   }
 496 }
 497
 498 void BookmarkModel::GetNodesByURL(const GURL& url,
 499                                   std::vector<const BookmarkNode*>* nodes) {
 500   base::AutoLock url_lock(url_lock_);
 501   BookmarkNode tmp_node(url);
 502   NodesOrderedByURLSet::iterator i = nodes_ordered_by_url_set_.find(&tmp_node);
 503   while (i != nodes_ordered_by_url_set_.end() && (*i)->url() == url) {
 504     nodes->push_back(*i);
 505     ++i;
 506   }
 507 }
 508
 509 const BookmarkNode* BookmarkModel::GetMostRecentlyAddedUserNodeForURL(
 510     const GURL& url) {
 511   std::vector<const BookmarkNode*> nodes;
 512   GetNodesByURL(url, &nodes);
 513   std::sort(nodes.begin(), nodes.end(), &bookmarks::MoreRecentlyAdded);
 514
 515   // Look for the first node that the user can edit.
 516   for (size_t i = 0; i < nodes.size(); ++i) {
 517     if (client_->CanBeEditedByUser(nodes[i]))
 518       return nodes[i];
 519   }
 520
 521   return NULL;
 522 }
 523
 524 bool BookmarkModel::HasBookmarks() {
 525   base::AutoLock url_lock(url_lock_);
 526   return !nodes_ordered_by_url_set_.empty();
 527 }
 528
 529 bool BookmarkModel::IsBookmarked(const GURL& url) {
 530   base::AutoLock url_lock(url_lock_);
 531   return IsBookmarkedNoLock(url);
 532 }
 533
 534 void BookmarkModel::GetBookmarks(
 535     std::vector<BookmarkModel::URLAndTitle>* bookmarks) {
 536   base::AutoLock url_lock(url_lock_);
 537   const GURL* last_url = NULL;
 538   for (NodesOrderedByURLSet::iterator i = nodes_ordered_by_url_set_.begin();
 539        i != nodes_ordered_by_url_set_.end(); ++i) {
 540     const GURL* url = &((*i)->url());
 541     // Only add unique URLs.
 542     if (!last_url || *url != *last_url) {
 543       BookmarkModel::URLAndTitle bookmark;
 544       bookmark.url = *url;
 545       bookmark.title = (*i)->GetTitle();
 546       bookmarks->push_back(bookmark);
 547     }
 548     last_url = url;
 549   }
 550 }
 551
 552 void BookmarkModel::BlockTillLoaded() {
 553   loaded_signal_.Wait();
 554 }
 555
 556 const BookmarkNode* BookmarkModel::AddFolder(const BookmarkNode* parent,
 557                                              int index,
 558                                              const base::string16& title) {
 559   return AddFolderWithMetaInfo(parent, index, title, NULL);
 560 }
 561 const BookmarkNode* BookmarkModel::AddFolderWithMetaInfo(
 562     const BookmarkNode* parent,
 563     int index,
 564     const base::string16& title,
 565     const BookmarkNode::MetaInfoMap* meta_info) {
 566   if (!loaded_ || is_root_node(parent) || !IsValidIndex(parent, index, true)) {
 567     // Can't add to the root.
 568     NOTREACHED();
 569     return NULL;
 570   }
 571
 572   BookmarkNode* new_node = new BookmarkNode(generate_next_node_id(), GURL());
 573   new_node->set_date_folder_modified(Time::Now());
 574   // Folders shouldn't have line breaks in their titles.
 575   new_node->SetTitle(title);
 576   new_node->set_type(BookmarkNode::FOLDER);
 577   if (meta_info)
 578     new_node->SetMetaInfoMap(*meta_info);
 579
 580   return AddNode(AsMutable(parent), index, new_node);
 581 }
 582
 583 const BookmarkNode* BookmarkModel::AddURL(const BookmarkNode* parent,
 584                                           int index,
 585                                           const base::string16& title,
 586                                           const GURL& url) {
 587   return AddURLWithCreationTimeAndMetaInfo(
 588       parent,
 589       index,
 590       base::CollapseWhitespace(title, false),
 591       url,
 592       Time::Now(),
 593       NULL);
 594 }
 595
 596 const BookmarkNode* BookmarkModel::AddURLWithCreationTimeAndMetaInfo(
 597     const BookmarkNode* parent,
 598     int index,
 599     const base::string16& title,
 600     const GURL& url,
 601     const Time& creation_time,
 602     const BookmarkNode::MetaInfoMap* meta_info) {
 603   if (!loaded_ || !url.is_valid() || is_root_node(parent) ||
 604       !IsValidIndex(parent, index, true)) {
 605     NOTREACHED();
 606     return NULL;
 607   }
 608
 609   // Syncing may result in dates newer than the last modified date.
 610   if (creation_time > parent->date_folder_modified())
 611     SetDateFolderModified(parent, creation_time);
 612
 613   BookmarkNode* new_node = new BookmarkNode(generate_next_node_id(), url);
 614   new_node->SetTitle(title);
 615   new_node->set_date_added(creation_time);
 616   new_node->set_type(BookmarkNode::URL);
 617   if (meta_info)
 618     new_node->SetMetaInfoMap(*meta_info);
 619
 620   return AddNode(AsMutable(parent), index, new_node);
 621 }
 622
 623 void BookmarkModel::SortChildren(const BookmarkNode* parent) {
 624   DCHECK(client_->CanBeEditedByUser(parent));
 625
 626   if (!parent || !parent->is_folder() || is_root_node(parent) ||
 627       parent->child_count() <= 1) {
 628     return;
 629   }
 630
 631   FOR_EACH_OBSERVER(BookmarkModelObserver, observers_,
 632                     OnWillReorderBookmarkNode(this, parent));
 633
 634   UErrorCode error = U_ZERO_ERROR;
 635   scoped_ptr<icu::Collator> collator(icu::Collator::createInstance(error));
 636   if (U_FAILURE(error))
 637     collator.reset(NULL);
 638   BookmarkNode* mutable_parent = AsMutable(parent);
 639   std::sort(mutable_parent->children().begin(),
 640             mutable_parent->children().end(),
 641             SortComparator(collator.get()));
 642
 643   if (store_.get())
 644     store_->ScheduleSave();
 645
 646   FOR_EACH_OBSERVER(BookmarkModelObserver, observers_,
 647                     BookmarkNodeChildrenReordered(this, parent));
 648 }
 649
 650 void BookmarkModel::ReorderChildren(
 651     const BookmarkNode* parent,
 652     const std::vector<const BookmarkNode*>& ordered_nodes) {
 653   DCHECK(client_->CanBeEditedByUser(parent));
 654
 655   // Ensure that all children in |parent| are in |ordered_nodes|.
 656   DCHECK_EQ(static_cast<size_t>(parent->child_count()), ordered_nodes.size());
 657   for (size_t i = 0; i < ordered_nodes.size(); ++i)
 658     DCHECK_EQ(parent, ordered_nodes[i]->parent());
 659
 660   FOR_EACH_OBSERVER(BookmarkModelObserver, observers_,
 661                     OnWillReorderBookmarkNode(this, parent));
 662
 663   AsMutable(parent)->SetChildren(
 664       *(reinterpret_cast<const std::vector<BookmarkNode*>*>(&ordered_nodes)));
 665
 666   if (store_.get())
 667     store_->ScheduleSave();
 668
 669   FOR_EACH_OBSERVER(BookmarkModelObserver, observers_,
 670                     BookmarkNodeChildrenReordered(this, parent));
 671 }
 672
 673 void BookmarkModel::SetDateFolderModified(const BookmarkNode* parent,
 674                                           const Time time) {
 675   DCHECK(parent);
 676   AsMutable(parent)->set_date_folder_modified(time);
 677
 678   if (store_.get())
 679     store_->ScheduleSave();
 680 }
 681
 682 void BookmarkModel::ResetDateFolderModified(const BookmarkNode* node) {
 683   SetDateFolderModified(node, Time());
 684 }
 685
 686 void BookmarkModel::GetBookmarksMatching(const base::string16& text,
 687                                          size_t max_count,
 688                                          std::vector<BookmarkMatch>* matches) {
 689   GetBookmarksMatching(text, max_count,
 690                        query_parser::MatchingAlgorithm::DEFAULT, matches);
 691 }
 692
 693 void BookmarkModel::GetBookmarksMatching(
 694     const base::string16& text,
 695     size_t max_count,
 696     query_parser::MatchingAlgorithm matching_algorithm,
 697     std::vector<BookmarkMatch>* matches) {
 698   if (!loaded_)
 699     return;
 700
 701   index_->GetBookmarksMatching(text, max_count, matching_algorithm, matches);
 702 }
 703
 704 void BookmarkModel::ClearStore() {
 705   store_.reset();
 706 }
 707
 708 void BookmarkModel::SetPermanentNodeVisible(BookmarkNode::Type type,
 709                                             bool value) {
 710   BookmarkPermanentNode* node = AsMutable(PermanentNode(type));
 711   node->set_visible(value || client_->IsPermanentNodeVisible(node));
 712 }
 713
 714 const BookmarkPermanentNode* BookmarkModel::PermanentNode(
 715     BookmarkNode::Type type) {
 716   DCHECK(loaded_);
 717   switch (type) {
 718     case BookmarkNode::BOOKMARK_BAR:
 719       return bookmark_bar_node_;
 720     case BookmarkNode::OTHER_NODE:
 721       return other_node_;
 722     case BookmarkNode::MOBILE:
 723       return mobile_node_;
 724     default:
 725       NOTREACHED();
 726       return NULL;
 727   }
 728 }
 729
 730 bool BookmarkModel::IsBookmarkedNoLock(const GURL& url) {
 731   BookmarkNode tmp_node(url);
 732   return (nodes_ordered_by_url_set_.find(&tmp_node) !=
 733           nodes_ordered_by_url_set_.end());
 734 }
 735
 736 void BookmarkModel::RemoveNode(BookmarkNode* node,
 737                                std::set<GURL>* removed_urls) {
 738   if (!loaded_ || !node || is_permanent_node(node)) {
 739     NOTREACHED();
 740     return;
 741   }
 742
 743   url_lock_.AssertAcquired();
 744   if (node->is_url()) {
 745     RemoveNodeFromInternalMaps(node);
 746     removed_urls->insert(node->url());
 747   }
 748
 749   CancelPendingFaviconLoadRequests(node);
 750
 751   // Recurse through children.
 752   for (int i = node->child_count() - 1; i >= 0; --i)
 753     RemoveNode(node->GetChild(i), removed_urls);
 754 }
 755
 756 void BookmarkModel::DoneLoading(scoped_ptr<BookmarkLoadDetails> details) {
 757   DCHECK(details);
 758   if (loaded_) {
 759     // We should only ever be loaded once.
 760     NOTREACHED();
 761     return;
 762   }
 763
 764   next_node_id_ = details->max_id();
 765   if (details->computed_checksum() != details->stored_checksum() ||
 766       details->ids_reassigned()) {
 767     // If bookmarks file changed externally, the IDs may have changed
 768     // externally. In that case, the decoder may have reassigned IDs to make
 769     // them unique. So when the file has changed externally, we should save the
 770     // bookmarks file to persist new IDs.
 771     if (store_.get())
 772       store_->ScheduleSave();
 773   }
 774   bookmark_bar_node_ = details->release_bb_node();
 775   other_node_ = details->release_other_folder_node();
 776   mobile_node_ = details->release_mobile_folder_node();
 777   index_.reset(details->release_index());
 778
 779   // Get any extra nodes and take ownership of them at the |root_|.
 780   std::vector<BookmarkPermanentNode*> extra_nodes;
 781   details->release_extra_nodes(&extra_nodes);
 782
 783   // WARNING: order is important here, various places assume the order is
 784   // constant (but can vary between embedders with the initial visibility
 785   // of permanent nodes).
 786   std::vector<BookmarkPermanentNode*> root_children;
 787   root_children.push_back(bookmark_bar_node_);
 788   root_children.push_back(other_node_);
 789   root_children.push_back(mobile_node_);
 790   for (size_t i = 0; i < extra_nodes.size(); ++i)
 791     root_children.push_back(extra_nodes[i]);
 792   std::stable_sort(root_children.begin(),
 793                    root_children.end(),
 794                    VisibilityComparator(client_));
 795   for (size_t i = 0; i < root_children.size(); ++i)
 796     root_.Add(root_children[i], static_cast<int>(i));
 797
 798   root_.SetMetaInfoMap(details->model_meta_info_map());
 799   root_.set_sync_transaction_version(details->model_sync_transaction_version());
 800
 801   {
 802     base::AutoLock url_lock(url_lock_);
 803     // Update nodes_ordered_by_url_set_ from the nodes.
 804     PopulateNodesByURL(&root_);
 805   }
 806
 807   loaded_ = true;
 808
 809   loaded_signal_.Signal();
 810
 811   // Notify our direct observers.
 812   FOR_EACH_OBSERVER(BookmarkModelObserver, observers_,
 813                     BookmarkModelLoaded(this, details->ids_reassigned()));
 814 }
 815
 816 void BookmarkModel::RemoveAndDeleteNode(BookmarkNode* delete_me) {
 817   scoped_ptr<BookmarkNode> node(delete_me);
 818
 819   const BookmarkNode* parent = node->parent();
 820   DCHECK(parent);
 821   int index = parent->GetIndexOf(node.get());
 822
 823   FOR_EACH_OBSERVER(BookmarkModelObserver, observers_,
 824                     OnWillRemoveBookmarks(this, parent, index, node.get()));
 825
 826   std::set<GURL> removed_urls;
 827   {
 828     base::AutoLock url_lock(url_lock_);
 829     RemoveNodeAndGetRemovedUrls(node.get(), &removed_urls);
 830   }
 831
 832   if (store_.get())
 833     store_->ScheduleSave();
 834
 835   FOR_EACH_OBSERVER(
 836       BookmarkModelObserver,
 837       observers_,
 838       BookmarkNodeRemoved(this, parent, index, node.get(), removed_urls));
 839 }
 840
 841 void BookmarkModel::RemoveNodeFromInternalMaps(BookmarkNode* node) {
 842   index_->Remove(node);
 843   // NOTE: this is called in such a way that url_lock_ is already held. As
 844   // such, this doesn't explicitly grab the lock.
 845   url_lock_.AssertAcquired();
 846   NodesOrderedByURLSet::iterator i = nodes_ordered_by_url_set_.find(node);
 847   DCHECK(i != nodes_ordered_by_url_set_.end());
 848   // i points to the first node with the URL, advance until we find the
 849   // node we're removing.
 850   while (*i != node)
 851     ++i;
 852   nodes_ordered_by_url_set_.erase(i);
 853 }
 854
 855 void BookmarkModel::RemoveNodeAndGetRemovedUrls(BookmarkNode* node,
 856                                                 std::set<GURL>* removed_urls) {
 857   // NOTE: this method should be always called with |url_lock_| held.
 858   // This method does not explicitly acquires a lock.
 859   url_lock_.AssertAcquired();
 860   DCHECK(removed_urls);
 861   BookmarkNode* parent = AsMutable(node->parent());
 862   DCHECK(parent);
 863   parent->Remove(node);
 864   RemoveNode(node, removed_urls);
 865   // RemoveNode adds an entry to removed_urls for each node of type URL. As we
 866   // allow duplicates we need to remove any entries that are still bookmarked.
 867   for (std::set<GURL>::iterator i = removed_urls->begin();
 868        i != removed_urls->end();) {
 869     if (IsBookmarkedNoLock(*i)) {
 870       // When we erase the iterator pointing at the erasee is
 871       // invalidated, so using i++ here within the "erase" call is
 872       // important as it advances the iterator before passing the
 873       // old value through to erase.
 874       removed_urls->erase(i++);
 875     } else {
 876       ++i;
 877     }
 878   }
 879 }
 880
 881 BookmarkNode* BookmarkModel::AddNode(BookmarkNode* parent,
 882                                      int index,
 883                                      BookmarkNode* node) {
 884   parent->Add(node, index);
 885
 886   if (store_.get())
 887     store_->ScheduleSave();
 888
 889   if (node->type() == BookmarkNode::URL) {
 890     base::AutoLock url_lock(url_lock_);
 891     AddNodeToInternalMaps(node);
 892   } else {
 893     index_->Add(node);
 894   }
 895
 896   FOR_EACH_OBSERVER(BookmarkModelObserver, observers_,
 897                     BookmarkNodeAdded(this, parent, index));
 898
 899   return node;
 900 }
 901
 902 void BookmarkModel::AddNodeToInternalMaps(BookmarkNode* node) {
 903   index_->Add(node);
 904   url_lock_.AssertAcquired();
 905   nodes_ordered_by_url_set_.insert(node);
 906 }
 907
 908 bool BookmarkModel::IsValidIndex(const BookmarkNode* parent,
 909                                  int index,
 910                                  bool allow_end) {
 911   return (parent && parent->is_folder() &&
 912           (index >= 0 && (index < parent->child_count() ||
 913                           (allow_end && index == parent->child_count()))));
 914 }
 915
 916 BookmarkPermanentNode* BookmarkModel::CreatePermanentNode(
 917     BookmarkNode::Type type) {
 918   DCHECK(type == BookmarkNode::BOOKMARK_BAR ||
 919          type == BookmarkNode::OTHER_NODE ||
 920          type == BookmarkNode::MOBILE);
 921   BookmarkPermanentNode* node =
 922       new BookmarkPermanentNode(generate_next_node_id());
 923   node->set_type(type);
 924   node->set_visible(client_->IsPermanentNodeVisible(node));
 925
 926   int title_id;
 927   switch (type) {
 928     case BookmarkNode::BOOKMARK_BAR:
 929       title_id = IDS_BOOKMARK_BAR_FOLDER_NAME;
 930       break;
 931     case BookmarkNode::OTHER_NODE:
 932       title_id = IDS_BOOKMARK_BAR_OTHER_FOLDER_NAME;
 933       break;
 934     case BookmarkNode::MOBILE:
 935       title_id = IDS_BOOKMARK_BAR_MOBILE_FOLDER_NAME;
 936       break;
 937     default:
 938       NOTREACHED();
 939       title_id = IDS_BOOKMARK_BAR_FOLDER_NAME;
 940       break;
 941   }
 942   node->SetTitle(l10n_util::GetStringUTF16(title_id));
 943   return node;
 944 }
 945
 946 void BookmarkModel::OnFaviconDataAvailable(
 947     BookmarkNode* node,
 948     favicon_base::IconType icon_type,
 949     const favicon_base::FaviconImageResult& image_result) {
 950   DCHECK(node);
 951   node->set_favicon_load_task_id(base::CancelableTaskTracker::kBadTaskId);
 952   node->set_favicon_state(BookmarkNode::LOADED_FAVICON);
 953   if (!image_result.image.IsEmpty()) {
 954     node->set_favicon_type(icon_type);
 955     node->set_favicon(image_result.image);
 956     node->set_icon_url(image_result.icon_url);
 957     FaviconLoaded(node);
 958   } else if (icon_type == favicon_base::TOUCH_ICON) {
 959     // Couldn't load the touch icon, fallback to the regular favicon.
 960     DCHECK(client_->PreferTouchIcon());
 961     LoadFavicon(node, favicon_base::FAVICON);
 962   }
 963 }
 964
 965 void BookmarkModel::LoadFavicon(
 966     BookmarkNode* node,
 967     favicon_base::IconType icon_type) {
 968   if (node->is_folder())
 969     return;
 970
 971   DCHECK(node->url().is_valid());
 972   node->set_favicon_state(BookmarkNode::LOADING_FAVICON);
 973   base::CancelableTaskTracker::TaskId taskId =
 974       client_->GetFaviconImageForPageURL(
 975           node->url(),
 976           icon_type,
 977           base::Bind(
 978               &BookmarkModel::OnFaviconDataAvailable,
 979               base::Unretained(this),
 980               node,
 981               icon_type),
 982           &cancelable_task_tracker_);
 983   if (taskId != base::CancelableTaskTracker::kBadTaskId)
 984     node->set_favicon_load_task_id(taskId);
 985 }
 986
 987 void BookmarkModel::FaviconLoaded(const BookmarkNode* node) {
 988   FOR_EACH_OBSERVER(BookmarkModelObserver, observers_,
 989                     BookmarkNodeFaviconChanged(this, node));
 990 }
 991
 992 void BookmarkModel::CancelPendingFaviconLoadRequests(BookmarkNode* node) {
 993   if (node->favicon_load_task_id() != base::CancelableTaskTracker::kBadTaskId) {
 994     cancelable_task_tracker_.TryCancel(node->favicon_load_task_id());
 995     node->set_favicon_load_task_id(base::CancelableTaskTracker::kBadTaskId);
 996   }
 997 }
 998
 999 void BookmarkModel::PopulateNodesByURL(BookmarkNode* node) {
1000   // NOTE: this is called with url_lock_ already held. As such, this doesn't
1001   // explicitly grab the lock.
1002   if (node->is_url())
1003     nodes_ordered_by_url_set_.insert(node);
1004   for (int i = 0; i < node->child_count(); ++i)
1005     PopulateNodesByURL(node->GetChild(i));
1006 }
1007
1008 int64 BookmarkModel::generate_next_node_id() {
1009   return next_node_id_++;
1010 }
1011
1012 scoped_ptr<BookmarkLoadDetails> BookmarkModel::CreateLoadDetails(
1013     const std::string& accept_languages) {
1014   BookmarkPermanentNode* bb_node =
1015       CreatePermanentNode(BookmarkNode::BOOKMARK_BAR);
1016   BookmarkPermanentNode* other_node =
1017       CreatePermanentNode(BookmarkNode::OTHER_NODE);
1018   BookmarkPermanentNode* mobile_node =
1019       CreatePermanentNode(BookmarkNode::MOBILE);
1020   return scoped_ptr<BookmarkLoadDetails>(new BookmarkLoadDetails(
1021       bb_node,
1022       other_node,
1023       mobile_node,
1024       client_->GetLoadExtraNodesCallback(),
1025       new BookmarkIndex(client_, accept_languages),
1026       next_node_id_));
1027 }