OLD | NEW |
1 // Copyright (c) 2011 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2011 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 // A Predictor object is instantiated once in the browser process, and manages | 5 // A Predictor object is instantiated once in the browser process, and manages |
6 // both preresolution of hostnames, as well as TCP/IP preconnection to expected | 6 // both preresolution of hostnames, as well as TCP/IP preconnection to expected |
7 // subresources. | 7 // subresources. |
8 // Most hostname lists are provided by the renderer processes, and include URLs | 8 // Most hostname lists are provided by the renderer processes, and include URLs |
9 // that *might* be used in the near future by the browsing user. One goal of | 9 // that *might* be used in the near future by the browsing user. One goal of |
10 // this class is to cause the underlying DNS structure to lookup a hostname | 10 // this class is to cause the underlying DNS structure to lookup a hostname |
11 // before it is really needed, and hence reduce latency in the standard lookup | 11 // before it is really needed, and hence reduce latency in the standard lookup |
12 // paths. | 12 // paths. |
13 // Subresource relationships are usually acquired from the referrer field in a | 13 // Subresource relationships are usually acquired from the referrer field in a |
14 // navigation. A subresource URL may be associated with a referrer URL. Later | 14 // navigation. A subresource URL may be associated with a referrer URL. Later |
15 // navigations may, if the likelihood of needing the subresource is high enough, | 15 // navigations may, if the likelihood of needing the subresource is high enough, |
16 // cause this module to speculatively create a TCP/IP connection. If there is | 16 // cause this module to speculatively create a TCP/IP connection. If there is |
17 // only a low likelihood, then a DNS pre-resolution operation may be performed. | 17 // only a low likelihood, then a DNS pre-resolution operation may be performed. |
18 | 18 |
19 #ifndef CHROME_BROWSER_NET_PREDICTOR_H_ | 19 #ifndef CHROME_BROWSER_NET_PREDICTOR_H_ |
20 #define CHROME_BROWSER_NET_PREDICTOR_H_ | 20 #define CHROME_BROWSER_NET_PREDICTOR_H_ |
21 #pragma once | 21 #pragma once |
22 | 22 |
23 #include <map> | 23 #include <map> |
24 #include <queue> | 24 #include <queue> |
25 #include <set> | 25 #include <set> |
26 #include <string> | 26 #include <string> |
27 #include <vector> | 27 #include <vector> |
28 | 28 |
29 #include "base/gtest_prod_util.h" | 29 #include "base/gtest_prod_util.h" |
30 #include "base/memory/ref_counted.h" | 30 #include "base/memory/scoped_ptr.h" |
31 #include "chrome/browser/net/url_info.h" | 31 #include "chrome/browser/net/url_info.h" |
32 #include "chrome/browser/net/referrer.h" | 32 #include "chrome/browser/net/referrer.h" |
33 #include "chrome/common/net/predictor_common.h" | 33 #include "chrome/common/net/predictor_common.h" |
34 #include "net/base/host_port_pair.h" | 34 #include "net/base/host_port_pair.h" |
35 | 35 |
36 namespace base { | 36 namespace base { |
37 class ListValue; | 37 class ListValue; |
38 } | 38 } |
39 | 39 |
| 40 namespace base { |
| 41 class WaitableEvent; |
| 42 } |
| 43 |
40 namespace net { | 44 namespace net { |
41 class HostResolver; | 45 class HostResolver; |
42 } // namespace net | 46 } // namespace net |
43 | 47 |
| 48 class IOThread; |
| 49 class PrefService; |
| 50 class Profile; |
| 51 |
44 namespace chrome_browser_net { | 52 namespace chrome_browser_net { |
45 | 53 |
46 typedef chrome_common_net::UrlList UrlList; | 54 typedef chrome_common_net::UrlList UrlList; |
47 typedef chrome_common_net::NameList NameList; | 55 typedef chrome_common_net::NameList NameList; |
48 typedef std::map<GURL, UrlInfo> Results; | 56 typedef std::map<GURL, UrlInfo> Results; |
49 | 57 |
50 // Note that Predictor is not thread safe, and must only be called from | 58 // Predictor is constructed during Profile construction (on the UI thread), |
51 // the IO thread. Failure to do so will result in a DCHECK at runtime. | 59 // but it is destroyed on the IO thread when ProfileIOData goes away. All of |
52 class Predictor : public base::RefCountedThreadSafe<Predictor> { | 60 // its core state and functionality happens on the IO thread. The only UI |
| 61 // methods are initialization / shutdown related (including preconnect |
| 62 // initialization), or convenience methods that internally forward calls to |
| 63 // the IO thread. |
| 64 class Predictor { |
53 public: | 65 public: |
54 // A version number for prefs that are saved. This should be incremented when | 66 // A version number for prefs that are saved. This should be incremented when |
55 // we change the format so that we discard old data. | 67 // we change the format so that we discard old data. |
56 enum { PREDICTOR_REFERRER_VERSION = 2 }; | 68 enum { PREDICTOR_REFERRER_VERSION = 2 }; |
57 | 69 |
| 70 // Given that the underlying Chromium resolver defaults to a total maximum of |
| 71 // 8 paralell resolutions, we will avoid any chance of starving navigational |
| 72 // resolutions by limiting the number of paralell speculative resolutions. |
| 73 // This is used in the field trials and testing. |
| 74 // TODO(jar): Move this limitation into the resolver. |
| 75 static const size_t kMaxSpeculativeParallelResolves; |
| 76 |
| 77 // To control the congestion avoidance system, we need an estimate of how |
| 78 // many speculative requests may arrive at once. Since we currently only |
| 79 // keep 8 subresource names for each frame, we'll use that as our basis. |
| 80 // Note that when scanning search results lists, we might actually get 10 at |
| 81 // a time, and wikipedia can often supply (during a page scan) upwards of 50. |
| 82 // In those odd cases, we may discard some of the later speculative requests |
| 83 // mistakenly assuming that the resolutions took too long. |
| 84 static const int kTypicalSpeculativeGroupSize; |
| 85 |
| 86 // The next constant specifies an amount of queueing delay that is |
| 87 // "too large," and indicative of problems with resolutions (perhaps due to |
| 88 // an overloaded router, or such). When we exceed this delay, congestion |
| 89 // avoidance will kick in and all speculations in the queue will be discarded. |
| 90 static const int kMaxSpeculativeResolveQueueDelayMs; |
| 91 |
58 // |max_concurrent| specifies how many concurrent (parallel) prefetches will | 92 // |max_concurrent| specifies how many concurrent (parallel) prefetches will |
59 // be performed. Host lookups will be issued through |host_resolver|. | 93 // be performed. Host lookups will be issued through |host_resolver|. |
60 Predictor(net::HostResolver* host_resolver, | 94 explicit Predictor(bool preconnect_enabled); |
61 base::TimeDelta max_queue_delay_ms, size_t max_concurrent, | 95 |
62 bool preconnect_enabled); | 96 virtual ~Predictor(); |
| 97 |
| 98 static void RegisterUserPrefs(PrefService* user_prefs); |
| 99 |
| 100 // ------------- Start UI thread methods. |
| 101 |
| 102 virtual void InitNetworkPredictor(PrefService* user_prefs, |
| 103 PrefService* local_state, |
| 104 IOThread* io_thread); |
| 105 |
| 106 // The Omnibox has proposed a given url to the user, and if it is a search |
| 107 // URL, then it also indicates that this is preconnectable (i.e., we could |
| 108 // preconnect to the search server). |
| 109 virtual void AnticipateOmniboxUrl(const GURL& url, bool preconnectable); |
| 110 |
| 111 // Preconnect a URL and all of its subresource domains. |
| 112 virtual void PreconnectUrlAndSubresources(const GURL& url); |
| 113 |
| 114 static UrlList GetPredictedUrlListAtStartup(PrefService* user_prefs, |
| 115 PrefService* local_state); |
| 116 |
| 117 static void set_max_queueing_delay(int max_queueing_delay_ms); |
| 118 |
| 119 static void set_max_parallel_resolves(size_t max_parallel_resolves); |
| 120 |
| 121 virtual void ShutdownOnUIThread(PrefService* user_prefs); |
| 122 |
| 123 // ------------- End UI thread methods. |
| 124 |
| 125 // ------------- Start IO thread methods. |
63 | 126 |
64 // Cancel pending requests and prevent new ones from being made. | 127 // Cancel pending requests and prevent new ones from being made. |
65 void Shutdown(); | 128 virtual void Shutdown(); |
66 | 129 |
67 // In some circumstances, for privacy reasons, all results should be | 130 // In some circumstances, for privacy reasons, all results should be |
68 // discarded. This method gracefully handles that activity. | 131 // discarded. This method gracefully handles that activity. |
69 // Destroy all our internal state, which shows what names we've looked up, and | 132 // Destroy all our internal state, which shows what names we've looked up, and |
70 // how long each has taken, etc. etc. We also destroy records of suggesses | 133 // how long each has taken, etc. etc. We also destroy records of suggesses |
71 // (cache hits etc.). | 134 // (cache hits etc.). |
72 void DiscardAllResults(); | 135 virtual void DiscardAllResults(); |
73 | 136 |
74 // Add hostname(s) to the queue for processing. | 137 // Add hostname(s) to the queue for processing. |
75 void ResolveList(const UrlList& urls, | 138 virtual void ResolveList(const UrlList& urls, |
76 UrlInfo::ResolutionMotivation motivation); | 139 UrlInfo::ResolutionMotivation motivation); |
77 void Resolve(const GURL& url, | |
78 UrlInfo::ResolutionMotivation motivation); | |
79 | 140 |
80 // Instigate pre-connection to any URLs, or pre-resolution of related host, | 141 virtual void Resolve(const GURL& url, |
81 // that we predict will be needed after this navigation (typically | 142 UrlInfo::ResolutionMotivation motivation); |
82 // more-embedded resources on a page). This method will actually post a task | |
83 // to do the actual work, so as not to jump ahead of the frame navigation that | |
84 // instigated this activity. | |
85 void PredictFrameSubresources(const GURL& url); | |
86 | |
87 // The Omnibox has proposed a given url to the user, and if it is a search | |
88 // URL, then it also indicates that this is preconnectable (i.e., we could | |
89 // preconnect to the search server). | |
90 void AnticipateOmniboxUrl(const GURL& url, bool preconnectable); | |
91 | |
92 // Preconnect a URL and all of its subresource domains. | |
93 void PreconnectUrlAndSubresources(const GURL& url); | |
94 | 143 |
95 // Record details of a navigation so that we can preresolve the host name | 144 // Record details of a navigation so that we can preresolve the host name |
96 // ahead of time the next time the users navigates to the indicated host. | 145 // ahead of time the next time the users navigates to the indicated host. |
97 // Should only be called when urls are distinct, and they should already be | 146 // Should only be called when urls are distinct, and they should already be |
98 // canonicalized to not have a path. | 147 // canonicalized to not have a path. |
99 void LearnFromNavigation(const GURL& referring_url, const GURL& target_url); | 148 virtual void LearnFromNavigation(const GURL& referring_url, |
| 149 const GURL& target_url); |
| 150 |
| 151 // When displaying info in about:dns, the following API is called. |
| 152 static void PredictorGetHtmlInfo(Predictor* predictor, |
| 153 std::string* output); |
100 | 154 |
101 // Dump HTML table containing list of referrers for about:dns. | 155 // Dump HTML table containing list of referrers for about:dns. |
102 void GetHtmlReferrerLists(std::string* output); | 156 virtual void GetHtmlReferrerLists(std::string* output); |
103 | 157 |
104 // Dump the list of currently known referrer domains and related prefetchable | 158 // Dump the list of currently known referrer domains and related prefetchable |
105 // domains. | 159 // domains for about:dns. |
106 void GetHtmlInfo(std::string* output); | 160 virtual void GetHtmlInfo(std::string* output); |
107 | 161 |
108 // Discards any referrer for which all the suggested host names are currently | 162 // Discards any referrer for which all the suggested host names are currently |
109 // annotated with negligible expected-use. Scales down (diminishes) the | 163 // annotated with negligible expected-use. Scales down (diminishes) the |
110 // expected-use of those that remain, so that their use will go down by a | 164 // expected-use of those that remain, so that their use will go down by a |
111 // factor each time we trim (moving the referrer closer to being discarded in | 165 // factor each time we trim (moving the referrer closer to being discarded in |
112 // a future call). | 166 // a future call). |
113 // The task is performed synchronously and completes before returing. | 167 // The task is performed synchronously and completes before returing. |
114 void TrimReferrersNow(); | 168 virtual void TrimReferrersNow(); |
115 | 169 |
116 // Construct a ListValue object that contains all the data in the referrers_ | 170 // Construct a ListValue object that contains all the data in the referrers_ |
117 // so that it can be persisted in a pref. | 171 // so that it can be persisted in a pref. |
118 void SerializeReferrers(base::ListValue* referral_list); | 172 virtual void SerializeReferrers(base::ListValue* referral_list); |
119 | 173 |
120 // Process a ListValue that contains all the data from a previous reference | 174 // Process a ListValue that contains all the data from a previous reference |
121 // list, as constructed by SerializeReferrers(), and add all the identified | 175 // list, as constructed by SerializeReferrers(), and add all the identified |
122 // values into the current referrer list. | 176 // values into the current referrer list. |
123 void DeserializeReferrers(const base::ListValue& referral_list); | 177 virtual void DeserializeReferrers(const base::ListValue& referral_list); |
124 | 178 |
125 void DeserializeReferrersThenDelete(base::ListValue* referral_list); | 179 virtual void DeserializeReferrersThenDelete(base::ListValue* referral_list); |
126 | 180 |
127 // For unit test code only. | 181 virtual void DiscardInitialNavigationHistory(); |
128 size_t max_concurrent_dns_lookups() const { | |
129 return max_concurrent_dns_lookups_; | |
130 } | |
131 | 182 |
132 // Flag setting to use preconnection instead of just DNS pre-fetching. | 183 virtual void FinalizeInitializationOnIOThread( |
133 bool preconnect_enabled() const { return preconnect_enabled_; } | 184 const std::vector<GURL>& urls_to_prefetch, |
| 185 base::ListValue* referral_list, |
| 186 IOThread* io_thread); |
| 187 |
| 188 // During startup, we learn what the first N urls visited are, and then |
| 189 // resolve the associated hosts ASAP during our next startup. |
| 190 virtual void LearnAboutInitialNavigation(const GURL& url); |
| 191 |
| 192 // Renderer bundles up list and sends to this browser API via IPC. |
| 193 // TODO(jar): Use UrlList instead to include port and scheme. |
| 194 virtual void DnsPrefetchList(const NameList& hostnames); |
| 195 |
| 196 // May be called from either the IO or UI thread and will PostTask |
| 197 // to the IO thread if necessary. |
| 198 virtual void Predictor::DnsPrefetchMotivatedList( |
| 199 const UrlList& urls, |
| 200 UrlInfo::ResolutionMotivation motivation); |
| 201 |
| 202 // May be called from either the IO or UI thread and will PostTask |
| 203 // to the IO thread if necessary. |
| 204 virtual void SaveStateForNextStartupAndTrim(PrefService* prefs); |
| 205 |
| 206 virtual void SaveDnsPrefetchStateForNextStartupAndTrim( |
| 207 base::ListValue* startup_list, |
| 208 base::ListValue* referral_list, |
| 209 base::WaitableEvent* completion); |
| 210 |
| 211 // May be called from either the IO or UI thread and will PostTask |
| 212 // to the IO thread if necessary. |
| 213 virtual void EnablePredictor(bool enable); |
| 214 |
| 215 virtual void EnablePredictorOnIOThread(bool enable); |
| 216 |
| 217 // ------------- End IO thread methods. |
| 218 |
| 219 // The following methods may be called on either the IO or UI threads. |
| 220 |
| 221 // Instigate pre-connection to any URLs, or pre-resolution of related host, |
| 222 // that we predict will be needed after this navigation (typically |
| 223 // more-embedded resources on a page). This method will actually post a task |
| 224 // to do the actual work, so as not to jump ahead of the frame navigation that |
| 225 // instigated this activity. |
| 226 virtual void PredictFrameSubresources(const GURL& url); |
134 | 227 |
135 // Put URL in canonical form, including a scheme, host, and port. | 228 // Put URL in canonical form, including a scheme, host, and port. |
136 // Returns GURL::EmptyGURL() if the scheme is not http/https or if the url | 229 // Returns GURL::EmptyGURL() if the scheme is not http/https or if the url |
137 // cannot be otherwise canonicalized. | 230 // cannot be otherwise canonicalized. |
138 static GURL CanonicalizeUrl(const GURL& url); | 231 static GURL CanonicalizeUrl(const GURL& url); |
139 | 232 |
| 233 // Used for testing. |
| 234 void SetHostResolver(net::HostResolver* host_resolver) { |
| 235 host_resolver_ = host_resolver; |
| 236 } |
| 237 // Used for testing. |
| 238 size_t max_concurrent_dns_lookups() const { |
| 239 return max_concurrent_dns_lookups_; |
| 240 } |
| 241 |
| 242 // Flag setting to use preconnection instead of just DNS pre-fetching. |
| 243 bool preconnect_enabled() const { |
| 244 return preconnect_enabled_; |
| 245 } |
| 246 |
| 247 // Flag setting for whether we are prefetching dns lookups. |
| 248 bool predictor_enabled() const { |
| 249 return predictor_enabled_; |
| 250 } |
| 251 |
| 252 |
140 private: | 253 private: |
141 friend class base::RefCountedThreadSafe<Predictor>; | |
142 FRIEND_TEST_ALL_PREFIXES(PredictorTest, BenefitLookupTest); | 254 FRIEND_TEST_ALL_PREFIXES(PredictorTest, BenefitLookupTest); |
143 FRIEND_TEST_ALL_PREFIXES(PredictorTest, ShutdownWhenResolutionIsPendingTest); | 255 FRIEND_TEST_ALL_PREFIXES(PredictorTest, ShutdownWhenResolutionIsPendingTest); |
144 FRIEND_TEST_ALL_PREFIXES(PredictorTest, SingleLookupTest); | 256 FRIEND_TEST_ALL_PREFIXES(PredictorTest, SingleLookupTest); |
145 FRIEND_TEST_ALL_PREFIXES(PredictorTest, ConcurrentLookupTest); | 257 FRIEND_TEST_ALL_PREFIXES(PredictorTest, ConcurrentLookupTest); |
146 FRIEND_TEST_ALL_PREFIXES(PredictorTest, MassiveConcurrentLookupTest); | 258 FRIEND_TEST_ALL_PREFIXES(PredictorTest, MassiveConcurrentLookupTest); |
147 FRIEND_TEST_ALL_PREFIXES(PredictorTest, PriorityQueuePushPopTest); | 259 FRIEND_TEST_ALL_PREFIXES(PredictorTest, PriorityQueuePushPopTest); |
148 FRIEND_TEST_ALL_PREFIXES(PredictorTest, PriorityQueueReorderTest); | 260 FRIEND_TEST_ALL_PREFIXES(PredictorTest, PriorityQueueReorderTest); |
149 FRIEND_TEST_ALL_PREFIXES(PredictorTest, ReferrerSerializationTrimTest); | 261 FRIEND_TEST_ALL_PREFIXES(PredictorTest, ReferrerSerializationTrimTest); |
150 friend class WaitForResolutionHelper; // For testing. | 262 friend class WaitForResolutionHelper; // For testing. |
151 | 263 |
(...skipping 19 matching lines...) Expand all Loading... |
171 private: | 283 private: |
172 // The names in the queue that should be serviced (popped) ASAP. | 284 // The names in the queue that should be serviced (popped) ASAP. |
173 std::queue<GURL> rush_queue_; | 285 std::queue<GURL> rush_queue_; |
174 // The names in the queue that should only be serviced when rush_queue is | 286 // The names in the queue that should only be serviced when rush_queue is |
175 // empty. | 287 // empty. |
176 std::queue<GURL> background_queue_; | 288 std::queue<GURL> background_queue_; |
177 | 289 |
178 DISALLOW_COPY_AND_ASSIGN(HostNameQueue); | 290 DISALLOW_COPY_AND_ASSIGN(HostNameQueue); |
179 }; | 291 }; |
180 | 292 |
| 293 // The InitialObserver monitors navigations made by the network stack. This |
| 294 // is only used to identify startup time resolutions (for re-resolution |
| 295 // during our next process startup). |
| 296 // TODO(jar): Consider preconnecting at startup, which may be faster than |
| 297 // waiting for render process to start and request a connection. |
| 298 class InitialObserver { |
| 299 public: |
| 300 // Recording of when we observed each navigation. |
| 301 typedef std::map<GURL, base::TimeTicks> FirstNavigations; |
| 302 |
| 303 // Potentially add a new URL to our startup list. |
| 304 void Append(const GURL& url, Predictor* predictor); |
| 305 |
| 306 // Get an HTML version of our current planned first_navigations_. |
| 307 void GetFirstResolutionsHtml(std::string* output); |
| 308 |
| 309 // Persist the current first_navigations_ for storage in a list. |
| 310 void GetInitialDnsResolutionList(base::ListValue* startup_list); |
| 311 |
| 312 // Discards all initial loading history. |
| 313 void DiscardInitialNavigationHistory() { first_navigations_.clear(); } |
| 314 |
| 315 private: |
| 316 // List of the first N URL resolutions observed in this run. |
| 317 FirstNavigations first_navigations_; |
| 318 |
| 319 // The number of URLs we'll save for pre-resolving at next startup. |
| 320 static const size_t kStartupResolutionCount = 10; |
| 321 }; |
| 322 |
181 // A map that is keyed with the host/port that we've learned were the cause | 323 // A map that is keyed with the host/port that we've learned were the cause |
182 // of loading additional URLs. The list of additional targets is held | 324 // of loading additional URLs. The list of additional targets is held |
183 // in a Referrer instance, which is a value in this map. | 325 // in a Referrer instance, which is a value in this map. |
184 typedef std::map<GURL, Referrer> Referrers; | 326 typedef std::map<GURL, Referrer> Referrers; |
185 | 327 |
186 // Depending on the expected_subresource_use_, we may either make a TCP/IP | 328 // Depending on the expected_subresource_use_, we may either make a TCP/IP |
187 // preconnection, or merely pre-resolve the hostname via DNS (or even do | 329 // preconnection, or merely pre-resolve the hostname via DNS (or even do |
188 // nothing). The following are the threasholds for taking those actions. | 330 // nothing). The following are the threasholds for taking those actions. |
189 static const double kPreconnectWorthyExpectedValue; | 331 static const double kPreconnectWorthyExpectedValue; |
190 static const double kDNSPreresolutionWorthyExpectedValue; | 332 static const double kDNSPreresolutionWorthyExpectedValue; |
191 // Referred hosts with a subresource_use_rate_ that are less than the | 333 // Referred hosts with a subresource_use_rate_ that are less than the |
192 // following threshold will be discarded when we Trim() the list. | 334 // following threshold will be discarded when we Trim() the list. |
193 static const double kDiscardableExpectedValue; | 335 static const double kDiscardableExpectedValue; |
194 // During trimming operation to discard hosts for which we don't have likely | 336 // During trimming operation to discard hosts for which we don't have likely |
195 // subresources, we multiply the expected_subresource_use_ value by the | 337 // subresources, we multiply the expected_subresource_use_ value by the |
196 // following ratio until that value is less than kDiscardableExpectedValue. | 338 // following ratio until that value is less than kDiscardableExpectedValue. |
197 // This number should always be less than 1, an more than 0. | 339 // This number should always be less than 1, an more than 0. |
198 static const double kReferrerTrimRatio; | 340 static const double kReferrerTrimRatio; |
199 | 341 |
200 // Interval between periodic trimming of our whole referrer list. | 342 // Interval between periodic trimming of our whole referrer list. |
201 // We only do a major trimming about once an hour, and then only when the user | 343 // We only do a major trimming about once an hour, and then only when the user |
202 // is actively browsing. | 344 // is actively browsing. |
203 static const base::TimeDelta kDurationBetweenTrimmings; | 345 static const base::TimeDelta kDurationBetweenTrimmings; |
204 // Interval between incremental trimmings (to avoid inducing Jank). | 346 // Interval between incremental trimmings (to avoid inducing Jank). |
205 static const base::TimeDelta kDurationBetweenTrimmingIncrements; | 347 static const base::TimeDelta kDurationBetweenTrimmingIncrements; |
206 // Number of referring URLs processed in an incremental trimming. | 348 // Number of referring URLs processed in an incremental trimming. |
207 static const size_t kUrlsTrimmedPerIncrement; | 349 static const size_t kUrlsTrimmedPerIncrement; |
208 | 350 |
209 ~Predictor(); | |
210 | |
211 // Perform actual resolution or preconnection to subresources now. This is | |
212 // an internal worker method that is reached via a post task from | |
213 // PredictFrameSubresources(). | |
214 void PrepareFrameSubresources(const GURL& url); | |
215 | |
216 // Only for testing. Returns true if hostname has been successfully resolved | 351 // Only for testing. Returns true if hostname has been successfully resolved |
217 // (name found). | 352 // (name found). |
218 bool WasFound(const GURL& url) const { | 353 bool WasFound(const GURL& url) const { |
219 Results::const_iterator it(results_.find(url)); | 354 Results::const_iterator it(results_.find(url)); |
220 return (it != results_.end()) && | 355 return (it != results_.end()) && |
221 it->second.was_found(); | 356 it->second.was_found(); |
222 } | 357 } |
223 | 358 |
224 // Only for testing. Return how long was the resolution | 359 // Only for testing. Return how long was the resolution |
225 // or UrlInfo::kNullDuration if it hasn't been resolved yet. | 360 // or UrlInfo::kNullDuration if it hasn't been resolved yet. |
226 base::TimeDelta GetResolutionDuration(const GURL& url) { | 361 base::TimeDelta GetResolutionDuration(const GURL& url) { |
227 if (results_.find(url) == results_.end()) | 362 if (results_.find(url) == results_.end()) |
228 return UrlInfo::kNullDuration; | 363 return UrlInfo::kNullDuration; |
229 return results_[url].resolve_duration(); | 364 return results_[url].resolve_duration(); |
230 } | 365 } |
231 | 366 |
232 // Only for testing; | 367 // Only for testing; |
233 size_t peak_pending_lookups() const { return peak_pending_lookups_; } | 368 size_t peak_pending_lookups() const { return peak_pending_lookups_; } |
234 | 369 |
| 370 // ------------- Start IO thread methods. |
| 371 |
| 372 // Perform actual resolution or preconnection to subresources now. This is |
| 373 // an internal worker method that is reached via a post task from |
| 374 // PredictFrameSubresources(). |
| 375 void PrepareFrameSubresources(const GURL& url); |
| 376 |
235 // Access method for use by async lookup request to pass resolution result. | 377 // Access method for use by async lookup request to pass resolution result. |
236 void OnLookupFinished(LookupRequest* request, const GURL& url, bool found); | 378 void OnLookupFinished(LookupRequest* request, const GURL& url, bool found); |
237 | 379 |
238 // Underlying method for both async and synchronous lookup to update state. | 380 // Underlying method for both async and synchronous lookup to update state. |
239 void LookupFinished(LookupRequest* request, | 381 void LookupFinished(LookupRequest* request, |
240 const GURL& url, bool found); | 382 const GURL& url, bool found); |
241 | 383 |
242 // Queue hostname for resolution. If queueing was done, return the pointer | 384 // Queue hostname for resolution. If queueing was done, return the pointer |
243 // to the queued instance, otherwise return NULL. | 385 // to the queued instance, otherwise return NULL. |
244 UrlInfo* AppendToResolutionQueue(const GURL& url, | 386 UrlInfo* AppendToResolutionQueue(const GURL& url, |
(...skipping 25 matching lines...) Expand all Loading... |
270 void LoadUrlsForTrimming(); | 412 void LoadUrlsForTrimming(); |
271 | 413 |
272 // Posts a task to do additional incremental trimming of referrers_. | 414 // Posts a task to do additional incremental trimming of referrers_. |
273 void PostIncrementalTrimTask(); | 415 void PostIncrementalTrimTask(); |
274 | 416 |
275 // Calls Trim() on some or all of urls_being_trimmed_. | 417 // Calls Trim() on some or all of urls_being_trimmed_. |
276 // If it does not process all the URLs in that vector, it posts a task to | 418 // If it does not process all the URLs in that vector, it posts a task to |
277 // continue with them shortly (i.e., it yeilds and continues). | 419 // continue with them shortly (i.e., it yeilds and continues). |
278 void IncrementalTrimReferrers(bool trim_all_now); | 420 void IncrementalTrimReferrers(bool trim_all_now); |
279 | 421 |
| 422 // ------------- End IO thread methods. |
| 423 |
| 424 scoped_ptr<InitialObserver> initial_observer_; |
| 425 |
| 426 // Status of speculative DNS resolution and speculative TCP/IP connection |
| 427 // feature. |
| 428 bool predictor_enabled_; |
| 429 |
280 // work_queue_ holds a list of names we need to look up. | 430 // work_queue_ holds a list of names we need to look up. |
281 HostNameQueue work_queue_; | 431 HostNameQueue work_queue_; |
282 | 432 |
283 // results_ contains information for existing/prior prefetches. | 433 // results_ contains information for existing/prior prefetches. |
284 Results results_; | 434 Results results_; |
285 | 435 |
286 std::set<LookupRequest*> pending_lookups_; | 436 std::set<LookupRequest*> pending_lookups_; |
287 | 437 |
288 // For testing, to verify that we don't exceed the limit. | 438 // For testing, to verify that we don't exceed the limit. |
289 size_t peak_pending_lookups_; | 439 size_t peak_pending_lookups_; |
290 | 440 |
291 // When true, we don't make new lookup requests. | 441 // When true, we don't make new lookup requests. |
292 bool shutdown_; | 442 bool shutdown_; |
293 | 443 |
294 // The number of concurrent speculative lookups currently allowed to be sent | 444 // The number of concurrent speculative lookups currently allowed to be sent |
295 // to the resolver. Any additional lookups will be queued to avoid exceeding | 445 // to the resolver. Any additional lookups will be queued to avoid exceeding |
296 // this value. The queue is a priority queue that will accelerate | 446 // this value. The queue is a priority queue that will accelerate |
297 // sub-resource speculation, and retard resolutions suggested by page scans. | 447 // sub-resource speculation, and retard resolutions suggested by page scans. |
298 const size_t max_concurrent_dns_lookups_; | 448 const size_t max_concurrent_dns_lookups_; |
299 | 449 |
300 // The maximum queueing delay that is acceptable before we enter congestion | 450 // The maximum queueing delay that is acceptable before we enter congestion |
301 // reduction mode, and discard all queued (but not yet assigned) resolutions. | 451 // reduction mode, and discard all queued (but not yet assigned) resolutions. |
302 const base::TimeDelta max_dns_queue_delay_; | 452 const base::TimeDelta max_dns_queue_delay_; |
303 | 453 |
304 // The host resolver we warm DNS entries for. | 454 // The host resolver we warm DNS entries for. |
305 net::HostResolver* const host_resolver_; | 455 net::HostResolver* host_resolver_; |
306 | 456 |
307 // Are we currently using preconnection, rather than just DNS resolution, for | 457 // Are we currently using preconnection, rather than just DNS resolution, for |
308 // subresources and omni-box search URLs. | 458 // subresources and omni-box search URLs. |
309 bool preconnect_enabled_; | 459 bool preconnect_enabled_; |
310 | 460 |
311 // Most recent suggestion from Omnibox provided via AnticipateOmniboxUrl(). | 461 // Most recent suggestion from Omnibox provided via AnticipateOmniboxUrl(). |
312 std::string last_omnibox_host_; | 462 std::string last_omnibox_host_; |
313 | 463 |
314 // The time when the last preresolve was done for last_omnibox_host_. | 464 // The time when the last preresolve was done for last_omnibox_host_. |
315 base::TimeTicks last_omnibox_preresolve_; | 465 base::TimeTicks last_omnibox_preresolve_; |
(...skipping 11 matching lines...) Expand all Loading... |
327 // orginial hostname. | 477 // orginial hostname. |
328 Referrers referrers_; | 478 Referrers referrers_; |
329 | 479 |
330 // List of URLs in referrers_ currently being trimmed (scaled down to | 480 // List of URLs in referrers_ currently being trimmed (scaled down to |
331 // eventually be aged out of use). | 481 // eventually be aged out of use). |
332 std::vector<GURL> urls_being_trimmed_; | 482 std::vector<GURL> urls_being_trimmed_; |
333 | 483 |
334 // A time after which we need to do more trimming of referrers. | 484 // A time after which we need to do more trimming of referrers. |
335 base::TimeTicks next_trim_time_; | 485 base::TimeTicks next_trim_time_; |
336 | 486 |
337 ScopedRunnableMethodFactory<Predictor> trim_task_factory_; | 487 scoped_ptr<ScopedRunnableMethodFactory<Predictor> > trim_task_factory_; |
338 | 488 |
339 DISALLOW_COPY_AND_ASSIGN(Predictor); | 489 DISALLOW_COPY_AND_ASSIGN(Predictor); |
340 }; | 490 }; |
341 | 491 |
342 } // namespace chrome_browser_net | 492 } // namespace chrome_browser_net |
343 | 493 |
344 #endif // CHROME_BROWSER_NET_PREDICTOR_H_ | 494 #endif // CHROME_BROWSER_NET_PREDICTOR_H_ |
OLD | NEW |