state.py 20 KB

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