state.py 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727
  1. # -*- coding: utf-8 -*-
  2. """In-memory representation of cluster state.
  3. This module implements a data-structure used to keep
  4. track of the state of a cluster of workers and the tasks
  5. it is working on (by consuming events).
  6. For every event consumed the state is updated,
  7. so the state represents the state of the cluster
  8. at the time of the last event.
  9. Snapshots (:mod:`celery.events.snapshot`) can be used to
  10. take "pictures" of this state at regular intervals
  11. to for example, store that in a database.
  12. """
  13. from __future__ import absolute_import, unicode_literals
  14. import bisect
  15. import sys
  16. import threading
  17. from collections import Callable, defaultdict
  18. from datetime import datetime
  19. from decimal import Decimal
  20. from itertools import islice
  21. from operator import itemgetter
  22. from time import time
  23. from weakref import WeakSet, ref
  24. from kombu.clocks import timetuple
  25. from kombu.utils.objects import cached_property
  26. from celery import states
  27. from celery.five import items, python_2_unicode_compatible, values
  28. from celery.utils.functional import LRUCache, memoize, pass1
  29. from celery.utils.log import get_logger
  30. __all__ = ['Worker', 'Task', 'State', 'heartbeat_expires']
  31. # pylint: disable=redefined-outer-name
  32. # We cache globals and attribute lookups, so disable this warning.
  33. # pylint: disable=too-many-function-args
  34. # For some reason pylint thinks ._event is a method, when it's a property.
  35. #: Set if running PyPy
  36. PYPY = hasattr(sys, 'pypy_version_info')
  37. #: The window (in percentage) is added to the workers heartbeat
  38. #: frequency. If the time between updates exceeds this window,
  39. #: then the worker is considered to be offline.
  40. HEARTBEAT_EXPIRE_WINDOW = 200
  41. #: Max drift between event timestamp and time of event received
  42. #: before we alert that clocks may be unsynchronized.
  43. HEARTBEAT_DRIFT_MAX = 16
  44. DRIFT_WARNING = """\
  45. Substantial drift from %s may mean clocks are out of sync. Current drift is
  46. %s seconds. [orig: %s recv: %s]
  47. """
  48. logger = get_logger(__name__)
  49. warn = logger.warning
  50. R_STATE = '<State: events={0.event_count} tasks={0.task_count}>'
  51. R_WORKER = '<Worker: {0.hostname} ({0.status_string} clock:{0.clock})'
  52. R_TASK = '<Task: {0.name}({0.uuid}) {0.state} clock:{0.clock}>'
  53. #: Mapping of task event names to task state.
  54. TASK_EVENT_TO_STATE = {
  55. 'sent': states.PENDING,
  56. 'received': states.RECEIVED,
  57. 'started': states.STARTED,
  58. 'failed': states.FAILURE,
  59. 'retried': states.RETRY,
  60. 'succeeded': states.SUCCESS,
  61. 'revoked': states.REVOKED,
  62. 'rejected': states.REJECTED,
  63. }
  64. class CallableDefaultdict(defaultdict):
  65. """:class:`~collections.defaultdict` with configurable __call__.
  66. We use this for backwards compatibility in State.tasks_by_type
  67. etc, which used to be a method but is now an index instead.
  68. So you can do::
  69. >>> add_tasks = state.tasks_by_type['proj.tasks.add']
  70. while still supporting the method call::
  71. >>> add_tasks = list(state.tasks_by_type(
  72. ... 'proj.tasks.add', reverse=True))
  73. """
  74. def __init__(self, fun, *args, **kwargs):
  75. self.fun = fun
  76. super(CallableDefaultdict, self).__init__(*args, **kwargs)
  77. def __call__(self, *args, **kwargs):
  78. return self.fun(*args, **kwargs)
  79. Callable.register(CallableDefaultdict)
  80. @memoize(maxsize=1000, keyfun=lambda a, _: a[0])
  81. def _warn_drift(hostname, drift, local_received, timestamp):
  82. # we use memoize here so the warning is only logged once per hostname
  83. warn(DRIFT_WARNING, hostname, drift,
  84. datetime.fromtimestamp(local_received),
  85. datetime.fromtimestamp(timestamp))
  86. def heartbeat_expires(timestamp, freq=60,
  87. expire_window=HEARTBEAT_EXPIRE_WINDOW,
  88. Decimal=Decimal, float=float, isinstance=isinstance):
  89. """Return time when heartbeat expires."""
  90. # some json implementations returns decimal.Decimal objects,
  91. # which aren't compatible with float.
  92. freq = float(freq) if isinstance(freq, Decimal) else freq
  93. if isinstance(timestamp, Decimal):
  94. timestamp = float(timestamp)
  95. return timestamp + (freq * (expire_window / 1e2))
  96. def _depickle_task(cls, fields):
  97. return cls(**fields)
  98. def with_unique_field(attr):
  99. def _decorate_cls(cls):
  100. def __eq__(this, other):
  101. if isinstance(other, this.__class__):
  102. return getattr(this, attr) == getattr(other, attr)
  103. return NotImplemented
  104. cls.__eq__ = __eq__
  105. def __ne__(this, other):
  106. res = this.__eq__(other)
  107. return True if res is NotImplemented else not res
  108. cls.__ne__ = __ne__
  109. def __hash__(this):
  110. return hash(getattr(this, attr))
  111. cls.__hash__ = __hash__
  112. return cls
  113. return _decorate_cls
  114. @with_unique_field('hostname')
  115. @python_2_unicode_compatible
  116. class Worker(object):
  117. """Worker State."""
  118. heartbeat_max = 4
  119. expire_window = HEARTBEAT_EXPIRE_WINDOW
  120. _fields = ('hostname', 'pid', 'freq', 'heartbeats', 'clock',
  121. 'active', 'processed', 'loadavg', 'sw_ident',
  122. 'sw_ver', 'sw_sys')
  123. if not PYPY: # pragma: no cover
  124. __slots__ = _fields + ('event', '__dict__', '__weakref__')
  125. def __init__(self, hostname=None, pid=None, freq=60,
  126. heartbeats=None, clock=0, active=None, processed=None,
  127. loadavg=None, sw_ident=None, sw_ver=None, sw_sys=None):
  128. self.hostname = hostname
  129. self.pid = pid
  130. self.freq = freq
  131. self.heartbeats = [] if heartbeats is None else heartbeats
  132. self.clock = clock or 0
  133. self.active = active
  134. self.processed = processed
  135. self.loadavg = loadavg
  136. self.sw_ident = sw_ident
  137. self.sw_ver = sw_ver
  138. self.sw_sys = sw_sys
  139. self.event = self._create_event_handler()
  140. def __reduce__(self):
  141. return self.__class__, (self.hostname, self.pid, self.freq,
  142. self.heartbeats, self.clock, self.active,
  143. self.processed, self.loadavg, self.sw_ident,
  144. self.sw_ver, self.sw_sys)
  145. def _create_event_handler(self):
  146. _set = object.__setattr__
  147. hbmax = self.heartbeat_max
  148. heartbeats = self.heartbeats
  149. hb_pop = self.heartbeats.pop
  150. hb_append = self.heartbeats.append
  151. def event(type_, timestamp=None,
  152. local_received=None, fields=None,
  153. max_drift=HEARTBEAT_DRIFT_MAX, items=items, abs=abs, int=int,
  154. insort=bisect.insort, len=len):
  155. fields = fields or {}
  156. for k, v in items(fields):
  157. _set(self, k, v)
  158. if type_ == 'offline':
  159. heartbeats[:] = []
  160. else:
  161. if not local_received or not timestamp:
  162. return
  163. drift = abs(int(local_received) - int(timestamp))
  164. if drift > max_drift:
  165. _warn_drift(self.hostname, drift,
  166. local_received, timestamp)
  167. if local_received: # pragma: no cover
  168. hearts = len(heartbeats)
  169. if hearts > hbmax - 1:
  170. hb_pop(0)
  171. if hearts and local_received > heartbeats[-1]:
  172. hb_append(local_received)
  173. else:
  174. insort(heartbeats, local_received)
  175. return event
  176. def update(self, f, **kw):
  177. for k, v in items(dict(f, **kw) if kw else f):
  178. setattr(self, k, v)
  179. def __repr__(self):
  180. return R_WORKER.format(self)
  181. @property
  182. def status_string(self):
  183. return 'ONLINE' if self.alive else 'OFFLINE'
  184. @property
  185. def heartbeat_expires(self):
  186. return heartbeat_expires(self.heartbeats[-1],
  187. self.freq, self.expire_window)
  188. @property
  189. def alive(self, nowfun=time):
  190. return bool(self.heartbeats and nowfun() < self.heartbeat_expires)
  191. @property
  192. def id(self):
  193. return '{0.hostname}.{0.pid}'.format(self)
  194. @with_unique_field('uuid')
  195. @python_2_unicode_compatible
  196. class Task(object):
  197. """Task State."""
  198. name = received = sent = started = succeeded = failed = retried = \
  199. revoked = rejected = args = kwargs = eta = expires = retries = \
  200. worker = result = exception = timestamp = runtime = traceback = \
  201. exchange = routing_key = root_id = parent_id = client = None
  202. state = states.PENDING
  203. clock = 0
  204. _fields = (
  205. 'uuid', 'name', 'state', 'received', 'sent', 'started', 'rejected',
  206. 'succeeded', 'failed', 'retried', 'revoked', 'args', 'kwargs',
  207. 'eta', 'expires', 'retries', 'worker', 'result', 'exception',
  208. 'timestamp', 'runtime', 'traceback', 'exchange', 'routing_key',
  209. 'clock', 'client', 'root', 'root_id', 'parent', 'parent_id',
  210. 'children',
  211. )
  212. if not PYPY: # pragma: no cover
  213. __slots__ = ('__dict__', '__weakref__')
  214. #: How to merge out of order events.
  215. #: Disorder is detected by logical ordering (e.g., :event:`task-received`
  216. #: must've happened before a :event:`task-failed` event).
  217. #:
  218. #: A merge rule consists of a state and a list of fields to keep from
  219. #: that state. ``(RECEIVED, ('name', 'args')``, means the name and args
  220. #: fields are always taken from the RECEIVED state, and any values for
  221. #: these fields received before or after is simply ignored.
  222. merge_rules = {
  223. states.RECEIVED: (
  224. 'name', 'args', 'kwargs', 'parent_id',
  225. 'root_id' 'retries', 'eta', 'expires',
  226. ),
  227. }
  228. #: meth:`info` displays these fields by default.
  229. _info_fields = (
  230. 'args', 'kwargs', 'retries', 'result', 'eta', 'runtime',
  231. 'expires', 'exception', 'exchange', 'routing_key',
  232. 'root_id', 'parent_id',
  233. )
  234. def __init__(self, uuid=None, cluster_state=None, children=None, **kwargs):
  235. self.uuid = uuid
  236. self.cluster_state = cluster_state
  237. self.children = WeakSet(
  238. self.cluster_state.tasks.get(task_id)
  239. for task_id in children or ()
  240. if task_id in self.cluster_state.tasks
  241. )
  242. self._serializer_handlers = {
  243. 'children': self._serializable_children,
  244. 'root': self._serializable_root,
  245. 'parent': self._serializable_parent,
  246. }
  247. if kwargs:
  248. self.__dict__.update(kwargs)
  249. def event(self, type_, timestamp=None, local_received=None, fields=None,
  250. precedence=states.precedence, items=items,
  251. setattr=setattr, task_event_to_state=TASK_EVENT_TO_STATE.get,
  252. RETRY=states.RETRY):
  253. fields = fields or {}
  254. # using .get is faster than catching KeyError in this case.
  255. state = task_event_to_state(type_)
  256. if state is not None:
  257. # sets, for example, self.succeeded to the timestamp.
  258. setattr(self, type_, timestamp)
  259. else:
  260. state = type_.upper() # custom state
  261. # note that precedence here is reversed
  262. # see implementation in celery.states.state.__lt__
  263. if state != RETRY and self.state != RETRY and \
  264. precedence(state) > precedence(self.state):
  265. # this state logically happens-before the current state, so merge.
  266. keep = self.merge_rules.get(state)
  267. if keep is not None:
  268. fields = {
  269. k: v for k, v in items(fields) if k in keep
  270. }
  271. else:
  272. fields.update(state=state, timestamp=timestamp)
  273. # update current state with info from this event.
  274. self.__dict__.update(fields)
  275. def info(self, fields=None, extra=[]):
  276. """Information about this task suitable for on-screen display."""
  277. fields = self._info_fields if fields is None else fields
  278. def _keys():
  279. for key in list(fields) + list(extra):
  280. value = getattr(self, key, None)
  281. if value is not None:
  282. yield key, value
  283. return dict(_keys())
  284. def __repr__(self):
  285. return R_TASK.format(self)
  286. def as_dict(self):
  287. get = object.__getattribute__
  288. handler = self._serializer_handlers.get
  289. return {
  290. k: handler(k, pass1)(get(self, k)) for k in self._fields
  291. }
  292. def _serializable_children(self, value):
  293. return [task.id for task in self.children]
  294. def _serializable_root(self, value):
  295. return self.root_id
  296. def _serializable_parent(self, value):
  297. return self.parent_id
  298. def __reduce__(self):
  299. return _depickle_task, (self.__class__, self.as_dict())
  300. @property
  301. def id(self):
  302. return self.uuid
  303. @property
  304. def origin(self):
  305. return self.client if self.worker is None else self.worker.id
  306. @property
  307. def ready(self):
  308. return self.state in states.READY_STATES
  309. @cached_property
  310. def parent(self):
  311. return self.parent_id and self.cluster_state.tasks[self.parent_id]
  312. @cached_property
  313. def root(self):
  314. return self.root_id and self.cluster_state.tasks[self.root_id]
  315. class State(object):
  316. """Records clusters state."""
  317. Worker = Worker
  318. Task = Task
  319. event_count = 0
  320. task_count = 0
  321. heap_multiplier = 4
  322. def __init__(self, callback=None,
  323. workers=None, tasks=None, taskheap=None,
  324. max_workers_in_memory=5000, max_tasks_in_memory=10000,
  325. on_node_join=None, on_node_leave=None,
  326. tasks_by_type=None, tasks_by_worker=None):
  327. self.event_callback = callback
  328. self.workers = (LRUCache(max_workers_in_memory)
  329. if workers is None else workers)
  330. self.tasks = (LRUCache(max_tasks_in_memory)
  331. if tasks is None else tasks)
  332. self._taskheap = [] if taskheap is None else taskheap
  333. self.max_workers_in_memory = max_workers_in_memory
  334. self.max_tasks_in_memory = max_tasks_in_memory
  335. self.on_node_join = on_node_join
  336. self.on_node_leave = on_node_leave
  337. self._mutex = threading.Lock()
  338. self.handlers = {}
  339. self._seen_types = set()
  340. self._tasks_to_resolve = {}
  341. self.rebuild_taskheap()
  342. # type: Mapping[TaskName, WeakSet[Task]]
  343. self.tasks_by_type = CallableDefaultdict(
  344. self._tasks_by_type, WeakSet)
  345. self.tasks_by_type.update(
  346. _deserialize_Task_WeakSet_Mapping(tasks_by_type, self.tasks))
  347. # type: Mapping[Hostname, WeakSet[Task]]
  348. self.tasks_by_worker = CallableDefaultdict(
  349. self._tasks_by_worker, WeakSet)
  350. self.tasks_by_worker.update(
  351. _deserialize_Task_WeakSet_Mapping(tasks_by_worker, self.tasks))
  352. @cached_property
  353. def _event(self):
  354. return self._create_dispatcher()
  355. def freeze_while(self, fun, *args, **kwargs):
  356. clear_after = kwargs.pop('clear_after', False)
  357. with self._mutex:
  358. try:
  359. return fun(*args, **kwargs)
  360. finally:
  361. if clear_after:
  362. self._clear()
  363. def clear_tasks(self, ready=True):
  364. with self._mutex:
  365. return self._clear_tasks(ready)
  366. def _clear_tasks(self, ready=True):
  367. if ready:
  368. in_progress = {
  369. uuid: task for uuid, task in self.itertasks()
  370. if task.state not in states.READY_STATES
  371. }
  372. self.tasks.clear()
  373. self.tasks.update(in_progress)
  374. else:
  375. self.tasks.clear()
  376. self._taskheap[:] = []
  377. def _clear(self, ready=True):
  378. self.workers.clear()
  379. self._clear_tasks(ready)
  380. self.event_count = 0
  381. self.task_count = 0
  382. def clear(self, ready=True):
  383. with self._mutex:
  384. return self._clear(ready)
  385. def get_or_create_worker(self, hostname, **kwargs):
  386. """Get or create worker by hostname.
  387. Returns:
  388. Tuple: of ``(worker, was_created)`` pairs.
  389. """
  390. try:
  391. worker = self.workers[hostname]
  392. if kwargs:
  393. worker.update(kwargs)
  394. return worker, False
  395. except KeyError:
  396. worker = self.workers[hostname] = self.Worker(
  397. hostname, **kwargs)
  398. return worker, True
  399. def get_or_create_task(self, uuid):
  400. """Get or create task by uuid."""
  401. try:
  402. return self.tasks[uuid], False
  403. except KeyError:
  404. task = self.tasks[uuid] = self.Task(uuid, cluster_state=self)
  405. return task, True
  406. def event(self, event):
  407. with self._mutex:
  408. return self._event(event)
  409. def task_event(self, type_, fields):
  410. """Deprecated, use :meth:`event`."""
  411. return self._event(dict(fields, type='-'.join(['task', type_])))[0]
  412. def worker_event(self, type_, fields):
  413. """Deprecated, use :meth:`event`."""
  414. return self._event(dict(fields, type='-'.join(['worker', type_])))[0]
  415. def _create_dispatcher(self):
  416. # noqa: C901
  417. # pylint: disable=too-many-statements
  418. # This code is highly optimized, but not for reusability.
  419. get_handler = self.handlers.__getitem__
  420. event_callback = self.event_callback
  421. wfields = itemgetter('hostname', 'timestamp', 'local_received')
  422. tfields = itemgetter('uuid', 'hostname', 'timestamp',
  423. 'local_received', 'clock')
  424. taskheap = self._taskheap
  425. th_append = taskheap.append
  426. th_pop = taskheap.pop
  427. # Removing events from task heap is an O(n) operation,
  428. # so easier to just account for the common number of events
  429. # for each task (PENDING->RECEIVED->STARTED->final)
  430. #: an O(n) operation
  431. max_events_in_heap = self.max_tasks_in_memory * self.heap_multiplier
  432. add_type = self._seen_types.add
  433. on_node_join, on_node_leave = self.on_node_join, self.on_node_leave
  434. tasks, Task = self.tasks, self.Task
  435. workers, Worker = self.workers, self.Worker
  436. # avoid updating LRU entry at getitem
  437. get_worker, get_task = workers.data.__getitem__, tasks.data.__getitem__
  438. get_task_by_type_set = self.tasks_by_type.__getitem__
  439. get_task_by_worker_set = self.tasks_by_worker.__getitem__
  440. def _event(event,
  441. timetuple=timetuple, KeyError=KeyError,
  442. insort=bisect.insort, created=True):
  443. self.event_count += 1
  444. if event_callback:
  445. event_callback(self, event)
  446. group, _, subject = event['type'].partition('-')
  447. try:
  448. handler = get_handler(group)
  449. except KeyError:
  450. pass
  451. else:
  452. return handler(subject, event), subject
  453. if group == 'worker':
  454. try:
  455. hostname, timestamp, local_received = wfields(event)
  456. except KeyError:
  457. pass
  458. else:
  459. is_offline = subject == 'offline'
  460. try:
  461. worker, created = get_worker(hostname), False
  462. except KeyError:
  463. if is_offline:
  464. worker, created = Worker(hostname), False
  465. else:
  466. worker = workers[hostname] = Worker(hostname)
  467. worker.event(subject, timestamp, local_received, event)
  468. if on_node_join and (created or subject == 'online'):
  469. on_node_join(worker)
  470. if on_node_leave and is_offline:
  471. on_node_leave(worker)
  472. workers.pop(hostname, None)
  473. return (worker, created), subject
  474. elif group == 'task':
  475. (uuid, hostname, timestamp,
  476. local_received, clock) = tfields(event)
  477. # task-sent event is sent by client, not worker
  478. is_client_event = subject == 'sent'
  479. try:
  480. task, task_created = get_task(uuid), False
  481. except KeyError:
  482. task = tasks[uuid] = Task(uuid, cluster_state=self)
  483. task_created = True
  484. if is_client_event:
  485. task.client = hostname
  486. else:
  487. try:
  488. worker = get_worker(hostname)
  489. except KeyError:
  490. worker = workers[hostname] = Worker(hostname)
  491. task.worker = worker
  492. if worker is not None and local_received:
  493. worker.event(None, local_received, timestamp)
  494. origin = hostname if is_client_event else worker.id
  495. # remove oldest event if exceeding the limit.
  496. heaps = len(taskheap)
  497. if heaps + 1 > max_events_in_heap:
  498. th_pop(0)
  499. # most events will be dated later than the previous.
  500. timetup = timetuple(clock, timestamp, origin, ref(task))
  501. if heaps and timetup > taskheap[-1]:
  502. th_append(timetup)
  503. else:
  504. insort(taskheap, timetup)
  505. if subject == 'received':
  506. self.task_count += 1
  507. task.event(subject, timestamp, local_received, event)
  508. task_name = task.name
  509. if task_name is not None:
  510. add_type(task_name)
  511. if task_created: # add to tasks_by_type index
  512. get_task_by_type_set(task_name).add(task)
  513. get_task_by_worker_set(hostname).add(task)
  514. if task.parent_id:
  515. try:
  516. parent_task = self.tasks[task.parent_id]
  517. except KeyError:
  518. self._add_pending_task_child(task)
  519. else:
  520. parent_task.children.add(task)
  521. try:
  522. _children = self._tasks_to_resolve.pop(uuid)
  523. except KeyError:
  524. pass
  525. else:
  526. task.children.update(_children)
  527. return (task, task_created), subject
  528. return _event
  529. def _add_pending_task_child(self, task):
  530. try:
  531. ch = self._tasks_to_resolve[task.parent_id]
  532. except KeyError:
  533. ch = self._tasks_to_resolve[task.parent_id] = WeakSet()
  534. ch.add(task)
  535. def rebuild_taskheap(self, timetuple=timetuple):
  536. heap = self._taskheap[:] = [
  537. timetuple(t.clock, t.timestamp, t.origin, ref(t))
  538. for t in values(self.tasks)
  539. ]
  540. heap.sort()
  541. def itertasks(self, limit=None):
  542. for index, row in enumerate(items(self.tasks)):
  543. yield row
  544. if limit and index + 1 >= limit:
  545. break
  546. def tasks_by_time(self, limit=None, reverse=True):
  547. """Generator yielding tasks ordered by time.
  548. Yields:
  549. Tuples of ``(uuid, Task)``.
  550. """
  551. _heap = self._taskheap
  552. if reverse:
  553. _heap = reversed(_heap)
  554. seen = set()
  555. for evtup in islice(_heap, 0, limit):
  556. task = evtup[3]()
  557. if task is not None:
  558. uuid = task.uuid
  559. if uuid not in seen:
  560. yield uuid, task
  561. seen.add(uuid)
  562. tasks_by_timestamp = tasks_by_time
  563. def _tasks_by_type(self, name, limit=None, reverse=True):
  564. """Get all tasks by type.
  565. This is slower than accessing :attr:`tasks_by_type`,
  566. but will be ordered by time.
  567. Returns:
  568. Generator: giving ``(uuid, Task)`` pairs.
  569. """
  570. return islice(
  571. ((uuid, task) for uuid, task in self.tasks_by_time(reverse=reverse)
  572. if task.name == name),
  573. 0, limit,
  574. )
  575. def _tasks_by_worker(self, hostname, limit=None, reverse=True):
  576. """Get all tasks by worker.
  577. Slower than accessing :attr:`tasks_by_worker`, but ordered by time.
  578. """
  579. return islice(
  580. ((uuid, task) for uuid, task in self.tasks_by_time(reverse=reverse)
  581. if task.worker.hostname == hostname),
  582. 0, limit,
  583. )
  584. def task_types(self):
  585. """Return a list of all seen task types."""
  586. return sorted(self._seen_types)
  587. def alive_workers(self):
  588. """Return a list of (seemingly) alive workers."""
  589. return (w for w in values(self.workers) if w.alive)
  590. def __repr__(self):
  591. return R_STATE.format(self)
  592. def __reduce__(self):
  593. return self.__class__, (
  594. self.event_callback, self.workers, self.tasks, None,
  595. self.max_workers_in_memory, self.max_tasks_in_memory,
  596. self.on_node_join, self.on_node_leave,
  597. _serialize_Task_WeakSet_Mapping(self.tasks_by_type),
  598. _serialize_Task_WeakSet_Mapping(self.tasks_by_worker),
  599. )
  600. def _serialize_Task_WeakSet_Mapping(mapping):
  601. return {name: [t.id for t in tasks] for name, tasks in items(mapping)}
  602. def _deserialize_Task_WeakSet_Mapping(mapping, tasks):
  603. return {name: WeakSet(tasks[i] for i in ids if i in tasks)
  604. for name, ids in items(mapping or {})}