1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
|
// Copyright 2008, Google Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#ifndef CHROME_BROWSER_SAFE_BROWSING_PROTOCOL_MANAGER_H__
#define CHROME_BROWSER_SAFE_BROWSING_PROTOCOL_MANAGER_H__
// A class that implements Chrome's interface with the SafeBrowsing protocol.
// The SafeBrowsingProtocolManager handles formatting and making requests of,
// and handling responses from, Google's SafeBrowsing servers. This class uses
// The SafeBrowsingProtocolParser class to do the actual parsing.
#include <deque>
#include <hash_map>
#include <string>
#include <vector>
#include "base/scoped_ptr.h"
#include "base/time.h"
#include "chrome/browser/url_fetcher.h"
#include "chrome/browser/safe_browsing/chunk_range.h"
#include "chrome/browser/safe_browsing/protocol_parser.h"
#include "chrome/browser/safe_browsing/safe_browsing_service.h"
#include "chrome/browser/safe_browsing/safe_browsing_util.h"
#include "net/url_request/url_request.h"
class MessageLoop;
class Task;
class Timer;
class SafeBrowsingProtocolManager : public URLFetcher::Delegate {
// Testing friends:
friend class SafeBrowsingProtocolManagerTest_TestBackOffTimes_Test;
friend class SafeBrowsingProtocolManagerTest_TestChunkStrings_Test;
friend class SafeBrowsingProtocolManagerTest_TestGetHashBackOffTimes_Test;
public:
SafeBrowsingProtocolManager(SafeBrowsingService* sb_service,
MessageLoop* notify_loop,
const std::string& client_key,
const std::string& wrapped_key);
~SafeBrowsingProtocolManager();
// Set up the update schedule and internal state for making periodic requests
// of the SafeBrowsing service.
void Initialize();
// URLFetcher::Delegate interface.
virtual void OnURLFetchComplete(const URLFetcher* source,
const GURL& url,
const URLRequestStatus& status,
int response_code,
const ResponseCookies& cookies,
const std::string& data);
// API used by the SafeBrowsingService for issuing queries. When the results
// are available, SafeBrowsingService::HandleGetHashResults is called.
void GetFullHash(SafeBrowsingService::SafeBrowsingCheck* check,
const std::vector<SBPrefix>& prefixes);
// Scheduled update callback.
void GetNextUpdate();
// Called by the SafeBrowsingService when our request for a list of all chunks
// for each list is done. If database_error is true, that means the protocol
// manager shouldn't fetch updates since they can't be written to disk. It
// should try again later to open the database.
void OnGetChunksComplete(const std::vector<SBListChunkRanges>& list,
bool database_error);
// Called after the chunks that were parsed were inserted in the database.
void OnChunkInserted();
// The last time we received an update.
Time last_update() const { return last_update_; }
private:
// Internal API for fetching information from the SafeBrowsing servers. The
// GetHash requests are higher priority since they can block user requests
// so are handled separately.
enum SafeBrowsingRequestType {
NO_REQUEST = 0, // No requests in progress
UPDATE_REQUEST, // Request for redirect URLs
CHUNK_REQUEST, // Request for a specific chunk
GETKEY_REQUEST // Update the client's MAC key
};
// Returns the time (in milliseconds) for the next update request. If
// 'back_off' is true, the time returned will increment an error count and
// return the appriate next time (see ScheduleNextUpdate below).
int GetNextUpdateTime(bool back_off);
// Worker function for calculating GetHash and Update backoff times (in
// seconds). 'Multiplier' is doubled for each consecutive error between the
// 2nd and 5th, and 'error_count' is incremented with each call.
int GetNextBackOffTime(int* error_count, int* multiplier);
// Manage our update with the next allowable update time. If 'back_off_' is
// true, we must decrease the frequency of requests of the SafeBrowsing
// service according to section 5 of the protocol specification.
void ScheduleNextUpdate(bool back_off);
// Send a request for a list of chunks we should download to the SafeBrowsing
// servers. In order to format this request, we need to send all the chunk
// numbers for each list that we have to the server. Getting the chunk numbers
// requires a database query (run on the database thread), and the request
// is sent upon completion of that query in OnGetChunksComplete.
void IssueUpdateRequest();
// Send a request for a chunk to the SafeBrowsing servers.
void IssueChunkRequest();
// Get a key from the SafeBrowsing servers for use with MAC. This should only
// be called once per client unless the server directly tells us to update.
void IssueKeyRequest();
// Format a string returned from the database into:
// "list_name;a:<add_chunk_ranges>:s:<sub_chunk_ranges>:mac\n"
static std::string FormatList(const SBListChunkRanges& list, bool use_mac);
// Run the protocol parser on received data and update the SafeBrowsingService
// with the new content. Returns 'true' on successful parse, 'false' on error.
bool HandleServiceResponse(const GURL& url, const char* data, int length);
// If the SafeBrowsing service wants us to re-key, we clear our key state and
// issue the request.
void HandleReKey();
// Update internal state for each GetHash response error.
void HandleGetHashError();
private:
// Main SafeBrowsing interface object.
SafeBrowsingService* sb_service_;
// Current active request (in case we need to cancel) for updates or chunks
// from the SafeBrowsing service. We can only have one of these outstanding
// at any given time unlike GetHash requests, which are tracked separately.
scoped_ptr<URLFetcher> request_;
// The kind of request that is currently in progress.
SafeBrowsingRequestType request_type_;
// The number of HTTP response errors, used for request backoff timing.
int update_error_count_;
int gethash_error_count_;
// Multipliers which double (max == 8) for each error after the second.
int update_back_off_mult_;
int gethash_back_off_mult_;
// Multiplier between 0 and 1 to spread clients over an interval.
float back_off_fuzz_;
// The list for which we are make a request.
std::string list_name_;
// For managing the next earliest time to query the SafeBrowsing servers for
// updates.
int next_update_sec_;
scoped_ptr<Task> update_task_;
scoped_ptr<Timer> update_timer_;
// All chunk requests that need to be made, along with their MAC.
std::deque<ChunkUrl> chunk_request_urls_;
// Map of GetHash requests.
typedef stdext::hash_map<const URLFetcher*,
SafeBrowsingService::SafeBrowsingCheck*> HashRequests;
HashRequests hash_requests_;
// The next scheduled update has special behavior for the first 2 requests.
enum UpdateRequestState {
FIRST_REQUEST = 0,
SECOND_REQUEST,
NORMAL_REQUEST
};
UpdateRequestState update_state_;
// We'll attempt to get keys once per browser session if we don't already have
// them. They are not essential to operation, but provide a layer of
// verification.
bool initial_request_;
// True if the service has been given an add/sub chunk but it hasn't been
// added to the database yet.
bool chunk_pending_to_write_;
// Message loop for forwarding MAC keys to the SafeBrowsingService for
// storage.
MessageLoop* notify_loop_;
// The keys used for MAC. Empty keys mean we aren't using MAC.
std::string client_key_;
std::string wrapped_key_;
// The last time we successfully received an update.
Time last_update_;
// While in GetHash backoff, we can't make another GetHash until this time.
Time next_gethash_time_;
DISALLOW_EVIL_CONSTRUCTORS(SafeBrowsingProtocolManager);
};
#endif // CHROME_BROWSER_SAFE_BROWSING_PROTOCOL_MANAGER_H__
|