1 // Copyright (c) 2012 The Chromium Authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file.
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
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
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
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
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
17 // only a low likelihood, then a DNS pre-resolution operation may be performed.
19 #ifndef CHROME_BROWSER_NET_PREDICTOR_H_
20 #define CHROME_BROWSER_NET_PREDICTOR_H_
28 #include "base/gtest_prod_util.h"
29 #include "base/memory/scoped_ptr.h"
30 #include "base/memory/weak_ptr.h"
31 #include "chrome/browser/net/prediction_options.h"
32 #include "chrome/browser/net/referrer.h"
33 #include "chrome/browser/net/timed_cache.h"
34 #include "chrome/browser/net/url_info.h"
35 #include "components/network_hints/common/network_hints_common.h"
36 #include "net/base/host_port_pair.h"
50 class SSLConfigService
;
52 class TransportSecurityState
;
53 class URLRequestContextGetter
;
56 namespace user_prefs
{
57 class PrefRegistrySyncable
;
60 namespace chrome_browser_net
{
62 typedef network_hints::UrlList UrlList
;
63 typedef network_hints::NameList NameList
;
64 typedef std::map
<GURL
, UrlInfo
> Results
;
66 // An observer for testing.
67 class PredictorObserver
{
69 virtual ~PredictorObserver() {}
71 virtual void OnPreconnectUrl(const GURL
& original_url
,
72 const GURL
& first_party_for_cookies
,
73 UrlInfo::ResolutionMotivation motivation
,
77 // Predictor is constructed during Profile construction (on the UI thread),
78 // but it is destroyed on the IO thread when ProfileIOData goes away. All of
79 // its core state and functionality happens on the IO thread. The only UI
80 // methods are initialization / shutdown related (including preconnect
81 // initialization), or convenience methods that internally forward calls to
85 // A version number for prefs that are saved. This should be incremented when
86 // we change the format so that we discard old data.
87 static const int kPredictorReferrerVersion
;
89 // Given that the underlying Chromium resolver defaults to a total maximum of
90 // 8 paralell resolutions, we will avoid any chance of starving navigational
91 // resolutions by limiting the number of paralell speculative resolutions.
92 // This is used in the field trials and testing.
93 // TODO(jar): Move this limitation into the resolver.
94 static const size_t kMaxSpeculativeParallelResolves
;
96 // To control the congestion avoidance system, we need an estimate of how
97 // many speculative requests may arrive at once. Since we currently only
98 // keep 8 subresource names for each frame, we'll use that as our basis.
99 // Note that when scanning search results lists, we might actually get 10 at
100 // a time, and wikipedia can often supply (during a page scan) upwards of 50.
101 // In those odd cases, we may discard some of the later speculative requests
102 // mistakenly assuming that the resolutions took too long.
103 static const int kTypicalSpeculativeGroupSize
;
105 // The next constant specifies an amount of queueing delay that is
106 // "too large," and indicative of problems with resolutions (perhaps due to
107 // an overloaded router, or such). When we exceed this delay, congestion
108 // avoidance will kick in and all speculations in the queue will be discarded.
109 static const int kMaxSpeculativeResolveQueueDelayMs
;
111 // We don't bother learning to preconnect via a GET if the original URL
112 // navigation was so long ago, that a preconnection would have been dropped
113 // anyway. We believe most servers will drop the connection in 10 seconds, so
114 // we currently estimate this time-till-drop at 10 seconds.
115 // TODO(jar): We should do a persistent field trial to validate/optimize this.
116 static const int kMaxUnusedSocketLifetimeSecondsWithoutAGet
;
118 // |max_concurrent| specifies how many concurrent (parallel) prefetches will
119 // be performed. Host lookups will be issued through |host_resolver|.
120 explicit Predictor(bool preconnect_enabled
, bool predictor_enabled
);
122 virtual ~Predictor();
124 // This function is used to create a predictor. For testing, we can create
125 // a version which does a simpler shutdown.
126 static Predictor
* CreatePredictor(bool preconnect_enabled
,
127 bool predictor_enabled
,
128 bool simple_shutdown
);
130 static void RegisterProfilePrefs(user_prefs::PrefRegistrySyncable
* registry
);
132 // ------------- Start UI thread methods.
134 virtual void InitNetworkPredictor(PrefService
* user_prefs
,
135 PrefService
* local_state
,
137 net::URLRequestContextGetter
* getter
,
138 ProfileIOData
* profile_io_data
);
140 // The Omnibox has proposed a given url to the user, and if it is a search
141 // URL, then it also indicates that this is preconnectable (i.e., we could
142 // preconnect to the search server).
143 void AnticipateOmniboxUrl(const GURL
& url
, bool preconnectable
);
145 // Preconnect a URL and all of its subresource domains.
146 void PreconnectUrlAndSubresources(const GURL
& url
,
147 const GURL
& first_party_for_cookies
);
149 static UrlList
GetPredictedUrlListAtStartup(PrefService
* user_prefs
,
150 PrefService
* local_state
);
152 static void set_max_queueing_delay(int max_queueing_delay_ms
);
154 static void set_max_parallel_resolves(size_t max_parallel_resolves
);
156 virtual void ShutdownOnUIThread();
158 // ------------- End UI thread methods.
160 // ------------- Start IO thread methods.
162 // Cancel pending requests and prevent new ones from being made.
165 // In some circumstances, for privacy reasons, all results should be
166 // discarded. This method gracefully handles that activity.
167 // Destroy all our internal state, which shows what names we've looked up, and
168 // how long each has taken, etc. etc. We also destroy records of suggesses
169 // (cache hits etc.).
170 void DiscardAllResults();
172 // Add hostname(s) to the queue for processing.
173 void ResolveList(const UrlList
& urls
,
174 UrlInfo::ResolutionMotivation motivation
);
176 void Resolve(const GURL
& url
, UrlInfo::ResolutionMotivation motivation
);
178 // Record details of a navigation so that we can preresolve the host name
179 // ahead of time the next time the users navigates to the indicated host.
180 // Should only be called when urls are distinct, and they should already be
181 // canonicalized to not have a path.
182 void LearnFromNavigation(const GURL
& referring_url
, const GURL
& target_url
);
184 // When displaying info in about:dns, the following API is called.
185 static void PredictorGetHtmlInfo(Predictor
* predictor
, std::string
* output
);
187 // Dump HTML table containing list of referrers for about:dns.
188 void GetHtmlReferrerLists(std::string
* output
);
190 // Dump the list of currently known referrer domains and related prefetchable
191 // domains for about:dns.
192 void GetHtmlInfo(std::string
* output
);
194 // Discards any referrer for which all the suggested host names are currently
195 // annotated with negligible expected-use. Scales down (diminishes) the
196 // expected-use of those that remain, so that their use will go down by a
197 // factor each time we trim (moving the referrer closer to being discarded in
199 // The task is performed synchronously and completes before returing.
200 void TrimReferrersNow();
202 // Construct a ListValue object that contains all the data in the referrers_
203 // so that it can be persisted in a pref.
204 void SerializeReferrers(base::ListValue
* referral_list
);
206 // Process a ListValue that contains all the data from a previous reference
207 // list, as constructed by SerializeReferrers(), and add all the identified
208 // values into the current referrer list.
209 void DeserializeReferrers(const base::ListValue
& referral_list
);
211 void DeserializeReferrersThenDelete(base::ListValue
* referral_list
);
213 void DiscardInitialNavigationHistory();
215 void FinalizeInitializationOnIOThread(
216 const std::vector
<GURL
>& urls_to_prefetch
,
217 base::ListValue
* referral_list
,
219 ProfileIOData
* profile_io_data
);
221 // During startup, we learn what the first N urls visited are, and then
222 // resolve the associated hosts ASAP during our next startup.
223 void LearnAboutInitialNavigation(const GURL
& url
);
225 // Renderer bundles up list and sends to this browser API via IPC.
226 // TODO(jar): Use UrlList instead to include port and scheme.
227 void DnsPrefetchList(const NameList
& hostnames
);
229 // May be called from either the IO or UI thread and will PostTask
230 // to the IO thread if necessary.
231 void DnsPrefetchMotivatedList(const UrlList
& urls
,
232 UrlInfo::ResolutionMotivation motivation
);
234 // May be called from either the IO or UI thread and will PostTask
235 // to the IO thread if necessary.
236 void SaveStateForNextStartupAndTrim();
238 void SaveDnsPrefetchStateForNextStartupAndTrim(
239 base::ListValue
* startup_list
,
240 base::ListValue
* referral_list
,
241 base::WaitableEvent
* completion
);
243 // May be called from either the IO or UI thread and will PostTask
244 // to the IO thread if necessary.
245 void PreconnectUrl(const GURL
& url
,
246 const GURL
& first_party_for_cookies
,
247 UrlInfo::ResolutionMotivation motivation
,
248 bool allow_credentials
,
251 void PreconnectUrlOnIOThread(const GURL
& url
,
252 const GURL
& first_party_for_cookies
,
253 UrlInfo::ResolutionMotivation motivation
,
254 bool allow_credentials
,
257 // ------------- End IO thread methods.
259 // The following methods may be called on either the IO or UI threads.
261 // Instigate pre-connection to any URLs, or pre-resolution of related host,
262 // that we predict will be needed after this navigation (typically
263 // more-embedded resources on a page). This method will actually post a task
264 // to do the actual work, so as not to jump ahead of the frame navigation that
265 // instigated this activity.
266 void PredictFrameSubresources(const GURL
& url
,
267 const GURL
& first_party_for_cookies
);
269 // Put URL in canonical form, including a scheme, host, and port.
270 // Returns GURL::EmptyGURL() if the scheme is not http/https or if the url
271 // cannot be otherwise canonicalized.
272 static GURL
CanonicalizeUrl(const GURL
& url
);
275 void SetHostResolver(net::HostResolver
* host_resolver
) {
276 host_resolver_
= host_resolver
;
279 void SetTransportSecurityState(
280 net::TransportSecurityState
* transport_security_state
) {
281 transport_security_state_
= transport_security_state
;
284 size_t max_concurrent_dns_lookups() const {
285 return max_concurrent_dns_lookups_
;
288 void SetShutdown(bool shutdown
) {
289 shutdown_
= shutdown
;
292 void SetObserver(PredictorObserver
* observer
) {
293 observer_
= observer
;
296 ProfileIOData
* profile_io_data() const {
297 return profile_io_data_
;
300 bool preconnect_enabled() const {
301 return preconnect_enabled_
;
304 bool predictor_enabled() const {
305 return predictor_enabled_
;
310 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, BenefitLookupTest
);
311 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, ShutdownWhenResolutionIsPendingTest
);
312 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, SingleLookupTest
);
313 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, ConcurrentLookupTest
);
314 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, MassiveConcurrentLookupTest
);
315 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, PriorityQueuePushPopTest
);
316 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, PriorityQueueReorderTest
);
317 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, ReferrerSerializationTrimTest
);
318 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, SingleLookupTestWithDisabledAdvisor
);
319 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, SingleLookupTestWithEnabledAdvisor
);
320 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, TestSimplePreconnectAdvisor
);
321 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, NoProxyService
);
322 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, ProxyDefinitelyEnabled
);
323 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, ProxyDefinitelyNotEnabled
);
324 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, ProxyMaybeEnabled
);
325 friend class WaitForResolutionHelper
; // For testing.
329 // A simple priority queue for handling host names.
330 // Some names that are queued up have |motivation| that requires very rapid
331 // handling. For example, a sub-resource name lookup MUST be done before the
332 // actual sub-resource is fetched. In contrast, a name that was speculatively
333 // noted in a page has to be resolved before the user "gets around to"
334 // clicking on a link. By tagging (with a motivation) each push we make into
335 // this FIFO queue, the queue can re-order the more important names to service
336 // them sooner (relative to some low priority background resolutions).
337 class HostNameQueue
{
341 void Push(const GURL
& url
,
342 UrlInfo::ResolutionMotivation motivation
);
343 bool IsEmpty() const;
347 // The names in the queue that should be serviced (popped) ASAP.
348 std::queue
<GURL
> rush_queue_
;
349 // The names in the queue that should only be serviced when rush_queue is
351 std::queue
<GURL
> background_queue_
;
353 DISALLOW_COPY_AND_ASSIGN(HostNameQueue
);
356 // The InitialObserver monitors navigations made by the network stack. This
357 // is only used to identify startup time resolutions (for re-resolution
358 // during our next process startup).
359 // TODO(jar): Consider preconnecting at startup, which may be faster than
360 // waiting for render process to start and request a connection.
361 class InitialObserver
{
365 // Recording of when we observed each navigation.
366 typedef std::map
<GURL
, base::TimeTicks
> FirstNavigations
;
368 // Potentially add a new URL to our startup list.
369 void Append(const GURL
& url
, Predictor
* predictor
);
371 // Get an HTML version of our current planned first_navigations_.
372 void GetFirstResolutionsHtml(std::string
* output
);
374 // Persist the current first_navigations_ for storage in a list.
375 void GetInitialDnsResolutionList(base::ListValue
* startup_list
);
377 // Discards all initial loading history.
378 void DiscardInitialNavigationHistory() { first_navigations_
.clear(); }
381 // List of the first N URL resolutions observed in this run.
382 FirstNavigations first_navigations_
;
384 // The number of URLs we'll save for pre-resolving at next startup.
385 static const size_t kStartupResolutionCount
= 10;
388 // A map that is keyed with the host/port that we've learned were the cause
389 // of loading additional URLs. The list of additional targets is held
390 // in a Referrer instance, which is a value in this map.
391 typedef std::map
<GURL
, Referrer
> Referrers
;
393 // Depending on the expected_subresource_use_, we may either make a TCP/IP
394 // preconnection, or merely pre-resolve the hostname via DNS (or even do
395 // nothing). The following are the threasholds for taking those actions.
396 static const double kPreconnectWorthyExpectedValue
;
397 static const double kDNSPreresolutionWorthyExpectedValue
;
398 // Referred hosts with a subresource_use_rate_ that are less than the
399 // following threshold will be discarded when we Trim() the list.
400 static const double kDiscardableExpectedValue
;
401 // During trimming operation to discard hosts for which we don't have likely
402 // subresources, we multiply the expected_subresource_use_ value by the
403 // following ratio until that value is less than kDiscardableExpectedValue.
404 // This number should always be less than 1, an more than 0.
405 static const double kReferrerTrimRatio
;
407 // Interval between periodic trimming of our whole referrer list.
408 // We only do a major trimming about once an hour, and then only when the user
409 // is actively browsing.
410 static const int64 kDurationBetweenTrimmingsHours
;
411 // Interval between incremental trimmings (to avoid inducing Jank).
412 static const int64 kDurationBetweenTrimmingIncrementsSeconds
;
413 // Number of referring URLs processed in an incremental trimming.
414 static const size_t kUrlsTrimmedPerIncrement
;
416 // Only for testing. Returns true if hostname has been successfully resolved
418 bool WasFound(const GURL
& url
) const {
419 Results::const_iterator
it(results_
.find(url
));
420 return (it
!= results_
.end()) &&
421 it
->second
.was_found();
424 // Only for testing. Return how long was the resolution
425 // or UrlInfo::NullDuration() if it hasn't been resolved yet.
426 base::TimeDelta
GetResolutionDuration(const GURL
& url
) {
427 if (results_
.find(url
) == results_
.end())
428 return UrlInfo::NullDuration();
429 return results_
[url
].resolve_duration();
433 size_t peak_pending_lookups() const { return peak_pending_lookups_
; }
435 // These two members call the appropriate global functions in
436 // prediction_options.cc depending on which thread they are called on.
437 virtual bool CanPrefetchAndPrerender() const;
438 virtual bool CanPreresolveAndPreconnect() const;
440 // ------------- Start IO thread methods.
442 // Perform actual resolution or preconnection to subresources now. This is
443 // an internal worker method that is reached via a post task from
444 // PredictFrameSubresources().
445 void PrepareFrameSubresources(const GURL
& url
,
446 const GURL
& first_party_for_cookies
);
448 // Access method for use by async lookup request to pass resolution result.
449 void OnLookupFinished(LookupRequest
* request
, const GURL
& url
, bool found
);
451 // Underlying method for both async and synchronous lookup to update state.
452 void LookupFinished(LookupRequest
* request
,
453 const GURL
& url
, bool found
);
455 // Queue hostname for resolution. If queueing was done, return the pointer
456 // to the queued instance, otherwise return NULL. If the proxy advisor is
457 // enabled, and |url| is likely to be proxied, the hostname will not be
458 // queued as the browser is not expected to fetch it directly.
459 UrlInfo
* AppendToResolutionQueue(const GURL
& url
,
460 UrlInfo::ResolutionMotivation motivation
);
462 // Check to see if too much queuing delay has been noted for the given info,
463 // which indicates that there is "congestion" or growing delay in handling the
464 // resolution of names. Rather than letting this congestion potentially grow
465 // without bounds, we abandon our queued efforts at pre-resolutions in such a
467 // To do this, we will recycle |info|, as well as all queued items, back to
468 // the state they had before they were queued up. We can't do anything about
469 // the resolutions we've already sent off for processing on another thread, so
470 // we just let them complete. On a slow system, subject to congestion, this
471 // will greatly reduce the number of resolutions done, but it will assure that
472 // any resolutions that are done, are in a timely and hence potentially
474 bool CongestionControlPerformed(UrlInfo
* info
);
476 // Take lookup requests from work_queue_ and tell HostResolver to look them up
477 // asynchronously, provided we don't exceed concurrent resolution limit.
478 void StartSomeQueuedResolutions();
480 // Performs trimming similar to TrimReferrersNow(), except it does it as a
481 // series of short tasks by posting continuations again an again until done.
482 void TrimReferrers();
484 // Loads urls_being_trimmed_ from keys of current referrers_.
485 void LoadUrlsForTrimming();
487 // Posts a task to do additional incremental trimming of referrers_.
488 void PostIncrementalTrimTask();
490 // Calls Trim() on some or all of urls_being_trimmed_.
491 // If it does not process all the URLs in that vector, it posts a task to
492 // continue with them shortly (i.e., it yeilds and continues).
493 void IncrementalTrimReferrers(bool trim_all_now
);
495 // If we can determine immediately (i.e. synchronously) that requests to this
496 // URL would likely go through a proxy, then return true. Otherwise, return
497 // false. This is used to avoid issuing DNS requests when a fixed proxy
498 // configuration is in place, which improves efficiency, and is also important
499 // if the unproxied DNS may contain incorrect entries.
500 bool WouldLikelyProxyURL(const GURL
& url
);
502 // Applies the HSTS redirect for |url|, if any.
503 GURL
GetHSTSRedirectOnIOThread(const GURL
& url
);
505 // ------------- End IO thread methods.
507 scoped_ptr
<InitialObserver
> initial_observer_
;
509 // Reference to URLRequestContextGetter from the Profile which owns the
510 // predictor. Used by Preconnect.
511 scoped_refptr
<net::URLRequestContextGetter
> url_request_context_getter_
;
513 // Status of speculative DNS resolution and speculative TCP/IP connection
514 // feature. This is false if and only if disabled by a command line switch.
515 const bool predictor_enabled_
;
517 // This is set by InitNetworkPredictor and used for calling
518 // CanPrefetchAndPrerenderUI and CanPreresolveAndPreconnectUI.
519 PrefService
* user_prefs_
;
521 // This is set by InitNetworkPredictor and used for calling
522 // CanPrefetchAndPrerenderIO and CanPreresolveAndPreconnectIO.
523 ProfileIOData
* profile_io_data_
;
525 // work_queue_ holds a list of names we need to look up.
526 HostNameQueue work_queue_
;
528 // results_ contains information for existing/prior prefetches.
531 std::set
<LookupRequest
*> pending_lookups_
;
533 // For testing, to verify that we don't exceed the limit.
534 size_t peak_pending_lookups_
;
536 // When true, we don't make new lookup requests.
539 // The number of concurrent speculative lookups currently allowed to be sent
540 // to the resolver. Any additional lookups will be queued to avoid exceeding
541 // this value. The queue is a priority queue that will accelerate
542 // sub-resource speculation, and retard resolutions suggested by page scans.
543 const size_t max_concurrent_dns_lookups_
;
545 // The maximum queueing delay that is acceptable before we enter congestion
546 // reduction mode, and discard all queued (but not yet assigned) resolutions.
547 const base::TimeDelta max_dns_queue_delay_
;
549 // The host resolver we warm DNS entries for.
550 net::HostResolver
* host_resolver_
;
552 // The TransportSecurityState instance we query HSTS redirects from.
553 net::TransportSecurityState
* transport_security_state_
;
555 // The SSLConfigService we query SNI support from (used in querying HSTS
557 net::SSLConfigService
* ssl_config_service_
;
559 // The ProxyService, used to determine whether preresolve is useful.
560 net::ProxyService
* proxy_service_
;
562 // Are we currently using preconnection, rather than just DNS resolution, for
563 // subresources and omni-box search URLs.
564 // This is false if and only if disabled by a command line switch.
565 const bool preconnect_enabled_
;
567 // Most recent suggestion from Omnibox provided via AnticipateOmniboxUrl().
568 std::string last_omnibox_host_
;
570 // The time when the last preresolve was done for last_omnibox_host_.
571 base::TimeTicks last_omnibox_preresolve_
;
573 // The number of consecutive requests to AnticipateOmniboxUrl() that suggested
574 // preconnecting (because it was to a search service).
575 int consecutive_omnibox_preconnect_count_
;
577 // The time when the last preconnection was requested to a search service.
578 base::TimeTicks last_omnibox_preconnect_
;
580 // For each URL that we might navigate to (that we've "learned about")
581 // we have a Referrer list. Each Referrer list has all hostnames we might
582 // need to pre-resolve or pre-connect to when there is a navigation to the
583 // orginial hostname.
584 Referrers referrers_
;
586 // List of URLs in referrers_ currently being trimmed (scaled down to
587 // eventually be aged out of use).
588 std::vector
<GURL
> urls_being_trimmed_
;
590 // A time after which we need to do more trimming of referrers.
591 base::TimeTicks next_trim_time_
;
593 // An observer for testing.
594 PredictorObserver
* observer_
;
596 scoped_ptr
<base::WeakPtrFactory
<Predictor
> > weak_factory_
;
598 DISALLOW_COPY_AND_ASSIGN(Predictor
);
601 // This version of the predictor is used for testing.
602 class SimplePredictor
: public Predictor
{
604 explicit SimplePredictor(bool preconnect_enabled
, bool predictor_enabled
)
605 : Predictor(preconnect_enabled
, predictor_enabled
) {}
606 ~SimplePredictor() override
{}
607 void InitNetworkPredictor(PrefService
* user_prefs
,
608 PrefService
* local_state
,
610 net::URLRequestContextGetter
* getter
,
611 ProfileIOData
* profile_io_data
) override
;
612 void ShutdownOnUIThread() override
;
615 // These member functions return True for unittests.
616 bool CanPrefetchAndPrerender() const override
;
617 bool CanPreresolveAndPreconnect() const override
;
620 } // namespace chrome_browser_net
622 #endif // CHROME_BROWSER_NET_PREDICTOR_H_