Propagate window coordinates to out-of-process iframes renderers.

content/test/content_browser_test_utils_internal.cc

 // Copyright 2014 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 "content/test/content_browser_test_utils_internal.h"
 
 #include <stddef.h>
 
 #include <algorithm>
 #include <map>
@@ skipping 69 matching lines @@
   // Traversal 3: Assign names to the proxies and add them to |legend| too.
   // Typically, only openers should have their names assigned this way.
   for (to_explore.push(root); !to_explore.empty();) {
     FrameTreeNode* node = to_explore.top();
     to_explore.pop();
     for (size_t i = node->child_count(); i-- != 0;) {
       to_explore.push(node->child_at(i));
     }
 
     // Sort the proxies by SiteInstance ID to avoid hash_map ordering.
-    std::map<int, RenderFrameProxyHost*> sorted_proxy_hosts =
-        node->render_manager()->GetAllProxyHostsForTesting();
-    for (auto& proxy_pair : sorted_proxy_hosts) {
-      RenderFrameProxyHost* proxy = proxy_pair.second;
-      legend[GetName(proxy->GetSiteInstance())] = proxy->GetSiteInstance();
-    }
+    std::vector<SiteInstance*> site_instances;
+    for (const auto& proxy_pair :
+         node->render_manager()->GetAllProxyHostsForTesting())
+      site_instances.push_back(proxy_pair.second->GetSiteInstance());
+    std::sort(site_instances.begin(), site_instances.end(),
+              [](SiteInstance* lhs, SiteInstance* rhs) {
+                return lhs->GetId() < rhs->GetId();
+              });
+
+    for (SiteInstance* site_instance : site_instances)
+      legend[GetName(site_instance)] = site_instance;
   }
 
   // Traversal 4: Now that all names are assigned, make a big loop to pretty-
   // print the tree. Each iteration produces exactly one line of format.
   std::string result;
   for (to_explore.push(root); !to_explore.empty();) {
     FrameTreeNode* node = to_explore.top();
     to_explore.pop();
     for (size_t i = node->child_count(); i-- != 0;) {
       to_explore.push(node->child_at(i));
@@ skipping 42 matching lines @@
     if (pending) {
       base::StringAppendF(&line, " (%s pending)",
                           GetName(pending->GetSiteInstance()).c_str());
     }
     if (spec) {
       base::StringAppendF(&line, " (%s speculative)",
                           GetName(spec->GetSiteInstance()).c_str());
     }
 
     // Show the SiteInstances of the RenderFrameProxyHosts of this node.
-    std::map<int, RenderFrameProxyHost*> sorted_proxy_host_map =
+    const auto& proxy_host_map =
         node->render_manager()->GetAllProxyHostsForTesting();
-    if (!sorted_proxy_host_map.empty()) {
+    if (!proxy_host_map.empty()) {
       // Show a dashed line of variable length before the proxy list. Always at
       // least two dashes.
       line.append(" --");
 
       // To make proxy lists align vertically for the first three tree levels,
       // pad with dashes up to a first tab stop at column 19 (which works out to
       // text editor column 28 in the typical diagram fed to EXPECT_EQ as a
       // string literal). Lining the lists up vertically makes differences in
       // the proxy sets easier to spot visually. We choose not to use the
       // *actual* tree height here, because that would make the diagram's
       // appearance less stable as the tree's shape evolves.
       while (line.length() < 20) {
         line.append("-");
       }
       line.append(" proxies for");
 
       // Sort these alphabetically, to avoid hash_map ordering dependency.
       std::vector<std::string> sorted_proxy_hosts;
-      for (auto& proxy_pair : sorted_proxy_host_map) {
+      for (const auto& proxy_pair : proxy_host_map) {
         sorted_proxy_hosts.push_back(
             GetName(proxy_pair.second->GetSiteInstance()));
       }
       std::sort(sorted_proxy_hosts.begin(), sorted_proxy_hosts.end());
       for (std::string& proxy_name : sorted_proxy_hosts) {
         base::StringAppendF(&line, " %s", proxy_name.c_str());
       }
     }
     if (node != root)
       result.append("\n");
@@ skipping 73 matching lines @@
     content::ResourceContext* resource_context,
     content::AppCacheService* appcache_service,
     ResourceType resource_type,
     ScopedVector<content::ResourceThrottle>* throttles) {
   DCHECK_CURRENTLY_ON(content::BrowserThread::IO);
   if (request->url() == url_)
     throttles->push_back(new HttpRequestStallThrottle);
 }
 
 }  // namespace content