OLD | NEW |
1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "chrome/browser/extensions/api/bookmarks/bookmark_api_helpers.h" | 5 #include "chrome/browser/extensions/api/bookmarks/bookmark_api_helpers.h" |
6 | 6 |
7 #include <math.h> // For floor() | 7 #include <math.h> // For floor() |
8 #include <vector> | 8 #include <vector> |
9 | 9 |
10 #include "base/strings/string_number_conversions.h" | 10 #include "base/strings/string_number_conversions.h" |
11 #include "base/strings/utf_string_conversions.h" | 11 #include "base/strings/utf_string_conversions.h" |
12 #include "chrome/browser/bookmarks/chrome_bookmark_client.h" | |
13 #include "chrome/browser/extensions/api/bookmarks/bookmark_api_constants.h" | 12 #include "chrome/browser/extensions/api/bookmarks/bookmark_api_constants.h" |
14 #include "chrome/common/extensions/api/bookmarks.h" | 13 #include "chrome/common/extensions/api/bookmarks.h" |
15 #include "components/bookmarks/browser/bookmark_model.h" | 14 #include "components/bookmarks/browser/bookmark_model.h" |
16 #include "components/bookmarks/browser/bookmark_utils.h" | 15 #include "components/bookmarks/browser/bookmark_utils.h" |
| 16 #include "components/bookmarks/managed/managed_bookmark_service.h" |
17 | 17 |
18 using bookmarks::BookmarkModel; | 18 using bookmarks::BookmarkModel; |
19 using bookmarks::BookmarkNode; | 19 using bookmarks::BookmarkNode; |
20 | 20 |
21 namespace extensions { | 21 namespace extensions { |
22 | 22 |
23 namespace keys = bookmark_api_constants; | 23 namespace keys = bookmark_api_constants; |
24 using api::bookmarks::BookmarkTreeNode; | 24 using api::bookmarks::BookmarkTreeNode; |
25 | 25 |
26 namespace bookmark_api_helpers { | 26 namespace bookmark_api_helpers { |
27 | 27 |
28 namespace { | 28 namespace { |
29 | 29 |
30 void AddNodeHelper(ChromeBookmarkClient* client, | 30 void AddNodeHelper(bookmarks::ManagedBookmarkService* managed, |
31 const BookmarkNode* node, | 31 const BookmarkNode* node, |
32 std::vector<linked_ptr<BookmarkTreeNode> >* nodes, | 32 std::vector<linked_ptr<BookmarkTreeNode>>* nodes, |
33 bool recurse, | 33 bool recurse, |
34 bool only_folders) { | 34 bool only_folders) { |
35 if (node->IsVisible()) { | 35 if (node->IsVisible()) { |
36 linked_ptr<BookmarkTreeNode> new_node(GetBookmarkTreeNode(client, | 36 linked_ptr<BookmarkTreeNode> new_node( |
37 node, | 37 GetBookmarkTreeNode(managed, node, recurse, only_folders)); |
38 recurse, | |
39 only_folders)); | |
40 nodes->push_back(new_node); | 38 nodes->push_back(new_node); |
41 } | 39 } |
42 } | 40 } |
43 | 41 |
44 } // namespace | 42 } // namespace |
45 | 43 |
46 BookmarkTreeNode* GetBookmarkTreeNode(ChromeBookmarkClient* client, | 44 BookmarkTreeNode* GetBookmarkTreeNode( |
47 const BookmarkNode* node, | 45 bookmarks::ManagedBookmarkService* managed, |
48 bool recurse, | 46 const BookmarkNode* node, |
49 bool only_folders) { | 47 bool recurse, |
| 48 bool only_folders) { |
50 BookmarkTreeNode* bookmark_tree_node = new BookmarkTreeNode; | 49 BookmarkTreeNode* bookmark_tree_node = new BookmarkTreeNode; |
51 | 50 |
52 bookmark_tree_node->id = base::Int64ToString(node->id()); | 51 bookmark_tree_node->id = base::Int64ToString(node->id()); |
53 | 52 |
54 const BookmarkNode* parent = node->parent(); | 53 const BookmarkNode* parent = node->parent(); |
55 if (parent) { | 54 if (parent) { |
56 bookmark_tree_node->parent_id.reset(new std::string( | 55 bookmark_tree_node->parent_id.reset(new std::string( |
57 base::Int64ToString(parent->id()))); | 56 base::Int64ToString(parent->id()))); |
58 bookmark_tree_node->index.reset(new int(parent->GetIndexOf(node))); | 57 bookmark_tree_node->index.reset(new int(parent->GetIndexOf(node))); |
59 } | 58 } |
60 | 59 |
61 if (!node->is_folder()) { | 60 if (!node->is_folder()) { |
62 bookmark_tree_node->url.reset(new std::string(node->url().spec())); | 61 bookmark_tree_node->url.reset(new std::string(node->url().spec())); |
63 } else { | 62 } else { |
64 // Javascript Date wants milliseconds since the epoch, ToDoubleT is seconds. | 63 // Javascript Date wants milliseconds since the epoch, ToDoubleT is seconds. |
65 base::Time t = node->date_folder_modified(); | 64 base::Time t = node->date_folder_modified(); |
66 if (!t.is_null()) { | 65 if (!t.is_null()) { |
67 bookmark_tree_node->date_group_modified.reset( | 66 bookmark_tree_node->date_group_modified.reset( |
68 new double(floor(t.ToDoubleT() * 1000))); | 67 new double(floor(t.ToDoubleT() * 1000))); |
69 } | 68 } |
70 } | 69 } |
71 | 70 |
72 bookmark_tree_node->title = base::UTF16ToUTF8(node->GetTitle()); | 71 bookmark_tree_node->title = base::UTF16ToUTF8(node->GetTitle()); |
73 if (!node->date_added().is_null()) { | 72 if (!node->date_added().is_null()) { |
74 // Javascript Date wants milliseconds since the epoch, ToDoubleT is seconds. | 73 // Javascript Date wants milliseconds since the epoch, ToDoubleT is seconds. |
75 bookmark_tree_node->date_added.reset( | 74 bookmark_tree_node->date_added.reset( |
76 new double(floor(node->date_added().ToDoubleT() * 1000))); | 75 new double(floor(node->date_added().ToDoubleT() * 1000))); |
77 } | 76 } |
78 | 77 |
79 if (bookmarks::IsDescendantOf(node, client->managed_node()) || | 78 if (bookmarks::IsDescendantOf(node, managed->managed_node()) || |
80 bookmarks::IsDescendantOf(node, client->supervised_node())) { | 79 bookmarks::IsDescendantOf(node, managed->supervised_node())) { |
81 bookmark_tree_node->unmodifiable = | 80 bookmark_tree_node->unmodifiable = |
82 api::bookmarks::BOOKMARK_TREE_NODE_UNMODIFIABLE_MANAGED; | 81 api::bookmarks::BOOKMARK_TREE_NODE_UNMODIFIABLE_MANAGED; |
83 } | 82 } |
84 | 83 |
85 if (recurse && node->is_folder()) { | 84 if (recurse && node->is_folder()) { |
86 std::vector<linked_ptr<BookmarkTreeNode> > children; | 85 std::vector<linked_ptr<BookmarkTreeNode>> children; |
87 for (int i = 0; i < node->child_count(); ++i) { | 86 for (int i = 0; i < node->child_count(); ++i) { |
88 const BookmarkNode* child = node->GetChild(i); | 87 const BookmarkNode* child = node->GetChild(i); |
89 if (child->IsVisible() && (!only_folders || child->is_folder())) { | 88 if (child->IsVisible() && (!only_folders || child->is_folder())) { |
90 linked_ptr<BookmarkTreeNode> child_node( | 89 linked_ptr<BookmarkTreeNode> child_node( |
91 GetBookmarkTreeNode(client, child, true, only_folders)); | 90 GetBookmarkTreeNode(managed, child, true, only_folders)); |
92 children.push_back(child_node); | 91 children.push_back(child_node); |
93 } | 92 } |
94 } | 93 } |
95 bookmark_tree_node->children.reset( | 94 bookmark_tree_node->children.reset( |
96 new std::vector<linked_ptr<BookmarkTreeNode> >(children)); | 95 new std::vector<linked_ptr<BookmarkTreeNode>>(children)); |
97 } | 96 } |
98 return bookmark_tree_node; | 97 return bookmark_tree_node; |
99 } | 98 } |
100 | 99 |
101 void AddNode(ChromeBookmarkClient* client, | 100 void AddNode(bookmarks::ManagedBookmarkService* managed, |
102 const BookmarkNode* node, | 101 const BookmarkNode* node, |
103 std::vector<linked_ptr<BookmarkTreeNode> >* nodes, | 102 std::vector<linked_ptr<BookmarkTreeNode>>* nodes, |
104 bool recurse) { | 103 bool recurse) { |
105 return AddNodeHelper(client, node, nodes, recurse, false); | 104 return AddNodeHelper(managed, node, nodes, recurse, false); |
106 } | 105 } |
107 | 106 |
108 void AddNodeFoldersOnly(ChromeBookmarkClient* client, | 107 void AddNodeFoldersOnly(bookmarks::ManagedBookmarkService* managed, |
109 const BookmarkNode* node, | 108 const BookmarkNode* node, |
110 std::vector<linked_ptr<BookmarkTreeNode> >* nodes, | 109 std::vector<linked_ptr<BookmarkTreeNode>>* nodes, |
111 bool recurse) { | 110 bool recurse) { |
112 return AddNodeHelper(client, node, nodes, recurse, true); | 111 return AddNodeHelper(managed, node, nodes, recurse, true); |
113 } | 112 } |
114 | 113 |
115 bool RemoveNode(BookmarkModel* model, | 114 bool RemoveNode(BookmarkModel* model, |
116 ChromeBookmarkClient* client, | 115 bookmarks::ManagedBookmarkService* managed, |
117 int64 id, | 116 int64 id, |
118 bool recursive, | 117 bool recursive, |
119 std::string* error) { | 118 std::string* error) { |
120 const BookmarkNode* node = bookmarks::GetBookmarkNodeByID(model, id); | 119 const BookmarkNode* node = bookmarks::GetBookmarkNodeByID(model, id); |
121 if (!node) { | 120 if (!node) { |
122 *error = keys::kNoNodeError; | 121 *error = keys::kNoNodeError; |
123 return false; | 122 return false; |
124 } | 123 } |
125 if (model->is_permanent_node(node)) { | 124 if (model->is_permanent_node(node)) { |
126 *error = keys::kModifySpecialError; | 125 *error = keys::kModifySpecialError; |
127 return false; | 126 return false; |
128 } | 127 } |
129 if (bookmarks::IsDescendantOf(node, client->managed_node()) || | 128 if (bookmarks::IsDescendantOf(node, managed->managed_node()) || |
130 bookmarks::IsDescendantOf(node, client->supervised_node())) { | 129 bookmarks::IsDescendantOf(node, managed->supervised_node())) { |
131 *error = keys::kModifyManagedError; | 130 *error = keys::kModifyManagedError; |
132 return false; | 131 return false; |
133 } | 132 } |
134 if (node->is_folder() && !node->empty() && !recursive) { | 133 if (node->is_folder() && !node->empty() && !recursive) { |
135 *error = keys::kFolderNotEmptyError; | 134 *error = keys::kFolderNotEmptyError; |
136 return false; | 135 return false; |
137 } | 136 } |
138 | 137 |
139 model->Remove(node); | 138 model->Remove(node); |
140 return true; | 139 return true; |
(...skipping 16 matching lines...) Expand all Loading... |
157 | 156 |
158 if (node.is_folder()) { | 157 if (node.is_folder()) { |
159 for (int i = 0; i < node.child_count(); ++i) { | 158 for (int i = 0; i < node.child_count(); ++i) { |
160 GetMetaInfo(*(node.GetChild(i)), id_to_meta_info_map); | 159 GetMetaInfo(*(node.GetChild(i)), id_to_meta_info_map); |
161 } | 160 } |
162 } | 161 } |
163 } | 162 } |
164 | 163 |
165 } // namespace bookmark_api_helpers | 164 } // namespace bookmark_api_helpers |
166 } // namespace extensions | 165 } // namespace extensions |
OLD | NEW |