1 // Copyright 2013 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.
5 #include "chrome/browser/bookmarks/bookmark_test_helpers.h"
7 #include "base/basictypes.h"
8 #include "base/callback.h"
9 #include "base/compiler_specific.h"
10 #include "base/logging.h"
11 #include "base/run_loop.h"
12 #include "base/strings/utf_string_conversions.h"
13 #include "chrome/browser/bookmarks/base_bookmark_model_observer.h"
14 #include "chrome/browser/bookmarks/bookmark_model.h"
15 #include "chrome/browser/bookmarks/bookmark_model_factory.h"
16 #include "content/public/test/test_utils.h"
21 // BookmarkLoadObserver is used when blocking until the BookmarkModel finishes
22 // loading. As soon as the BookmarkModel finishes loading the message loop is
24 class BookmarkLoadObserver : public BaseBookmarkModelObserver {
26 explicit BookmarkLoadObserver(const base::Closure& quit_task);
27 virtual ~BookmarkLoadObserver();
30 // BaseBookmarkModelObserver:
31 virtual void BookmarkModelChanged() OVERRIDE;
32 virtual void BookmarkModelLoaded(BookmarkModel* model,
33 bool ids_reassigned) OVERRIDE;
35 base::Closure quit_task_;
37 DISALLOW_COPY_AND_ASSIGN(BookmarkLoadObserver);
40 BookmarkLoadObserver::BookmarkLoadObserver(const base::Closure& quit_task)
41 : quit_task_(quit_task) {}
43 BookmarkLoadObserver::~BookmarkLoadObserver() {}
45 void BookmarkLoadObserver::BookmarkModelChanged() {}
47 void BookmarkLoadObserver::BookmarkModelLoaded(BookmarkModel* model,
48 bool ids_reassigned) {
52 // Helper function which does the actual work of creating the nodes for
53 // a particular level in the hierarchy.
54 std::string::size_type AddNodesFromString(BookmarkModel* model,
55 const BookmarkNode* node,
56 const std::string& model_string,
57 std::string::size_type start_pos) {
59 int index = node->child_count();
60 static const std::string folder_tell(":[");
61 std::string::size_type end_pos = model_string.find(' ', start_pos);
62 while (end_pos != std::string::npos) {
63 std::string::size_type part_length = end_pos - start_pos;
64 std::string node_name = model_string.substr(start_pos, part_length);
65 // Are we at the end of a folder group?
66 if (node_name != "]") {
67 // No, is it a folder?
70 tell = node_name.substr(part_length - 2, 2);
71 if (tell == folder_tell) {
72 node_name = node_name.substr(0, part_length - 2);
73 const BookmarkNode* new_node =
74 model->AddFolder(node, index, base::UTF8ToUTF16(node_name));
75 end_pos = AddNodesFromString(model, new_node, model_string,
78 std::string url_string("http://");
79 url_string += std::string(node_name.begin(), node_name.end());
82 node, index, base::UTF8ToUTF16(node_name), GURL(url_string));
87 end_pos = model_string.find(' ', start_pos);
100 void WaitForBookmarkModelToLoad(BookmarkModel* model) {
103 base::RunLoop run_loop;
104 BookmarkLoadObserver observer(content::GetQuitTaskForRunLoop(&run_loop));
105 model->AddObserver(&observer);
106 content::RunThisRunLoop(&run_loop);
107 model->RemoveObserver(&observer);
108 DCHECK(model->loaded());
111 void WaitForBookmarkModelToLoad(Profile* profile) {
112 WaitForBookmarkModelToLoad(BookmarkModelFactory::GetForProfile(profile));
115 std::string ModelStringFromNode(const BookmarkNode* node) {
116 // Since the children of the node are not available as a vector,
117 // we'll just have to do it the hard way.
118 int child_count = node->child_count();
119 std::string child_string;
120 for (int i = 0; i < child_count; ++i) {
121 const BookmarkNode* child = node->GetChild(i);
122 if (child->is_folder()) {
123 child_string += base::UTF16ToUTF8(child->GetTitle()) + ":[ " +
124 ModelStringFromNode(child) + "] ";
126 child_string += base::UTF16ToUTF8(child->GetTitle()) + " ";
132 void AddNodesFromModelString(BookmarkModel* model,
133 const BookmarkNode* node,
134 const std::string& model_string) {
136 std::string::size_type start_pos = 0;
137 std::string::size_type end_pos =
138 AddNodesFromString(model, node, model_string, start_pos);
139 DCHECK(end_pos == std::string::npos);