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/spdyproxy/proxy_advisor.h"
34 #include "chrome/browser/net/timed_cache.h"
35 #include "chrome/browser/net/url_info.h"
36 #include "chrome/common/net/predictor_common.h"
37 #include "net/base/host_port_pair.h"
51 class SSLConfigService
;
53 class TransportSecurityState
;
54 class URLRequestContextGetter
;
57 namespace user_prefs
{
58 class PrefRegistrySyncable
;
61 namespace chrome_browser_net
{
63 typedef chrome_common_net::UrlList UrlList
;
64 typedef chrome_common_net::NameList NameList
;
65 typedef std::map
<GURL
, UrlInfo
> Results
;
67 // An observer for testing.
68 class PredictorObserver
{
70 virtual ~PredictorObserver() {}
72 virtual void OnPreconnectUrl(const GURL
& original_url
,
73 const GURL
& first_party_for_cookies
,
74 UrlInfo::ResolutionMotivation motivation
,
78 // Predictor is constructed during Profile construction (on the UI thread),
79 // but it is destroyed on the IO thread when ProfileIOData goes away. All of
80 // its core state and functionality happens on the IO thread. The only UI
81 // methods are initialization / shutdown related (including preconnect
82 // initialization), or convenience methods that internally forward calls to
86 // A version number for prefs that are saved. This should be incremented when
87 // we change the format so that we discard old data.
88 static const int kPredictorReferrerVersion
;
90 // Given that the underlying Chromium resolver defaults to a total maximum of
91 // 8 paralell resolutions, we will avoid any chance of starving navigational
92 // resolutions by limiting the number of paralell speculative resolutions.
93 // This is used in the field trials and testing.
94 // TODO(jar): Move this limitation into the resolver.
95 static const size_t kMaxSpeculativeParallelResolves
;
97 // To control the congestion avoidance system, we need an estimate of how
98 // many speculative requests may arrive at once. Since we currently only
99 // keep 8 subresource names for each frame, we'll use that as our basis.
100 // Note that when scanning search results lists, we might actually get 10 at
101 // a time, and wikipedia can often supply (during a page scan) upwards of 50.
102 // In those odd cases, we may discard some of the later speculative requests
103 // mistakenly assuming that the resolutions took too long.
104 static const int kTypicalSpeculativeGroupSize
;
106 // The next constant specifies an amount of queueing delay that is
107 // "too large," and indicative of problems with resolutions (perhaps due to
108 // an overloaded router, or such). When we exceed this delay, congestion
109 // avoidance will kick in and all speculations in the queue will be discarded.
110 static const int kMaxSpeculativeResolveQueueDelayMs
;
112 // We don't bother learning to preconnect via a GET if the original URL
113 // navigation was so long ago, that a preconnection would have been dropped
114 // anyway. We believe most servers will drop the connection in 10 seconds, so
115 // we currently estimate this time-till-drop at 10 seconds.
116 // TODO(jar): We should do a persistent field trial to validate/optimize this.
117 static const int kMaxUnusedSocketLifetimeSecondsWithoutAGet
;
119 // |max_concurrent| specifies how many concurrent (parallel) prefetches will
120 // be performed. Host lookups will be issued through |host_resolver|.
121 explicit Predictor(bool preconnect_enabled
, bool predictor_enabled
);
123 virtual ~Predictor();
125 // This function is used to create a predictor. For testing, we can create
126 // a version which does a simpler shutdown.
127 static Predictor
* CreatePredictor(bool preconnect_enabled
,
128 bool predictor_enabled
,
129 bool simple_shutdown
);
131 static void RegisterProfilePrefs(user_prefs::PrefRegistrySyncable
* registry
);
133 // ------------- Start UI thread methods.
135 virtual void InitNetworkPredictor(PrefService
* user_prefs
,
136 PrefService
* local_state
,
138 net::URLRequestContextGetter
* getter
,
139 ProfileIOData
* profile_io_data
);
141 // The Omnibox has proposed a given url to the user, and if it is a search
142 // URL, then it also indicates that this is preconnectable (i.e., we could
143 // preconnect to the search server).
144 void AnticipateOmniboxUrl(const GURL
& url
, bool preconnectable
);
146 // Preconnect a URL and all of its subresource domains.
147 void PreconnectUrlAndSubresources(const GURL
& url
,
148 const GURL
& first_party_for_cookies
);
150 static UrlList
GetPredictedUrlListAtStartup(PrefService
* user_prefs
,
151 PrefService
* local_state
);
153 static void set_max_queueing_delay(int max_queueing_delay_ms
);
155 static void set_max_parallel_resolves(size_t max_parallel_resolves
);
157 virtual void ShutdownOnUIThread();
159 // ------------- End UI thread methods.
161 // ------------- Start IO thread methods.
163 // Cancel pending requests and prevent new ones from being made.
166 // In some circumstances, for privacy reasons, all results should be
167 // discarded. This method gracefully handles that activity.
168 // Destroy all our internal state, which shows what names we've looked up, and
169 // how long each has taken, etc. etc. We also destroy records of suggesses
170 // (cache hits etc.).
171 void DiscardAllResults();
173 // Add hostname(s) to the queue for processing.
174 void ResolveList(const UrlList
& urls
,
175 UrlInfo::ResolutionMotivation motivation
);
177 void Resolve(const GURL
& url
, UrlInfo::ResolutionMotivation motivation
);
179 // Record details of a navigation so that we can preresolve the host name
180 // ahead of time the next time the users navigates to the indicated host.
181 // Should only be called when urls are distinct, and they should already be
182 // canonicalized to not have a path.
183 void LearnFromNavigation(const GURL
& referring_url
, const GURL
& target_url
);
185 // When displaying info in about:dns, the following API is called.
186 static void PredictorGetHtmlInfo(Predictor
* predictor
, std::string
* output
);
188 // Dump HTML table containing list of referrers for about:dns.
189 void GetHtmlReferrerLists(std::string
* output
);
191 // Dump the list of currently known referrer domains and related prefetchable
192 // domains for about:dns.
193 void GetHtmlInfo(std::string
* output
);
195 // Discards any referrer for which all the suggested host names are currently
196 // annotated with negligible expected-use. Scales down (diminishes) the
197 // expected-use of those that remain, so that their use will go down by a
198 // factor each time we trim (moving the referrer closer to being discarded in
200 // The task is performed synchronously and completes before returing.
201 void TrimReferrersNow();
203 // Construct a ListValue object that contains all the data in the referrers_
204 // so that it can be persisted in a pref.
205 void SerializeReferrers(base::ListValue
* referral_list
);
207 // Process a ListValue that contains all the data from a previous reference
208 // list, as constructed by SerializeReferrers(), and add all the identified
209 // values into the current referrer list.
210 void DeserializeReferrers(const base::ListValue
& referral_list
);
212 void DeserializeReferrersThenDelete(base::ListValue
* referral_list
);
214 void DiscardInitialNavigationHistory();
216 void FinalizeInitializationOnIOThread(
217 const std::vector
<GURL
>& urls_to_prefetch
,
218 base::ListValue
* referral_list
,
220 ProfileIOData
* profile_io_data
);
222 // During startup, we learn what the first N urls visited are, and then
223 // resolve the associated hosts ASAP during our next startup.
224 void LearnAboutInitialNavigation(const GURL
& url
);
226 // Renderer bundles up list and sends to this browser API via IPC.
227 // TODO(jar): Use UrlList instead to include port and scheme.
228 void DnsPrefetchList(const NameList
& hostnames
);
230 // May be called from either the IO or UI thread and will PostTask
231 // to the IO thread if necessary.
232 void DnsPrefetchMotivatedList(const UrlList
& urls
,
233 UrlInfo::ResolutionMotivation motivation
);
235 // May be called from either the IO or UI thread and will PostTask
236 // to the IO thread if necessary.
237 void SaveStateForNextStartupAndTrim();
239 void SaveDnsPrefetchStateForNextStartupAndTrim(
240 base::ListValue
* startup_list
,
241 base::ListValue
* referral_list
,
242 base::WaitableEvent
* completion
);
244 // May be called from either the IO or UI thread and will PostTask
245 // to the IO thread if necessary.
246 void PreconnectUrl(const GURL
& url
, const GURL
& first_party_for_cookies
,
247 UrlInfo::ResolutionMotivation motivation
, int count
);
249 void PreconnectUrlOnIOThread(const GURL
& url
,
250 const GURL
& first_party_for_cookies
,
251 UrlInfo::ResolutionMotivation motivation
,
254 // ------------- End IO thread methods.
256 // The following methods may be called on either the IO or UI threads.
258 // Instigate pre-connection to any URLs, or pre-resolution of related host,
259 // that we predict will be needed after this navigation (typically
260 // more-embedded resources on a page). This method will actually post a task
261 // to do the actual work, so as not to jump ahead of the frame navigation that
262 // instigated this activity.
263 void PredictFrameSubresources(const GURL
& url
,
264 const GURL
& first_party_for_cookies
);
266 // Put URL in canonical form, including a scheme, host, and port.
267 // Returns GURL::EmptyGURL() if the scheme is not http/https or if the url
268 // cannot be otherwise canonicalized.
269 static GURL
CanonicalizeUrl(const GURL
& url
);
272 void SetHostResolver(net::HostResolver
* host_resolver
) {
273 host_resolver_
= host_resolver
;
276 void SetTransportSecurityState(
277 net::TransportSecurityState
* transport_security_state
) {
278 transport_security_state_
= transport_security_state
;
281 void SetProxyAdvisor(ProxyAdvisor
* proxy_advisor
) {
282 proxy_advisor_
.reset(proxy_advisor
);
285 size_t max_concurrent_dns_lookups() const {
286 return max_concurrent_dns_lookups_
;
289 void SetShutdown(bool shutdown
) {
290 shutdown_
= shutdown
;
293 void SetObserver(PredictorObserver
* observer
) {
294 observer_
= observer
;
297 ProfileIOData
* profile_io_data() const {
298 return profile_io_data_
;
301 bool preconnect_enabled() const {
302 return preconnect_enabled_
;
305 bool predictor_enabled() const {
306 return predictor_enabled_
;
311 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, BenefitLookupTest
);
312 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, ShutdownWhenResolutionIsPendingTest
);
313 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, SingleLookupTest
);
314 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, ConcurrentLookupTest
);
315 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, MassiveConcurrentLookupTest
);
316 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, PriorityQueuePushPopTest
);
317 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, PriorityQueueReorderTest
);
318 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, ReferrerSerializationTrimTest
);
319 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, SingleLookupTestWithDisabledAdvisor
);
320 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, SingleLookupTestWithEnabledAdvisor
);
321 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, TestSimplePreconnectAdvisor
);
322 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, NoProxyService
);
323 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, ProxyDefinitelyEnabled
);
324 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, ProxyDefinitelyNotEnabled
);
325 FRIEND_TEST_ALL_PREFIXES(PredictorTest
, ProxyMaybeEnabled
);
326 friend class WaitForResolutionHelper
; // For testing.
330 // A simple priority queue for handling host names.
331 // Some names that are queued up have |motivation| that requires very rapid
332 // handling. For example, a sub-resource name lookup MUST be done before the
333 // actual sub-resource is fetched. In contrast, a name that was speculatively
334 // noted in a page has to be resolved before the user "gets around to"
335 // clicking on a link. By tagging (with a motivation) each push we make into
336 // this FIFO queue, the queue can re-order the more important names to service
337 // them sooner (relative to some low priority background resolutions).
338 class HostNameQueue
{
342 void Push(const GURL
& url
,
343 UrlInfo::ResolutionMotivation motivation
);
344 bool IsEmpty() const;
348 // The names in the queue that should be serviced (popped) ASAP.
349 std::queue
<GURL
> rush_queue_
;
350 // The names in the queue that should only be serviced when rush_queue is
352 std::queue
<GURL
> background_queue_
;
354 DISALLOW_COPY_AND_ASSIGN(HostNameQueue
);
357 // The InitialObserver monitors navigations made by the network stack. This
358 // is only used to identify startup time resolutions (for re-resolution
359 // during our next process startup).
360 // TODO(jar): Consider preconnecting at startup, which may be faster than
361 // waiting for render process to start and request a connection.
362 class InitialObserver
{
366 // Recording of when we observed each navigation.
367 typedef std::map
<GURL
, base::TimeTicks
> FirstNavigations
;
369 // Potentially add a new URL to our startup list.
370 void Append(const GURL
& url
, Predictor
* predictor
);
372 // Get an HTML version of our current planned first_navigations_.
373 void GetFirstResolutionsHtml(std::string
* output
);
375 // Persist the current first_navigations_ for storage in a list.
376 void GetInitialDnsResolutionList(base::ListValue
* startup_list
);
378 // Discards all initial loading history.
379 void DiscardInitialNavigationHistory() { first_navigations_
.clear(); }
382 // List of the first N URL resolutions observed in this run.
383 FirstNavigations first_navigations_
;
385 // The number of URLs we'll save for pre-resolving at next startup.
386 static const size_t kStartupResolutionCount
= 10;
389 // A map that is keyed with the host/port that we've learned were the cause
390 // of loading additional URLs. The list of additional targets is held
391 // in a Referrer instance, which is a value in this map.
392 typedef std::map
<GURL
, Referrer
> Referrers
;
394 // Depending on the expected_subresource_use_, we may either make a TCP/IP
395 // preconnection, or merely pre-resolve the hostname via DNS (or even do
396 // nothing). The following are the threasholds for taking those actions.
397 static const double kPreconnectWorthyExpectedValue
;
398 static const double kDNSPreresolutionWorthyExpectedValue
;
399 // Referred hosts with a subresource_use_rate_ that are less than the
400 // following threshold will be discarded when we Trim() the list.
401 static const double kDiscardableExpectedValue
;
402 // During trimming operation to discard hosts for which we don't have likely
403 // subresources, we multiply the expected_subresource_use_ value by the
404 // following ratio until that value is less than kDiscardableExpectedValue.
405 // This number should always be less than 1, an more than 0.
406 static const double kReferrerTrimRatio
;
408 // Interval between periodic trimming of our whole referrer list.
409 // We only do a major trimming about once an hour, and then only when the user
410 // is actively browsing.
411 static const int64 kDurationBetweenTrimmingsHours
;
412 // Interval between incremental trimmings (to avoid inducing Jank).
413 static const int64 kDurationBetweenTrimmingIncrementsSeconds
;
414 // Number of referring URLs processed in an incremental trimming.
415 static const size_t kUrlsTrimmedPerIncrement
;
417 // Only for testing. Returns true if hostname has been successfully resolved
419 bool WasFound(const GURL
& url
) const {
420 Results::const_iterator
it(results_
.find(url
));
421 return (it
!= results_
.end()) &&
422 it
->second
.was_found();
425 // Only for testing. Return how long was the resolution
426 // or UrlInfo::NullDuration() if it hasn't been resolved yet.
427 base::TimeDelta
GetResolutionDuration(const GURL
& url
) {
428 if (results_
.find(url
) == results_
.end())
429 return UrlInfo::NullDuration();
430 return results_
[url
].resolve_duration();
434 size_t peak_pending_lookups() const { return peak_pending_lookups_
; }
436 // If a proxy advisor is defined, let it know that |url| will be prefetched or
437 // preconnected to. Can be called on either UI or IO threads and will post to
438 // the IO thread if necessary, invoking AdviseProxyOnIOThread().
439 void AdviseProxy(const GURL
& url
,
440 UrlInfo::ResolutionMotivation motivation
,
443 // These two members call the appropriate global functions in
444 // prediction_options.cc depending on which thread they are called on.
445 virtual bool CanPrefetchAndPrerender() const;
446 virtual bool CanPreresolveAndPreconnect() const;
448 // ------------- Start IO thread methods.
450 // Perform actual resolution or preconnection to subresources now. This is
451 // an internal worker method that is reached via a post task from
452 // PredictFrameSubresources().
453 void PrepareFrameSubresources(const GURL
& url
,
454 const GURL
& first_party_for_cookies
);
456 // Access method for use by async lookup request to pass resolution result.
457 void OnLookupFinished(LookupRequest
* request
, const GURL
& url
, bool found
);
459 // Underlying method for both async and synchronous lookup to update state.
460 void LookupFinished(LookupRequest
* request
,
461 const GURL
& url
, bool found
);
463 // Queue hostname for resolution. If queueing was done, return the pointer
464 // to the queued instance, otherwise return NULL. If the proxy advisor is
465 // enabled, and |url| is likely to be proxied, the hostname will not be
466 // queued as the browser is not expected to fetch it directly.
467 UrlInfo
* AppendToResolutionQueue(const GURL
& url
,
468 UrlInfo::ResolutionMotivation motivation
);
470 // Check to see if too much queuing delay has been noted for the given info,
471 // which indicates that there is "congestion" or growing delay in handling the
472 // resolution of names. Rather than letting this congestion potentially grow
473 // without bounds, we abandon our queued efforts at pre-resolutions in such a
475 // To do this, we will recycle |info|, as well as all queued items, back to
476 // the state they had before they were queued up. We can't do anything about
477 // the resolutions we've already sent off for processing on another thread, so
478 // we just let them complete. On a slow system, subject to congestion, this
479 // will greatly reduce the number of resolutions done, but it will assure that
480 // any resolutions that are done, are in a timely and hence potentially
482 bool CongestionControlPerformed(UrlInfo
* info
);
484 // Take lookup requests from work_queue_ and tell HostResolver to look them up
485 // asynchronously, provided we don't exceed concurrent resolution limit.
486 void StartSomeQueuedResolutions();
488 // Performs trimming similar to TrimReferrersNow(), except it does it as a
489 // series of short tasks by posting continuations again an again until done.
490 void TrimReferrers();
492 // Loads urls_being_trimmed_ from keys of current referrers_.
493 void LoadUrlsForTrimming();
495 // Posts a task to do additional incremental trimming of referrers_.
496 void PostIncrementalTrimTask();
498 // Calls Trim() on some or all of urls_being_trimmed_.
499 // If it does not process all the URLs in that vector, it posts a task to
500 // continue with them shortly (i.e., it yeilds and continues).
501 void IncrementalTrimReferrers(bool trim_all_now
);
503 // If a proxy advisor is defined, let it know that |url| will be prefetched or
505 void AdviseProxyOnIOThread(const GURL
& url
,
506 UrlInfo::ResolutionMotivation motivation
,
509 // If we can determine immediately (i.e. synchronously) that requests to this
510 // URL would likely go through a proxy, then return true. Otherwise, return
511 // false. This is used to avoid issuing DNS requests when a fixed proxy
512 // configuration is in place, which improves efficiency, and is also important
513 // if the unproxied DNS may contain incorrect entries.
514 bool WouldLikelyProxyURL(const GURL
& url
);
516 // Applies the HSTS redirect for |url|, if any.
517 GURL
GetHSTSRedirectOnIOThread(const GURL
& url
);
519 // ------------- End IO thread methods.
521 scoped_ptr
<InitialObserver
> initial_observer_
;
523 // Reference to URLRequestContextGetter from the Profile which owns the
524 // predictor. Used by Preconnect.
525 scoped_refptr
<net::URLRequestContextGetter
> url_request_context_getter_
;
527 // Status of speculative DNS resolution and speculative TCP/IP connection
528 // feature. This is false if and only if disabled by a command line switch.
529 const bool predictor_enabled_
;
531 // This is set by InitNetworkPredictor and used for calling
532 // CanPrefetchAndPrerenderUI and CanPreresolveAndPreconnectUI.
533 PrefService
* user_prefs_
;
535 // This is set by InitNetworkPredictor and used for calling
536 // CanPrefetchAndPrerenderIO and CanPreresolveAndPreconnectIO.
537 ProfileIOData
* profile_io_data_
;
539 // work_queue_ holds a list of names we need to look up.
540 HostNameQueue work_queue_
;
542 // results_ contains information for existing/prior prefetches.
545 std::set
<LookupRequest
*> pending_lookups_
;
547 // For testing, to verify that we don't exceed the limit.
548 size_t peak_pending_lookups_
;
550 // When true, we don't make new lookup requests.
553 // The number of concurrent speculative lookups currently allowed to be sent
554 // to the resolver. Any additional lookups will be queued to avoid exceeding
555 // this value. The queue is a priority queue that will accelerate
556 // sub-resource speculation, and retard resolutions suggested by page scans.
557 const size_t max_concurrent_dns_lookups_
;
559 // The maximum queueing delay that is acceptable before we enter congestion
560 // reduction mode, and discard all queued (but not yet assigned) resolutions.
561 const base::TimeDelta max_dns_queue_delay_
;
563 // The host resolver we warm DNS entries for.
564 net::HostResolver
* host_resolver_
;
566 // The TransportSecurityState instance we query HSTS redirects from.
567 net::TransportSecurityState
* transport_security_state_
;
569 // The SSLConfigService we query SNI support from (used in querying HSTS
571 net::SSLConfigService
* ssl_config_service_
;
573 // The ProxyService, used to determine whether preresolve is useful.
574 net::ProxyService
* proxy_service_
;
576 // Are we currently using preconnection, rather than just DNS resolution, for
577 // subresources and omni-box search URLs.
578 // This is false if and only if disabled by a command line switch.
579 const bool preconnect_enabled_
;
581 // Most recent suggestion from Omnibox provided via AnticipateOmniboxUrl().
582 std::string last_omnibox_host_
;
584 // The time when the last preresolve was done for last_omnibox_host_.
585 base::TimeTicks last_omnibox_preresolve_
;
587 // The number of consecutive requests to AnticipateOmniboxUrl() that suggested
588 // preconnecting (because it was to a search service).
589 int consecutive_omnibox_preconnect_count_
;
591 // The time when the last preconnection was requested to a search service.
592 base::TimeTicks last_omnibox_preconnect_
;
594 // For each URL that we might navigate to (that we've "learned about")
595 // we have a Referrer list. Each Referrer list has all hostnames we might
596 // need to pre-resolve or pre-connect to when there is a navigation to the
597 // orginial hostname.
598 Referrers referrers_
;
600 // List of URLs in referrers_ currently being trimmed (scaled down to
601 // eventually be aged out of use).
602 std::vector
<GURL
> urls_being_trimmed_
;
604 // A time after which we need to do more trimming of referrers.
605 base::TimeTicks next_trim_time_
;
607 scoped_ptr
<ProxyAdvisor
> proxy_advisor_
;
609 // An observer for testing.
610 PredictorObserver
* observer_
;
612 scoped_ptr
<base::WeakPtrFactory
<Predictor
> > weak_factory_
;
614 DISALLOW_COPY_AND_ASSIGN(Predictor
);
617 // This version of the predictor is used for testing.
618 class SimplePredictor
: public Predictor
{
620 explicit SimplePredictor(bool preconnect_enabled
, bool predictor_enabled
)
621 : Predictor(preconnect_enabled
, predictor_enabled
) {}
622 virtual ~SimplePredictor() {}
623 virtual void InitNetworkPredictor(
624 PrefService
* user_prefs
,
625 PrefService
* local_state
,
627 net::URLRequestContextGetter
* getter
,
628 ProfileIOData
* profile_io_data
) override
;
629 virtual void ShutdownOnUIThread() override
;
631 // These member functions return True for unittests.
632 virtual bool CanPrefetchAndPrerender() const override
;
633 virtual bool CanPreresolveAndPreconnect() const override
;
636 } // namespace chrome_browser_net
638 #endif // CHROME_BROWSER_NET_PREDICTOR_H_