Adds back BookmarkNode::IsVisible. Turns out we want to conditionally

chrome/browser/bookmarks/recently_used_folders_combo_model.cc

 // Copyright (c) 2011 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/bookmarks/recently_used_folders_combo_model.h"
 
 #include "chrome/browser/bookmarks/bookmark_utils.h"
 #include "grit/generated_resources.h"
 #include "ui/base/l10n/l10n_util.h"
 
@@ skipping 25 matching lines @@
   if (!model->is_permanent_node(node->parent()))
     nodes_.insert(nodes_.begin(), node->parent());
 
   // Make sure we only have kMaxMRUFolders in the first chunk.
   if (nodes_.size() > kMaxMRUFolders)
     nodes_.erase(nodes_.begin() + kMaxMRUFolders, nodes_.end());
 
   // And put the bookmark bar and other nodes at the end of the list.
   nodes_.push_back(model->bookmark_bar_node());
   nodes_.push_back(model->other_node());
-  nodes_.push_back(model->mobile_node());
+  if (model->mobile_node()->IsVisible())
+    nodes_.push_back(model->mobile_node());
 
   std::vector<const BookmarkNode*>::iterator it = std::find(nodes_.begin(),
                                                             nodes_.end(),
                                                             node->parent());
   node_parent_index_ = static_cast<int>(it - nodes_.begin());
 }
 
 RecentlyUsedFoldersComboModel::~RecentlyUsedFoldersComboModel() {}
 
 int RecentlyUsedFoldersComboModel::GetItemCount() {
@@ skipping 13 matching lines @@
   return nodes_[index];
 }
 
 void RecentlyUsedFoldersComboModel::RemoveNode(const BookmarkNode* node) {
   std::vector<const BookmarkNode*>::iterator it = std::find(nodes_.begin(),
                                                             nodes_.end(),
                                                             node);
   if (it != nodes_.end())
     nodes_.erase(it);
 }