OLD | NEW |
1 // Copyright 2014 The Chromium Authors. All rights reserved. | 1 // Copyright 2014 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 #ifndef SYNC_INTERNAL_API_PUBLIC_ATTACHMENTS_TASK_QUEUE_H_ | 5 #ifndef SYNC_INTERNAL_API_PUBLIC_ATTACHMENTS_TASK_QUEUE_H_ |
6 #define SYNC_INTERNAL_API_PUBLIC_ATTACHMENTS_TASK_QUEUE_H_ | 6 #define SYNC_INTERNAL_API_PUBLIC_ATTACHMENTS_TASK_QUEUE_H_ |
7 | 7 |
8 #include <stddef.h> | 8 #include <stddef.h> |
9 | 9 |
10 #include <deque> | 10 #include <deque> |
11 #include <memory> | 11 #include <memory> |
12 #include <set> | 12 #include <set> |
13 #include <utility> | 13 #include <utility> |
14 | 14 |
15 #include "base/bind.h" | 15 #include "base/bind.h" |
16 #include "base/callback.h" | 16 #include "base/callback.h" |
17 #include "base/macros.h" | 17 #include "base/macros.h" |
18 #include "base/memory/weak_ptr.h" | 18 #include "base/memory/weak_ptr.h" |
19 #include "base/message_loop/message_loop.h" | |
20 #include "base/threading/non_thread_safe.h" | 19 #include "base/threading/non_thread_safe.h" |
| 20 #include "base/threading/thread_task_runner_handle.h" |
21 #include "base/time/time.h" | 21 #include "base/time/time.h" |
22 #include "base/timer/timer.h" | 22 #include "base/timer/timer.h" |
23 #include "net/base/backoff_entry.h" | 23 #include "net/base/backoff_entry.h" |
24 | 24 |
25 namespace syncer { | 25 namespace syncer { |
26 | 26 |
27 // A queue that dispatches tasks, ignores duplicates, and provides backoff | 27 // A queue that dispatches tasks, ignores duplicates, and provides backoff |
28 // semantics. | 28 // semantics. |
29 // | 29 // |
30 // |T| is the task type. | 30 // |T| is the task type. |
(...skipping 233 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
264 void TaskQueue<T>::Dispatch() { | 264 void TaskQueue<T>::Dispatch() { |
265 DCHECK(CalledOnValidThread()); | 265 DCHECK(CalledOnValidThread()); |
266 if (!ShouldDispatch()) { | 266 if (!ShouldDispatch()) { |
267 return; | 267 return; |
268 } | 268 } |
269 | 269 |
270 DCHECK(!queue_.empty()); | 270 DCHECK(!queue_.empty()); |
271 const T& task = queue_.front(); | 271 const T& task = queue_.front(); |
272 ++num_in_progress_; | 272 ++num_in_progress_; |
273 DCHECK_LE(num_in_progress_, kMaxConcurrentTasks); | 273 DCHECK_LE(num_in_progress_, kMaxConcurrentTasks); |
274 base::MessageLoop::current()->PostTask(FROM_HERE, | 274 base::ThreadTaskRunnerHandle::Get()->PostTask( |
275 base::Bind(process_callback_, task)); | 275 FROM_HERE, base::Bind(process_callback_, task)); |
276 queue_.pop_front(); | 276 queue_.pop_front(); |
277 } | 277 } |
278 | 278 |
279 template <typename T> | 279 template <typename T> |
280 bool TaskQueue<T>::ShouldDispatch() { | 280 bool TaskQueue<T>::ShouldDispatch() { |
281 return num_in_progress_ < kMaxConcurrentTasks && !queue_.empty(); | 281 return num_in_progress_ < kMaxConcurrentTasks && !queue_.empty(); |
282 } | 282 } |
283 | 283 |
284 } // namespace syncer | 284 } // namespace syncer |
285 | 285 |
286 #endif // SYNC_INTERNAL_API_PUBLIC_ATTACHMENTS_TASK_QUEUE_H_ | 286 #endif // SYNC_INTERNAL_API_PUBLIC_ATTACHMENTS_TASK_QUEUE_H_ |
OLD | NEW |