Lazy load chrome.* APIs

chrome/common/extensions/api/extension_api.cc

 // Copyright (c) 2012 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/common/extensions/api/extension_api.h"
 
 #include <algorithm>
 #include <string>
 #include <vector>
 
@@ skipping 675 matching lines @@
     std::string feature_type;
     std::string feature_name;
     SplitDependencyName(*iter, &feature_type, &feature_name);
     if (feature_type == "api")
       result->insert(feature_name);
   }
 
   return result.Pass();
 }
 
+scoped_ptr<std::set<std::string> > ExtensionAPI::GetAllAPINames() {
+  // Don't do this. Instead reference the unloaded schemas and load as needed.

[not at google - send to devlin, 2012/12/13 22:26:40]

Yup. Loading all the schemas somewhat defeats loading things lazily.

+  LoadAllSchemas();
+  scoped_ptr<std::set<std::string> > result(new std::set<std::string>());
+  for (SchemaMap::iterator i = schemas_.begin(); i != schemas_.end(); ++i)
+    result->insert(i->first);
+  return result.Pass();
+}
+
 Feature* ExtensionAPI::GetFeature(const std::string& full_name) {
   // Ensure it's loaded.
   GetSchema(full_name);
 
   std::string child_name;
   std::string api_namespace = GetAPINameFromFullName(full_name, &child_name);
 
   APIFeatureMap::iterator feature_map = features_.find(api_namespace);
   if (feature_map == features_.end())
     return NULL;
@@ skipping 150 matching lines @@
 
 void ExtensionAPI::LoadAllSchemas() {
   while (unloaded_schemas_.size()) {
     std::map<std::string, base::StringPiece>::iterator it =
         unloaded_schemas_.begin();
     LoadSchema(it->first, it->second);
   }
 }
 
 }  // namespace extensions