OLD | NEW |
---|---|
(Empty) | |
1 // Copyright (c) 2011 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. | |
4 | |
5 #ifndef NET_BASE_PRIORITY_DISPATCH_H_ | |
6 #define NET_BASE_PRIORITY_DISPATCH_H_ | |
7 #pragma once | |
8 | |
9 #include <vector> | |
10 | |
11 #include "net/base/net_export.h" | |
12 #include "net/base/priority_queue.h" | |
13 | |
14 namespace net { | |
15 | |
16 // A priority-based dispatcher of jobs. Dispatch order is by priority (lowest | |
17 // first) and then FIFO. The dispatcher enforces limits on the number of running | |
18 // jobs. It never revokes a job once started. The job must call OnJobFinished | |
19 // once it finishes in order to dispatch further jobs. | |
20 // | |
21 // All operations are O(1) time. The class is fully reentrant: it is safe to | |
22 // execute any method (incl. destructor) from within Job callbacks. | |
23 // | |
24 class NET_EXPORT_PRIVATE PrioritizedDispatcher { | |
cbentzel
2012/01/05 18:32:20
Make it explicit that this is not thread safe.
| |
25 public: | |
26 // Describes the limits for the number of jobs started by the dispatcher. | |
27 // For example, |total_jobs| = 30 and |reserved_slots| = { 5, 10, 5 } | |
28 // allow for at most 30 running jobs in total. If there are already 24 jobs | |
29 // running, then there can be 6 more jobs started of which at most 1 can be | |
30 // at priority 1 or 0, but the rest has to be at 0. | |
31 struct NET_EXPORT_PRIVATE Limits { | |
32 // Total allowed running jobs. | |
33 size_t total_jobs; | |
34 // Number of slots reserved for each priority and higher. | |
35 // Sum of |reserved_slots| must be no greater than |total_jobs|. | |
36 // Non-zero reserved slots for priorities beyond |num_priorities| are not | |
37 // allowed. | |
38 std::vector<size_t> reserved_slots; | |
39 }; | |
40 | |
41 // An interface to the job dispatched by PrioritizedDispatcher. The dispatcher | |
42 // does not own the Job but expects it to live as long as the Job is queued. | |
43 // Use Cancel to remove Job from queue before it is dispatched. The Job can be | |
44 // deleted after it is dispatched or canceled, or the dispatcher is destroyed. | |
45 class Job { | |
cbentzel
2012/01/05 18:32:20
I wonder if there should be an explicit "Finish()"
szym
2012/01/05 19:00:29
In that case it also makes sense for the Job to ke
| |
46 public: | |
47 // Note: PriorityDispatch will never delete a Job. | |
48 virtual ~Job() {} | |
49 // Called when the dispatcher starts the job. Must call OnJobFinished when | |
50 // done. | |
51 virtual void Start() = 0; | |
52 }; | |
53 | |
54 // A handle to the enqueued job. The handle becomes invalid when the job is | |
55 // canceled, updated, or started. | |
56 typedef PriorityQueue<Job*>::Pointer Handle; | |
57 | |
58 // Creates a dispatcher for |num_priorities| priorities, enforcing |limits| on | |
59 // number of running jobs. | |
60 PrioritizedDispatcher(size_t num_priorities, const Limits& limits); | |
61 | |
62 ~PrioritizedDispatcher(); | |
63 | |
64 size_t num_running_jobs() const { return num_running_jobs_; } | |
65 size_t num_queued_jobs() const { return queue_.size(); } | |
66 size_t num_priorities() const { return max_running_jobs_.size(); } | |
67 | |
68 // Adds |job| with |priority| to the dispatcher. If limits permit, |job| is | |
69 // started immediately. Returns handle to the job or null-handle if the job is | |
70 // started. | |
71 Handle Add(Job* job, size_t priority); | |
72 | |
73 // Removes the job with |handle| from the queue. Invalidates |handle|. | |
cbentzel
2012/01/05 18:32:20
This should probably have a stronger warning that
| |
74 void Cancel(const Handle& handle); | |
cbentzel
2012/01/05 18:32:20
Should this return a Job* to be closer to the evic
szym
2012/01/05 19:00:29
handle.value() returns the job. The caller of Evic
| |
75 | |
76 // Removes and returns the oldest-lowest Job from the queue invalidating any | |
77 // handles to it. Returns NULL if the queue is empty. | |
78 Job* EvictOldestLowest(); | |
79 | |
80 // Moves the queued job with |handle| to the end of all values with priority | |
81 // |priority| and returns the updated handle, or null-handle if it starts the | |
82 // job. Invalidates |handle|. No-op if priority did not change. | |
83 Handle Update(const Handle& handle, size_t priority); | |
cbentzel
2012/01/05 18:32:20
ChangePriority would be a clearer name.
| |
84 | |
85 // Notifies the dispatcher that a running job has finished. Could start a job. | |
86 void OnJobFinished(); | |
87 | |
88 private: | |
89 // Attempts to dispatch the job with |handle| at priority |priority| (might be | |
90 // different than |handle.priority()|. Returns true if successful. If so | |
91 // the |handle| becomes invalid. | |
92 bool DispatchJob(const Handle& handle, size_t priority); | |
93 | |
94 // Queue for jobs that need to wait for a spare slot. | |
95 PriorityQueue<Job*> queue_; | |
96 // Maximum total number of running jobs allowed after a job at a particular | |
97 // priority is started. If a greater or equal number of jobs are running, then | |
98 // another job cannot be started. | |
99 std::vector<size_t> max_running_jobs_; | |
100 // Total number of running jobs. | |
101 size_t num_running_jobs_; | |
102 // Maximum number of jobs in |queue_|. | |
103 size_t max_queued_jobs_; | |
104 | |
105 DISALLOW_COPY_AND_ASSIGN(PrioritizedDispatcher); | |
106 }; | |
107 | |
108 } // namespace net | |
109 | |
110 #endif // NET_BASE_PRIORITY_DISPATCH_H_ | |
111 | |
OLD | NEW |