OLD | NEW |
1 // Copyright (c) 2013 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2013 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 "content/browser/webui/web_ui_controller_factory_registry.h" | 5 #include "content/browser/webui/web_ui_controller_factory_registry.h" |
6 | 6 |
7 #include "base/lazy_instance.h" | 7 #include "base/lazy_instance.h" |
8 #include "content/public/common/url_constants.h" | 8 #include "content/public/common/url_constants.h" |
9 #include "googleurl/src/gurl.h" | 9 #include "googleurl/src/gurl.h" |
10 | 10 |
11 namespace content { | 11 namespace content { |
12 | 12 |
13 base::LazyInstance<std::vector<WebUIControllerFactory*> > g_factories = | 13 base::LazyInstance<std::vector<WebUIControllerFactory*> > g_factories = |
14 LAZY_INSTANCE_INITIALIZER; | 14 LAZY_INSTANCE_INITIALIZER; |
15 | 15 |
16 void WebUIControllerFactory::RegisterFactory(WebUIControllerFactory* factory) { | 16 void WebUIControllerFactory::RegisterFactory(WebUIControllerFactory* factory) { |
17 g_factories.Pointer()->push_back(factory); | 17 g_factories.Pointer()->push_back(factory); |
18 } | 18 } |
19 | 19 |
20 void WebUIControllerFactory::UnregisterFactoryForTesting( | 20 WebUIControllerFactoryRegistry* WebUIControllerFactoryRegistry::GetInstance() { |
| 21 return Singleton<WebUIControllerFactoryRegistry>::get(); |
| 22 } |
| 23 |
| 24 void WebUIControllerFactoryRegistry::UnregisterFactoryForTesting( |
21 WebUIControllerFactory* factory) { | 25 WebUIControllerFactory* factory) { |
22 std::vector<WebUIControllerFactory*>* factories = g_factories.Pointer(); | 26 std::vector<WebUIControllerFactory*>* factories = g_factories.Pointer(); |
23 for (size_t i = 0; i < factories->size(); ++i) { | 27 for (size_t i = 0; i < factories->size(); ++i) { |
24 if ((*factories)[i] == factory) { | 28 if ((*factories)[i] == factory) { |
25 factories->erase(factories->begin() + i); | 29 factories->erase(factories->begin() + i); |
26 return; | 30 return; |
27 } | 31 } |
28 } | 32 } |
29 NOTREACHED() << "Tried to unregister a factory but it wasn't found"; | 33 NOTREACHED() << "Tried to unregister a factory but it wasn't found"; |
30 } | 34 } |
31 | 35 |
32 WebUIControllerFactoryRegistry* WebUIControllerFactoryRegistry::GetInstance() { | |
33 return Singleton<WebUIControllerFactoryRegistry>::get(); | |
34 } | |
35 | |
36 WebUIController* WebUIControllerFactoryRegistry::CreateWebUIControllerForURL( | 36 WebUIController* WebUIControllerFactoryRegistry::CreateWebUIControllerForURL( |
37 WebUI* web_ui, const GURL& url) const { | 37 WebUI* web_ui, const GURL& url) const { |
38 std::vector<WebUIControllerFactory*>* factories = g_factories.Pointer(); | 38 std::vector<WebUIControllerFactory*>* factories = g_factories.Pointer(); |
39 for (size_t i = 0; i < factories->size(); ++i) { | 39 for (size_t i = 0; i < factories->size(); ++i) { |
40 WebUIController* controller = (*factories)[i]->CreateWebUIControllerForURL( | 40 WebUIController* controller = (*factories)[i]->CreateWebUIControllerForURL( |
41 web_ui, url); | 41 web_ui, url); |
42 if (controller) | 42 if (controller) |
43 return controller; | 43 return controller; |
44 } | 44 } |
45 return NULL; | 45 return NULL; |
(...skipping 51 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
97 (data_urls_allowed && url.SchemeIs(chrome::kDataScheme)); | 97 (data_urls_allowed && url.SchemeIs(chrome::kDataScheme)); |
98 } | 98 } |
99 | 99 |
100 WebUIControllerFactoryRegistry::WebUIControllerFactoryRegistry() { | 100 WebUIControllerFactoryRegistry::WebUIControllerFactoryRegistry() { |
101 } | 101 } |
102 | 102 |
103 WebUIControllerFactoryRegistry::~WebUIControllerFactoryRegistry() { | 103 WebUIControllerFactoryRegistry::~WebUIControllerFactoryRegistry() { |
104 } | 104 } |
105 | 105 |
106 } // namespace content | 106 } // namespace content |
OLD | NEW |