Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(467)

Side by Side Diff: mojo/services/view_manager/view_manager_connection.cc

Issue 288313002: Tweaks to ViewManager: (Closed) Base URL: svn://svn.chromium.org/chrome/trunk/src
Patch Set: cleanup Created 6 years, 7 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
OLDNEW
1 // Copyright 2014 The Chromium Authors. All rights reserved. 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 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 "mojo/services/view_manager/view_manager_connection.h" 5 #include "mojo/services/view_manager/view_manager_connection.h"
6 6
7 #include "base/stl_util.h" 7 #include "base/stl_util.h"
8 #include "mojo/public/cpp/bindings/allocation_scope.h" 8 #include "mojo/public/cpp/bindings/allocation_scope.h"
9 #include "mojo/services/view_manager/node.h" 9 #include "mojo/services/view_manager/node.h"
10 #include "mojo/services/view_manager/root_node_manager.h" 10 #include "mojo/services/view_manager/root_node_manager.h"
11 #include "mojo/services/view_manager/type_converters.h"
11 #include "mojo/services/view_manager/view.h" 12 #include "mojo/services/view_manager/view.h"
12 #include "third_party/skia/include/core/SkBitmap.h" 13 #include "third_party/skia/include/core/SkBitmap.h"
13 #include "ui/aura/window.h" 14 #include "ui/aura/window.h"
14 #include "ui/gfx/codec/png_codec.h" 15 #include "ui/gfx/codec/png_codec.h"
15 16
16 namespace mojo { 17 namespace mojo {
17 namespace view_manager { 18 namespace view_manager {
18 namespace service { 19 namespace service {
19 namespace { 20 namespace {
20 21
21 // Implementation of NodeCount(). |count| is the current count. 22 // Places |node| in |nodes| and recurses through the children.
22 void NodeCountImpl(Node* node, size_t* count) { 23 void GetDescendants(Node* node, std::vector<Node*>* nodes) {
23 (*count)++;
24 std::vector<Node*> children(node->GetChildren());
25 for (size_t i = 0 ; i < children.size(); ++i)
26 NodeCountImpl(children[i], count);
27 }
28
29 // Returns the number of descendants of |node|.
30 size_t NodeCount(Node* node) {
31 size_t count = 0;
32 if (node)
33 NodeCountImpl(node, &count);
34 return count;
35 }
36
37 // Converts a Node to an INode, putting the result at |index| in
38 // |array_builder|. This then recurses through the children.
39 void NodeToINode(Node* node,
40 Array<INode>::Builder* array_builder,
41 size_t* index) {
42 if (!node) 24 if (!node)
43 return; 25 return;
44 26
45 INode::Builder builder; 27 nodes->push_back(node);
46 Node* parent = node->GetParent();
47 builder.set_parent_id(NodeIdToTransportId(parent ? parent->id() : NodeId()));
48 builder.set_node_id(NodeIdToTransportId(node->id()));
49 builder.set_view_id(ViewIdToTransportId(
50 node->view() ? node->view()->id() : ViewId()));
51 (*array_builder)[*index] = builder.Finish();
52 28
53 std::vector<Node*> children(node->GetChildren()); 29 std::vector<Node*> children(node->GetChildren());
54 for (size_t i = 0 ; i < children.size(); ++i) { 30 for (size_t i = 0 ; i < children.size(); ++i)
55 (*index)++; 31 GetDescendants(children[i], nodes);
56 NodeToINode(children[i], array_builder, index);
57 }
58 } 32 }
59 33
60 } // namespace 34 } // namespace
61 35
62 ViewManagerConnection::ViewManagerConnection() : id_(0) { 36 ViewManagerConnection::ViewManagerConnection() : id_(0) {
63 } 37 }
64 38
65 ViewManagerConnection::~ViewManagerConnection() { 39 ViewManagerConnection::~ViewManagerConnection() {
66 // Delete any views we own. 40 // Delete any views we own.
67 while (!view_map_.empty()) { 41 while (!view_map_.empty()) {
(...skipping 10 matching lines...) Expand all
78 } 52 }
79 53
80 STLDeleteContainerPairSecondPointers(node_map_.begin(), node_map_.end()); 54 STLDeleteContainerPairSecondPointers(node_map_.begin(), node_map_.end());
81 context()->RemoveConnection(this); 55 context()->RemoveConnection(this);
82 } 56 }
83 57
84 void ViewManagerConnection::Initialize() { 58 void ViewManagerConnection::Initialize() {
85 DCHECK_EQ(0, id_); // Should only get Initialize() once. 59 DCHECK_EQ(0, id_); // Should only get Initialize() once.
86 id_ = context()->GetAndAdvanceNextConnectionId(); 60 id_ = context()->GetAndAdvanceNextConnectionId();
87 context()->AddConnection(this); 61 context()->AddConnection(this);
88 client()->OnConnectionEstablished(id_, context()->next_server_change_id()); 62 std::vector<Node*> to_send;
63 GetUnknownNodesFrom(context()->root(), &to_send);
64 AllocationScope allocation_scope;
65 client()->OnConnectionEstablished(id_,
66 context()->next_server_change_id(),
67 Array<INode>::From(to_send));
89 } 68 }
90 69
91 Node* ViewManagerConnection::GetNode(const NodeId& id) { 70 Node* ViewManagerConnection::GetNode(const NodeId& id) {
92 if (id_ == id.connection_id) { 71 if (id_ == id.connection_id) {
93 NodeMap::iterator i = node_map_.find(id.node_id); 72 NodeMap::iterator i = node_map_.find(id.node_id);
94 return i == node_map_.end() ? NULL : i->second; 73 return i == node_map_.end() ? NULL : i->second;
95 } 74 }
96 return context()->GetNode(id); 75 return context()->GetNode(id);
97 } 76 }
98 77
99 View* ViewManagerConnection::GetView(const ViewId& id) { 78 View* ViewManagerConnection::GetView(const ViewId& id) {
100 if (id_ == id.connection_id) { 79 if (id_ == id.connection_id) {
101 ViewMap::const_iterator i = view_map_.find(id.view_id); 80 ViewMap::const_iterator i = view_map_.find(id.view_id);
102 return i == view_map_.end() ? NULL : i->second; 81 return i == view_map_.end() ? NULL : i->second;
103 } 82 }
104 return context()->GetView(id); 83 return context()->GetView(id);
105 } 84 }
106 85
107 void ViewManagerConnection::NotifyNodeHierarchyChanged( 86 void ViewManagerConnection::ProcessNodeHierarchyChanged(
108 const NodeId& node, 87 const NodeId& node_id,
109 const NodeId& new_parent, 88 const NodeId& new_parent_id,
110 const NodeId& old_parent, 89 const NodeId& old_parent_id,
111 TransportChangeId server_change_id) { 90 TransportChangeId server_change_id,
112 client()->OnNodeHierarchyChanged(NodeIdToTransportId(node), 91 bool originated_change) {
113 NodeIdToTransportId(new_parent), 92 if (originated_change || context()->is_processing_delete_node())
114 NodeIdToTransportId(old_parent), 93 return;
115 server_change_id); 94 std::vector<Node*> to_send;
95 if (!ShouldNotifyOnHierarchyChange(node_id, new_parent_id, old_parent_id,
96 &to_send)) {
97 if (context()->IsProcessingChange()) {
98 client()->OnServerChangeIdAdvanced(
99 context()->next_server_change_id() + 1);
100 }
101 return;
102 }
103 AllocationScope allocation_scope;
104 client()->OnNodeHierarchyChanged(NodeIdToTransportId(node_id),
105 NodeIdToTransportId(new_parent_id),
106 NodeIdToTransportId(old_parent_id),
107 server_change_id,
108 Array<INode>::From(to_send));
116 } 109 }
117 110
118 void ViewManagerConnection::NotifyNodeViewReplaced( 111 void ViewManagerConnection::ProcessNodeViewReplaced(
119 const NodeId& node, 112 const NodeId& node,
120 const ViewId& new_view_id, 113 const ViewId& new_view_id,
121 const ViewId& old_view_id) { 114 const ViewId& old_view_id,
115 bool originated_change) {
116 if (originated_change)
117 return;
122 client()->OnNodeViewReplaced(NodeIdToTransportId(node), 118 client()->OnNodeViewReplaced(NodeIdToTransportId(node),
123 ViewIdToTransportId(new_view_id), 119 ViewIdToTransportId(new_view_id),
124 ViewIdToTransportId(old_view_id)); 120 ViewIdToTransportId(old_view_id));
125 } 121 }
126 122
127 void ViewManagerConnection::NotifyNodeDeleted( 123 void ViewManagerConnection::ProcessNodeDeleted(
128 const NodeId& node, 124 const NodeId& node,
129 TransportChangeId server_change_id) { 125 TransportChangeId server_change_id,
130 client()->OnNodeDeleted(NodeIdToTransportId(node), server_change_id); 126 bool originated_change) {
127 const bool in_known = known_nodes_.erase(NodeIdToTransportId(node)) > 0;
128
129 if (originated_change)
130 return;
131
132 if (in_known)
133 client()->OnNodeDeleted(NodeIdToTransportId(node), server_change_id);
134 else if (context()->IsProcessingChange())
135 client()->OnServerChangeIdAdvanced(context()->next_server_change_id() + 1);
131 } 136 }
132 137
133 void ViewManagerConnection::NotifyViewDeleted(const ViewId& view) { 138 void ViewManagerConnection::ProcessViewDeleted(const ViewId& view,
139 bool originated_change) {
140 if (originated_change)
141 return;
134 client()->OnViewDeleted(ViewIdToTransportId(view)); 142 client()->OnViewDeleted(ViewIdToTransportId(view));
135 } 143 }
136 144
137 bool ViewManagerConnection::DeleteNodeImpl(ViewManagerConnection* source, 145 bool ViewManagerConnection::DeleteNodeImpl(ViewManagerConnection* source,
138 const NodeId& node_id) { 146 const NodeId& node_id) {
139 DCHECK_EQ(node_id.connection_id, id_); 147 DCHECK_EQ(node_id.connection_id, id_);
140 Node* node = GetNode(node_id); 148 Node* node = GetNode(node_id);
141 if (!node) 149 if (!node)
142 return false; 150 return false;
143 RootNodeManager::ScopedChange change( 151 RootNodeManager::ScopedChange change(
144 source, context(), RootNodeManager::CHANGE_TYPE_ADVANCE_SERVER_CHANGE_ID); 152 source, context(), RootNodeManager::CHANGE_TYPE_ADVANCE_SERVER_CHANGE_ID,
153 true);
145 if (node->GetParent()) 154 if (node->GetParent())
146 node->GetParent()->Remove(node); 155 node->GetParent()->Remove(node);
147 std::vector<Node*> children(node->GetChildren()); 156 std::vector<Node*> children(node->GetChildren());
148 for (size_t i = 0; i < children.size(); ++i) 157 for (size_t i = 0; i < children.size(); ++i)
149 node->Remove(children[i]); 158 node->Remove(children[i]);
150 DCHECK(node->GetChildren().empty()); 159 DCHECK(node->GetChildren().empty());
151 node_map_.erase(node_id.node_id); 160 node_map_.erase(node_id.node_id);
152 delete node; 161 delete node;
153 node = NULL; 162 node = NULL;
154 context()->NotifyNodeDeleted(node_id); 163 context()->ProcessNodeDeleted(node_id);
155 return true; 164 return true;
156 } 165 }
157 166
158 bool ViewManagerConnection::DeleteViewImpl(ViewManagerConnection* source, 167 bool ViewManagerConnection::DeleteViewImpl(ViewManagerConnection* source,
159 const ViewId& view_id) { 168 const ViewId& view_id) {
160 DCHECK_EQ(view_id.connection_id, id_); 169 DCHECK_EQ(view_id.connection_id, id_);
161 View* view = GetView(view_id); 170 View* view = GetView(view_id);
162 if (!view) 171 if (!view)
163 return false; 172 return false;
164 RootNodeManager::ScopedChange change( 173 RootNodeManager::ScopedChange change(
165 source, context(), 174 source, context(),
166 RootNodeManager::CHANGE_TYPE_DONT_ADVANCE_SERVER_CHANGE_ID); 175 RootNodeManager::CHANGE_TYPE_DONT_ADVANCE_SERVER_CHANGE_ID, false);
167 if (view->node()) 176 if (view->node())
168 view->node()->SetView(NULL); 177 view->node()->SetView(NULL);
169 view_map_.erase(view_id.view_id); 178 view_map_.erase(view_id.view_id);
170 // Make a copy of |view_id| as once we delete view |view_id| may no longer be 179 // Make a copy of |view_id| as once we delete view |view_id| may no longer be
171 // valid. 180 // valid.
172 const ViewId view_id_copy(view_id); 181 const ViewId view_id_copy(view_id);
173 delete view; 182 delete view;
174 context()->NotifyViewDeleted(view_id_copy); 183 context()->ProcessViewDeleted(view_id_copy);
175 return true; 184 return true;
176 } 185 }
177 186
178 bool ViewManagerConnection::SetViewImpl(const NodeId& node_id, 187 bool ViewManagerConnection::SetViewImpl(const NodeId& node_id,
179 const ViewId& view_id) { 188 const ViewId& view_id) {
180 Node* node = GetNode(node_id); 189 Node* node = GetNode(node_id);
181 if (!node) 190 if (!node)
182 return false; 191 return false;
183 View* view = GetView(view_id); 192 View* view = GetView(view_id);
184 if (!view && view_id != ViewId()) 193 if (!view && view_id != ViewId())
185 return false; 194 return false;
186 RootNodeManager::ScopedChange change( 195 RootNodeManager::ScopedChange change(
187 this, context(), 196 this, context(),
188 RootNodeManager::CHANGE_TYPE_DONT_ADVANCE_SERVER_CHANGE_ID); 197 RootNodeManager::CHANGE_TYPE_DONT_ADVANCE_SERVER_CHANGE_ID, false);
189 node->SetView(view); 198 node->SetView(view);
190 return true; 199 return true;
191 } 200 }
192 201
202 void ViewManagerConnection::GetUnknownNodesFrom(
203 Node* node,
204 std::vector<Node*>* nodes) {
205 const TransportNodeId transport_id = NodeIdToTransportId(node->id());
206 if (known_nodes_.count(transport_id) == 1)
207 return;
208 nodes->push_back(node);
209 known_nodes_.insert(transport_id);
210 std::vector<Node*> children(node->GetChildren());
211 for (size_t i = 0 ; i < children.size(); ++i)
212 GetUnknownNodesFrom(children[i], nodes);
213 }
214
215 bool ViewManagerConnection::ShouldNotifyOnHierarchyChange(
216 const NodeId& node_id,
217 const NodeId& new_parent_id,
218 const NodeId& old_parent_id,
219 std::vector<Node*>* to_send) {
220 Node* new_parent = GetNode(new_parent_id);
221 if (new_parent) {
222 // On getting a new parent we may need to communicate new nodes to the
223 // client. We do that in the following cases:
224 // . New parent is a descendant of the root. In this case the client already
225 // knows all ancestors, so we only have to communicate descendants of node
226 // the client doesn't know about.
227 // . If the client knew about the parent, we have to do the same.
228 // . If the client knows about the node and is added to a tree the client
229 // doesn't know about we have to communicate from the root down (the
230 // client is learning about a new root).
231 if (context()->root()->Contains(new_parent) ||
232 known_nodes_.count(NodeIdToTransportId(new_parent_id))) {
233 GetUnknownNodesFrom(GetNode(node_id), to_send);
234 return true;
235 }
236 // If parent wasn't known we have to communicate from the root down.
237 if (known_nodes_.count(NodeIdToTransportId(node_id))) {
238 GetUnknownNodesFrom(new_parent->GetRoot(), to_send);
Ben Goodger (Google) 2014/05/15 21:52:29 I think this is too permissive. Go ahead and land,
239 return true;
240 }
241 }
242 // Otherwise only communicate the change if the node was known. We shouldn't
243 // need to communicate any nodes on a remove.
244 return known_nodes_.count(NodeIdToTransportId(node_id));
245 }
246
193 void ViewManagerConnection::CreateNode( 247 void ViewManagerConnection::CreateNode(
194 TransportNodeId transport_node_id, 248 TransportNodeId transport_node_id,
195 const Callback<void(bool)>& callback) { 249 const Callback<void(bool)>& callback) {
196 const NodeId node_id(NodeIdFromTransportId(transport_node_id)); 250 const NodeId node_id(NodeIdFromTransportId(transport_node_id));
197 if (node_id.connection_id != id_ || 251 if (node_id.connection_id != id_ ||
198 node_map_.find(node_id.node_id) != node_map_.end()) { 252 node_map_.find(node_id.node_id) != node_map_.end()) {
199 callback.Run(false); 253 callback.Run(false);
200 return; 254 return;
201 } 255 }
202 node_map_[node_id.node_id] = new Node(this, node_id); 256 node_map_[node_id.node_id] = new Node(this, node_id);
203 callback.Run(true); 257 callback.Run(true);
204 } 258 }
205 259
206 void ViewManagerConnection::DeleteNode( 260 void ViewManagerConnection::DeleteNode(
207 TransportNodeId transport_node_id, 261 TransportNodeId transport_node_id,
208 const Callback<void(bool)>& callback) { 262 const Callback<void(bool)>& callback) {
263 AllocationScope allocation_scope;
209 const NodeId node_id(NodeIdFromTransportId(transport_node_id)); 264 const NodeId node_id(NodeIdFromTransportId(transport_node_id));
210 ViewManagerConnection* connection = context()->GetConnection( 265 ViewManagerConnection* connection = context()->GetConnection(
211 node_id.connection_id); 266 node_id.connection_id);
212 callback.Run(connection && 267 callback.Run(connection &&
213 connection->DeleteNodeImpl(this, node_id)); 268 connection->DeleteNodeImpl(this, node_id));
214 } 269 }
215 270
216 void ViewManagerConnection::AddNode( 271 void ViewManagerConnection::AddNode(
217 TransportNodeId parent_id, 272 TransportNodeId parent_id,
218 TransportNodeId child_id, 273 TransportNodeId child_id,
219 TransportChangeId server_change_id, 274 TransportChangeId server_change_id,
220 const Callback<void(bool)>& callback) { 275 const Callback<void(bool)>& callback) {
221 bool success = false; 276 bool success = false;
222 if (server_change_id == context()->next_server_change_id()) { 277 if (server_change_id == context()->next_server_change_id()) {
223 Node* parent = GetNode(NodeIdFromTransportId(parent_id)); 278 Node* parent = GetNode(NodeIdFromTransportId(parent_id));
224 Node* child = GetNode(NodeIdFromTransportId(child_id)); 279 Node* child = GetNode(NodeIdFromTransportId(child_id));
225 if (parent && child && child->GetParent() != parent && 280 if (parent && child && child->GetParent() != parent &&
226 !child->window()->Contains(parent->window())) { 281 !child->window()->Contains(parent->window())) {
227 success = true; 282 success = true;
228 RootNodeManager::ScopedChange change( 283 RootNodeManager::ScopedChange change(
229 this, context(), 284 this, context(),
230 RootNodeManager::CHANGE_TYPE_ADVANCE_SERVER_CHANGE_ID); 285 RootNodeManager::CHANGE_TYPE_ADVANCE_SERVER_CHANGE_ID, false);
231 parent->Add(child); 286 parent->Add(child);
232 } 287 }
233 } 288 }
234 callback.Run(success); 289 callback.Run(success);
235 } 290 }
236 291
237 void ViewManagerConnection::RemoveNodeFromParent( 292 void ViewManagerConnection::RemoveNodeFromParent(
238 TransportNodeId node_id, 293 TransportNodeId node_id,
239 TransportChangeId server_change_id, 294 TransportChangeId server_change_id,
240 const Callback<void(bool)>& callback) { 295 const Callback<void(bool)>& callback) {
241 bool success = false; 296 bool success = false;
242 if (server_change_id == context()->next_server_change_id()) { 297 if (server_change_id == context()->next_server_change_id()) {
243 Node* node = GetNode(NodeIdFromTransportId(node_id)); 298 Node* node = GetNode(NodeIdFromTransportId(node_id));
244 if (node && node->GetParent()) { 299 if (node && node->GetParent()) {
245 success = true; 300 success = true;
246 RootNodeManager::ScopedChange change( 301 RootNodeManager::ScopedChange change(
247 this, context(), 302 this, context(),
248 RootNodeManager::CHANGE_TYPE_ADVANCE_SERVER_CHANGE_ID); 303 RootNodeManager::CHANGE_TYPE_ADVANCE_SERVER_CHANGE_ID, false);
249 node->GetParent()->Remove(node); 304 node->GetParent()->Remove(node);
250 } 305 }
251 } 306 }
252 callback.Run(success); 307 callback.Run(success);
253 } 308 }
254 309
255 void ViewManagerConnection::GetNodeTree( 310 void ViewManagerConnection::GetNodeTree(
256 TransportNodeId node_id, 311 TransportNodeId node_id,
257 const Callback<void(Array<INode>)>& callback) { 312 const Callback<void(Array<INode>)>& callback) {
258 AllocationScope allocation_scope; 313 AllocationScope allocation_scope;
259 Node* node = GetNode(NodeIdFromTransportId(node_id)); 314 Node* node = GetNode(NodeIdFromTransportId(node_id));
260 Array<INode>::Builder array_builder(NodeCount(node)); 315 std::vector<Node*> nodes;
261 { 316 GetDescendants(node, &nodes);
262 size_t index = 0; 317 for (size_t i = 0; i < nodes.size(); ++i)
263 NodeToINode(node, &array_builder, &index); 318 known_nodes_.insert(NodeIdToTransportId(nodes[i]->id()));
264 } 319 callback.Run(Array<INode>::From(nodes));
265 callback.Run(array_builder.Finish());
266 } 320 }
267 321
268 void ViewManagerConnection::CreateView( 322 void ViewManagerConnection::CreateView(
269 TransportViewId transport_view_id, 323 TransportViewId transport_view_id,
270 const Callback<void(bool)>& callback) { 324 const Callback<void(bool)>& callback) {
271 const ViewId view_id(ViewIdFromTransportId(transport_view_id)); 325 const ViewId view_id(ViewIdFromTransportId(transport_view_id));
272 if (view_id.connection_id != id_ || view_map_.count(view_id.view_id)) { 326 if (view_id.connection_id != id_ || view_map_.count(view_id.view_id)) {
273 callback.Run(false); 327 callback.Run(false);
274 return; 328 return;
275 } 329 }
(...skipping 33 matching lines...) Expand 10 before | Expand all | Expand 10 after
309 SkBitmap bitmap; 363 SkBitmap bitmap;
310 gfx::PNGCodec::Decode(static_cast<const unsigned char*>(handle_data), 364 gfx::PNGCodec::Decode(static_cast<const unsigned char*>(handle_data),
311 buffer_size, &bitmap); 365 buffer_size, &bitmap);
312 view->SetBitmap(bitmap); 366 view->SetBitmap(bitmap);
313 UnmapBuffer(handle_data); 367 UnmapBuffer(handle_data);
314 } 368 }
315 369
316 void ViewManagerConnection::OnNodeHierarchyChanged(const NodeId& node, 370 void ViewManagerConnection::OnNodeHierarchyChanged(const NodeId& node,
317 const NodeId& new_parent, 371 const NodeId& new_parent,
318 const NodeId& old_parent) { 372 const NodeId& old_parent) {
319 context()->NotifyNodeHierarchyChanged(node, new_parent, old_parent); 373 context()->ProcessNodeHierarchyChanged(node, new_parent, old_parent);
320 } 374 }
321 375
322 void ViewManagerConnection::OnNodeViewReplaced(const NodeId& node, 376 void ViewManagerConnection::OnNodeViewReplaced(const NodeId& node,
323 const ViewId& new_view_id, 377 const ViewId& new_view_id,
324 const ViewId& old_view_id) { 378 const ViewId& old_view_id) {
325 context()->NotifyNodeViewReplaced(node, new_view_id, old_view_id); 379 context()->ProcessNodeViewReplaced(node, new_view_id, old_view_id);
326 } 380 }
327 381
328 } // namespace service 382 } // namespace service
329 } // namespace view_manager 383 } // namespace view_manager
330 } // namespace mojo 384 } // namespace mojo
OLDNEW
« no previous file with comments | « mojo/services/view_manager/view_manager_connection.h ('k') | mojo/services/view_manager/view_manager_connection_unittest.cc » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698