Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(1115)

Side by Side Diff: components/offline_pages/background/pick_request_task.cc

Issue 2473553004: Request Picker task (Closed)
Patch Set: CR feedback per EStade, FGorski, and DougArnett Created 4 years, 1 month ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
OLDNEW
1 // Copyright 2016 The Chromium Authors. All rights reserved. 1 // Copyright 2016 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 #include "components/offline_pages/background/request_picker.h" 5 #include "components/offline_pages/background/pick_request_task.h"
6 6
7 #include "base/bind.h" 7 #include "base/bind.h"
8 #include "base/logging.h" 8 #include "base/logging.h"
9 #include "base/time/time.h"
10 #include "components/offline_pages/background/device_conditions.h"
11 #include "components/offline_pages/background/offliner_policy.h"
12 #include "components/offline_pages/background/request_coordinator_event_logger.h "
13 #include "components/offline_pages/background/request_notifier.h"
14 #include "components/offline_pages/background/request_queue_store.h"
9 #include "components/offline_pages/background/save_page_request.h" 15 #include "components/offline_pages/background/save_page_request.h"
10 16
11 namespace { 17 namespace {
12 template <typename T> 18 template <typename T>
13 int signum(T t) { 19 int signum(T t) {
14 return (T(0) < t) - (t < T(0)); 20 return (T(0) < t) - (t < T(0));
15 } 21 }
16 22
17 #define CALL_MEMBER_FUNCTION(object, ptrToMember) ((object)->*(ptrToMember)) 23 #define CALL_MEMBER_FUNCTION(object, ptrToMember) ((object)->*(ptrToMember))
18 } // namespace 24 } // namespace
19 25
20 namespace offline_pages { 26 namespace offline_pages {
21 27
22 RequestPicker::RequestPicker(RequestQueue* requestQueue, 28 PickRequestTask::PickRequestTask(RequestQueueStore* store,
23 OfflinerPolicy* policy, 29 OfflinerPolicy* policy,
24 RequestNotifier* notifier, 30 RequestNotifier* notifier,
25 RequestCoordinatorEventLogger* event_logger) 31 RequestCoordinatorEventLogger* event_logger,
26 : queue_(requestQueue), 32 RequestPickedCallback picked_callback,
33 RequestNotPickedCallback not_picked_callback,
34 DeviceConditions& device_conditions,
35 const std::set<int64_t>& disabled_requests)
36 : store_(store),
27 policy_(policy), 37 policy_(policy),
28 notifier_(notifier), 38 notifier_(notifier),
29 event_logger_(event_logger), 39 event_logger_(event_logger),
30 fewer_retries_better_(false), 40 picked_callback_(picked_callback),
31 earlier_requests_better_(false), 41 not_picked_callback_(not_picked_callback),
32 weak_ptr_factory_(this) {} 42 disabled_requests_(disabled_requests),
33 43 weak_ptr_factory_(this) {
34 RequestPicker::~RequestPicker() {} 44 device_conditions_.reset(new DeviceConditions(device_conditions));
35
36 // Entry point for the async operation to choose the next request.
37 void RequestPicker::ChooseNextRequest(
38 RequestCoordinator::RequestPickedCallback picked_callback,
39 RequestCoordinator::RequestNotPickedCallback not_picked_callback,
40 DeviceConditions* device_conditions,
41 const std::set<int64_t>& disabled_requests) {
42 picked_callback_ = picked_callback;
43 not_picked_callback_ = not_picked_callback;
44 fewer_retries_better_ = policy_->ShouldPreferUntriedRequests();
45 earlier_requests_better_ = policy_->ShouldPreferEarlierRequests();
46 current_conditions_.reset(new DeviceConditions(*device_conditions));
47 // Get all requests from queue (there is no filtering mechanism).
48 queue_->GetRequests(base::Bind(&RequestPicker::GetRequestResultCallback,
49 weak_ptr_factory_.GetWeakPtr(),
50 disabled_requests));
51 } 45 }
52 46
53 // When we get contents from the queue, use them to pick the next 47 PickRequestTask::~PickRequestTask() {}
54 // request to operate on (if any). 48
55 void RequestPicker::GetRequestResultCallback( 49 void PickRequestTask::Run() {
56 const std::set<int64_t>& disabled_requests, 50 // Get all the requests from the queue, we will classify them in the callback.
57 RequestQueue::GetRequestsResult, 51 store_->GetRequests(base::Bind(&PickRequestTask::ChooseAndPrune,
52 weak_ptr_factory_.GetWeakPtr()));
53 }
54
55 void PickRequestTask::ChooseAndPrune(
56 bool success,
58 std::vector<std::unique_ptr<SavePageRequest>> requests) { 57 std::vector<std::unique_ptr<SavePageRequest>> requests) {
59 // If there is nothing to do, return right away. 58 // If there is nothing to do, return right away.
60 if (requests.size() == 0) { 59 if (requests.size() == 0) {
61 not_picked_callback_.Run(false); 60 not_picked_callback_.Run(false);
61 TaskComplete();
62 return; 62 return;
63 } 63 }
64 64
65 // Get the expired requests to be removed from the queue, and the valid ones 65 // Get the expired requests to be removed from the queue, and the valid ones
66 // from which to pick the next request. 66 // from which to pick the next request.
67 std::vector<std::unique_ptr<SavePageRequest>> valid_requests; 67 std::vector<std::unique_ptr<SavePageRequest>> valid_requests;
68 std::vector<std::unique_ptr<SavePageRequest>> expired_requests;
69 SplitRequests(std::move(requests), &valid_requests, &expired_requests);
70 std::vector<int64_t> expired_request_ids; 68 std::vector<int64_t> expired_request_ids;
71 for (const auto& request : expired_requests) 69 SplitRequests(std::move(requests), &valid_requests, &expired_request_ids);
72 expired_request_ids.push_back(request->request_id());
73 70
74 queue_->RemoveRequests(expired_request_ids, 71 // Continue processing by choosing a request.
75 base::Bind(&RequestPicker::OnRequestExpired, 72 ChooseRequestAndCallback(std::move(valid_requests));
76 weak_ptr_factory_.GetWeakPtr()));
77 73
74 // Continue processing by handling expired requests, if any.
75 if (expired_request_ids.size() == 0) {
76 TaskComplete();
77 return;
78 }
79
80 RemoveStaleRequests(std::move(expired_request_ids));
81 }
82
83 void PickRequestTask::ChooseRequestAndCallback(
84 std::vector<std::unique_ptr<SavePageRequest>> valid_requests) {
78 // Pick the most deserving request for our conditions. 85 // Pick the most deserving request for our conditions.
79 const SavePageRequest* picked_request = nullptr; 86 const SavePageRequest* picked_request = nullptr;
80 87
81 RequestCompareFunction comparator = nullptr; 88 RequestCompareFunction comparator = nullptr;
82 89
83 // Choose which comparison function to use based on policy. 90 // Choose which comparison function to use based on policy.
84 if (policy_->RetryCountIsMoreImportantThanRecency()) 91 if (policy_->RetryCountIsMoreImportantThanRecency())
85 comparator = &RequestPicker::RetryCountFirstCompareFunction; 92 comparator = &PickRequestTask::RetryCountFirstCompareFunction;
86 else 93 else
87 comparator = &RequestPicker::RecencyFirstCompareFunction; 94 comparator = &PickRequestTask::RecencyFirstCompareFunction;
95
96 // TODO(petewil): Consider replacing this bool with a better named enum.
97 bool non_user_requested_tasks_remaining = false;
88 98
89 // Iterate once through the requests, keeping track of best candidate. 99 // Iterate once through the requests, keeping track of best candidate.
90 bool non_user_requested_tasks_remaining = false;
91 for (unsigned i = 0; i < valid_requests.size(); ++i) { 100 for (unsigned i = 0; i < valid_requests.size(); ++i) {
92 // If the request is on the disabled list, skip it. 101 // If the request is on the disabled list, skip it.
93 auto search = disabled_requests.find(valid_requests[i]->request_id()); 102 auto search = disabled_requests_.find(valid_requests[i]->request_id());
94 if (search != disabled_requests.end()) { 103 if (search != disabled_requests_.end())
95 continue; 104 continue;
96 } 105 // If there are non-user-requested tasks remaining, we need to make sure
106 // that they are scheduled when we run out of user requested tasks, so
fgorski 2016/11/10 19:15:50 Yes, but what if they don't satisfy the condition,
Pete Williamson 2016/11/10 23:43:25 We are using this flag to see if we need to make s
fgorski 2016/11/11 00:25:22 Looks better! Thanks.
107 // note that fact now.
97 if (!valid_requests[i]->user_requested()) 108 if (!valid_requests[i]->user_requested())
98 non_user_requested_tasks_remaining = true; 109 non_user_requested_tasks_remaining = true;
99 if (!RequestConditionsSatisfied(valid_requests[i].get())) 110 if (!RequestConditionsSatisfied(valid_requests[i].get()))
100 continue; 111 continue;
101 if (IsNewRequestBetter(picked_request, valid_requests[i].get(), comparator)) 112 if (IsNewRequestBetter(picked_request, valid_requests[i].get(), comparator))
102 picked_request = valid_requests[i].get(); 113 picked_request = valid_requests[i].get();
103 } 114 }
104 115
105 // If we have a best request to try next, get the request coodinator to 116 // If we have a best request to try next, get the request coodinator to
106 // start it. Otherwise return that we have no candidates. 117 // start it. Otherwise return that we have no candidates.
107 if (picked_request != nullptr) { 118 if (picked_request != nullptr)
108 picked_callback_.Run(*picked_request); 119 picked_callback_.Run(*picked_request);
109 } else { 120 else
110 not_picked_callback_.Run(non_user_requested_tasks_remaining); 121 not_picked_callback_.Run(non_user_requested_tasks_remaining);
122 }
123
124 // Continue the async part of the processing by deleting the expired requests.
125 // TODO(petewil): Does that really need to be done on the task queue? Hard to
126 // see how we need to wait for it before starting the next task. OTOH, we'd hate
127 // to do a second slow DB operation to get entries a second time, and waiting
128 // until this is done will make sure other gets don't see these old entries.
129 // Consider moving this to a fresh task type to clean the queue.
130 void PickRequestTask::RemoveStaleRequests(
131 std::vector<int64_t> stale_request_ids) {
132 store_->RemoveRequests(stale_request_ids,
133 base::Bind(&PickRequestTask::OnRequestsExpired,
134 weak_ptr_factory_.GetWeakPtr()));
135 }
136
137 void PickRequestTask::OnRequestsExpired(
138 std::unique_ptr<UpdateRequestsResult> result) {
139 RequestNotifier::BackgroundSavePageResult save_page_result(
140 RequestNotifier::BackgroundSavePageResult::EXPIRED);
141 for (const auto& request : result->updated_items) {
142 event_logger_->RecordDroppedSavePageRequest(
143 request.client_id().name_space, save_page_result, request.request_id());
144 notifier_->NotifyCompleted(request, save_page_result);
145 }
146
147 // The task is now done, return control to the task queue.
148 TaskComplete();
149 }
150
151 void PickRequestTask::SplitRequests(
152 std::vector<std::unique_ptr<SavePageRequest>> requests,
153 std::vector<std::unique_ptr<SavePageRequest>>* valid_requests,
154 std::vector<int64_t>* expired_request_ids) {
155 for (auto& request : requests) {
156 if (base::Time::Now() - request->creation_time() >=
157 base::TimeDelta::FromSeconds(kRequestExpirationTimeInSeconds)) {
158 expired_request_ids->push_back(request->request_id());
159 } else {
160 valid_requests->push_back(std::move(request));
161 }
111 } 162 }
112 } 163 }
113 164
114 // Filter out requests that don't meet the current conditions. For instance, if 165 // Filter out requests that don't meet the current conditions. For instance, if
115 // this is a predictive request, and we are not on WiFi, it should be ignored 166 // this is a predictive request, and we are not on WiFi, it should be ignored
116 // this round. 167 // this round.
117 bool RequestPicker::RequestConditionsSatisfied(const SavePageRequest* request) { 168 bool PickRequestTask::RequestConditionsSatisfied(
169 const SavePageRequest* request) {
118 // If the user did not request the page directly, make sure we are connected 170 // If the user did not request the page directly, make sure we are connected
119 // to power and have WiFi and sufficient battery remaining before we take this 171 // to power and have WiFi and sufficient battery remaining before we take this
120 // request. 172 // request.
121 173 if (!device_conditions_->IsPowerConnected() &&
122 if (!current_conditions_->IsPowerConnected() &&
123 policy_->PowerRequired(request->user_requested())) { 174 policy_->PowerRequired(request->user_requested())) {
124 return false; 175 return false;
125 } 176 }
126 177
127 if (current_conditions_->GetNetConnectionType() != 178 if (device_conditions_->GetNetConnectionType() !=
128 net::NetworkChangeNotifier::ConnectionType::CONNECTION_WIFI && 179 net::NetworkChangeNotifier::ConnectionType::CONNECTION_WIFI &&
129 policy_->UnmeteredNetworkRequired(request->user_requested())) { 180 policy_->UnmeteredNetworkRequired(request->user_requested())) {
130 return false; 181 return false;
131 } 182 }
132 183
133 if (current_conditions_->GetBatteryPercentage() < 184 if (device_conditions_->GetBatteryPercentage() <
134 policy_->BatteryPercentageRequired(request->user_requested())) { 185 policy_->BatteryPercentageRequired(request->user_requested())) {
135 return false; 186 return false;
136 } 187 }
137 188
138 // If we have already started this page the max number of times, it is not 189 // If we have already started this page the max number of times, it is not
139 // eligible to try again. 190 // eligible to try again.
140 if (request->started_attempt_count() >= policy_->GetMaxStartedTries()) 191 if (request->started_attempt_count() >= policy_->GetMaxStartedTries())
141 return false; 192 return false;
142 193
143 // If we have already completed trying this page the max number of times, it 194 // If we have already completed trying this page the max number of times, it
144 // is not eligible to try again. 195 // is not eligible to try again.
145 if (request->completed_attempt_count() >= policy_->GetMaxCompletedTries()) 196 if (request->completed_attempt_count() >= policy_->GetMaxCompletedTries())
146 return false; 197 return false;
147 198
148 // If the request is paused, do not consider it. 199 // If the request is paused, do not consider it.
149 if (request->request_state() == SavePageRequest::RequestState::PAUSED) 200 if (request->request_state() == SavePageRequest::RequestState::PAUSED)
150 return false; 201 return false;
151 202
152 // If the request is expired, do not consider it. 203 // If the request is expired, do not consider it.
153 base::TimeDelta requestAge = base::Time::Now() - request->creation_time(); 204 base::TimeDelta requestAge = base::Time::Now() - request->creation_time();
154 if (requestAge > 205 if (requestAge > base::TimeDelta::FromSeconds(
155 base::TimeDelta::FromSeconds( 206 policy_->GetRequestExpirationTimeInSeconds()))
156 policy_->GetRequestExpirationTimeInSeconds()))
157 return false; 207 return false;
158 208
159 // If this request is not active yet, return false. 209 // If this request is not active yet, return false.
160 // TODO(petewil): If the only reason we return nothing to do is that we have 210 // TODO(petewil): If the only reason we return nothing to do is that we have
161 // inactive requests, we still want to try again later after their activation 211 // inactive requests, we still want to try again later after their activation
162 // time elapses, we shouldn't take ourselves completely off the scheduler. 212 // time elapses, we shouldn't take ourselves completely off the scheduler.
163 if (request->activation_time() > base::Time::Now()) 213 if (request->activation_time() > base::Time::Now())
164 return false; 214 return false;
165 215
166 return true; 216 return true;
167 } 217 }
168 218
169 // Look at policies to decide which requests to prefer. 219 // Look at policies to decide which requests to prefer.
170 bool RequestPicker::IsNewRequestBetter(const SavePageRequest* oldRequest, 220 bool PickRequestTask::IsNewRequestBetter(const SavePageRequest* oldRequest,
171 const SavePageRequest* newRequest, 221 const SavePageRequest* newRequest,
172 RequestCompareFunction comparator) { 222 RequestCompareFunction comparator) {
173
174 // If there is no old request, the new one is better. 223 // If there is no old request, the new one is better.
175 if (oldRequest == nullptr) 224 if (oldRequest == nullptr)
176 return true; 225 return true;
177 226
178 // User requested pages get priority. 227 // User requested pages get priority.
179 if (newRequest->user_requested() && !oldRequest->user_requested()) 228 if (newRequest->user_requested() && !oldRequest->user_requested())
180 return true; 229 return true;
181 230
182 // Otherwise, use the comparison function for the current policy, which 231 // Otherwise, use the comparison function for the current policy, which
183 // returns true if the older request is better. 232 // returns true if the older request is better.
184 return !(CALL_MEMBER_FUNCTION(this, comparator)(oldRequest, newRequest)); 233 return !(CALL_MEMBER_FUNCTION(this, comparator)(oldRequest, newRequest));
185 } 234 }
186 235
187 // Compare the results, checking request count before recency. Returns true if 236 // Compare the results, checking request count before recency. Returns true if
188 // left hand side is better, false otherwise. 237 // left hand side is better, false otherwise.
189 bool RequestPicker::RetryCountFirstCompareFunction( 238 bool PickRequestTask::RetryCountFirstCompareFunction(
190 const SavePageRequest* left, const SavePageRequest* right) { 239 const SavePageRequest* left,
240 const SavePageRequest* right) {
191 // Check the attempt count. 241 // Check the attempt count.
192 int result = CompareRetryCount(left, right); 242 int result = CompareRetryCount(left, right);
193 243
194 if (result != 0) 244 if (result != 0)
195 return (result > 0); 245 return (result > 0);
196 246
197 // If we get here, the attempt counts were the same, so check recency. 247 // If we get here, the attempt counts were the same, so check recency.
198 result = CompareCreationTime(left, right); 248 result = CompareCreationTime(left, right);
199 249
200 return (result > 0); 250 return (result > 0);
201 } 251 }
202 252
203 // Compare the results, checking recency before request count. Returns true if 253 // Compare the results, checking recency before request count. Returns true if
204 // left hand side is better, false otherwise. 254 // left hand side is better, false otherwise.
205 bool RequestPicker::RecencyFirstCompareFunction( 255 bool PickRequestTask::RecencyFirstCompareFunction(
206 const SavePageRequest* left, const SavePageRequest* right) { 256 const SavePageRequest* left,
257 const SavePageRequest* right) {
207 // Check the recency. 258 // Check the recency.
208 int result = CompareCreationTime(left, right); 259 int result = CompareCreationTime(left, right);
209 260
210 if (result != 0) 261 if (result != 0)
211 return (result > 0); 262 return (result > 0);
212 263
213 // If we get here, the recency was the same, so check the attempt count. 264 // If we get here, the recency was the same, so check the attempt count.
214 result = CompareRetryCount(left, right); 265 result = CompareRetryCount(left, right);
215 266
216 return (result > 0); 267 return (result > 0);
217 } 268 }
218 269
219 // Compare left and right side, returning 1 if the left side is better 270 // Compare left and right side, returning 1 if the left side is better
220 // (preferred by policy), 0 if the same, and -1 if the right side is better. 271 // (preferred by policy), 0 if the same, and -1 if the right side is better.
221 int RequestPicker::CompareRetryCount( 272 int PickRequestTask::CompareRetryCount(const SavePageRequest* left,
222 const SavePageRequest* left, const SavePageRequest* right) { 273 const SavePageRequest* right) {
223 // Check the attempt count. 274 // Check the attempt count.
224 int result = signum(left->completed_attempt_count() - 275 int result = signum(left->completed_attempt_count() -
225 right->completed_attempt_count()); 276 right->completed_attempt_count());
226 277
227 // Flip the direction of comparison if policy prefers fewer retries. 278 // Flip the direction of comparison if policy prefers fewer retries.
228 if (fewer_retries_better_) 279 if (policy_->ShouldPreferUntriedRequests())
229 result *= -1; 280 result *= -1;
230 281
231 return result; 282 return result;
232 } 283 }
233 284
234 // Compare left and right side, returning 1 if the left side is better 285 // Compare left and right side, returning 1 if the left side is better
235 // (preferred by policy), 0 if the same, and -1 if the right side is better. 286 // (preferred by policy), 0 if the same, and -1 if the right side is better.
236 int RequestPicker::CompareCreationTime( 287 int PickRequestTask::CompareCreationTime(const SavePageRequest* left,
237 const SavePageRequest* left, const SavePageRequest* right) { 288 const SavePageRequest* right) {
238 // Check the recency. 289 // Check the recency.
239 base::TimeDelta difference = left->creation_time() - right->creation_time(); 290 base::TimeDelta difference = left->creation_time() - right->creation_time();
240 int result = signum(difference.InMilliseconds()); 291 int result = signum(difference.InMilliseconds());
241 292
242 // Flip the direction of comparison if policy prefers fewer retries. 293 // Flip the direction of comparison if policy prefers fewer retries.
243 if (earlier_requests_better_) 294 if (policy_->ShouldPreferEarlierRequests())
244 result *= -1; 295 result *= -1;
245 296
246 return result; 297 return result;
247 } 298 }
248 299
249 void RequestPicker::SplitRequests(
250 std::vector<std::unique_ptr<SavePageRequest>> requests,
251 std::vector<std::unique_ptr<SavePageRequest>>* valid_requests,
252 std::vector<std::unique_ptr<SavePageRequest>>* expired_requests) {
253 for (auto& request : requests) {
254 if (base::Time::Now() - request->creation_time() >=
255 base::TimeDelta::FromSeconds(kRequestExpirationTimeInSeconds)) {
256 expired_requests->push_back(std::move(request));
257 } else {
258 valid_requests->push_back(std::move(request));
259 }
260 }
261 }
262
263 // Callback used after expired requests are deleted from the queue and notifies
264 // the coordinator.
265 void RequestPicker::OnRequestExpired(
266 std::unique_ptr<UpdateRequestsResult> result) {
267 const RequestCoordinator::BackgroundSavePageResult save_page_result(
268 RequestCoordinator::BackgroundSavePageResult::EXPIRED);
269 for (const auto& request : result->updated_items) {
270 event_logger_->RecordDroppedSavePageRequest(
271 request.client_id().name_space, save_page_result, request.request_id());
272 notifier_->NotifyCompleted(request, save_page_result);
273 }
274 }
275
276 } // namespace offline_pages 300 } // namespace offline_pages
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698