blob: e34758a85a4ff1cc943c583671e11fbdc2d1f788 (
plain)
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
|
# Copyright 1999-2012 Gentoo Foundation
# Distributed under the terms of the GNU General Public License v2
from _emerge.PollScheduler import PollScheduler
class QueueScheduler(PollScheduler):
"""
Add instances of SequentialTaskQueue and then call run(). The
run() method returns when no tasks remain.
"""
def __init__(self, max_jobs=None, max_load=None):
PollScheduler.__init__(self)
if max_jobs is None:
max_jobs = 1
self._max_jobs = max_jobs
self._max_load = max_load
self._queues = []
self._schedule_listeners = []
def add(self, q):
self._queues.append(q)
def remove(self, q):
self._queues.remove(q)
def clear(self):
for q in self._queues:
q.clear()
def run(self, timeout=None):
timeout_callback = None
if timeout is not None:
def timeout_callback():
timeout_callback.timed_out = True
raise StopIteration()
timeout_callback.timed_out = False
timeout_callback.timeout_id = self.sched_iface.timeout_add(
timeout, timeout_callback)
try:
while not (timeout_callback is not None and
timeout_callback.timed_out) and self._schedule():
self.sched_iface.iteration()
while not (timeout_callback is not None and
timeout_callback.timed_out) and self._running_job_count():
self.sched_iface.iteration()
except StopIteration:
pass
finally:
if timeout_callback is not None:
self.sched_iface.unregister(timeout_callback.timeout_id)
def _schedule_tasks(self):
"""
@rtype: bool
@returns: True if there may be remaining tasks to schedule,
False otherwise.
"""
if self._terminated_tasks:
return False
while self._can_add_job():
n = self._max_jobs - self._running_job_count()
if n < 1:
break
if not self._start_next_job(n):
return False
for q in self._queues:
if q:
return True
return False
def _running_job_count(self):
job_count = 0
for q in self._queues:
job_count += len(q.running_tasks)
self._jobs = job_count
return job_count
def _start_next_job(self, n=1):
started_count = 0
for q in self._queues:
initial_job_count = len(q.running_tasks)
q.schedule()
final_job_count = len(q.running_tasks)
if final_job_count > initial_job_count:
started_count += (final_job_count - initial_job_count)
if started_count >= n:
break
return started_count
|
