state.py 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454
  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 threading
  17. from heapq import heappush
  18. from itertools import islice
  19. from operator import itemgetter
  20. from time import time
  21. from kombu.utils import kwdict
  22. from celery import states
  23. from celery.datastructures import AttributeDict, LRUCache
  24. from celery.five import items, values
  25. from celery.utils.log import get_logger
  26. # The window (in percentage) is added to the workers heartbeat
  27. # frequency. If the time between updates exceeds this window,
  28. # then the worker is considered to be offline.
  29. HEARTBEAT_EXPIRE_WINDOW = 200
  30. # Max drift between event timestamp and time of event received
  31. # before we alert that clocks may be unsynchronized.
  32. HEARTBEAT_DRIFT_MAX = 16
  33. DRIFT_WARNING = """\
  34. Substantial drift from %s may mean clocks are out of sync. Current drift is
  35. %s seconds (including message overhead).\
  36. """
  37. logger = get_logger(__name__)
  38. warn = logger.warn
  39. def heartbeat_expires(timestamp, freq=60,
  40. expire_window=HEARTBEAT_EXPIRE_WINDOW):
  41. return timestamp + freq * (expire_window / 1e2)
  42. class _lamportinfo(tuple):
  43. __slots__ = ()
  44. def __new__(cls, clock, timestamp, id, obj):
  45. return tuple.__new__(cls, (clock, timestamp, id, obj))
  46. def __repr__(self):
  47. return '_lamport(clock={0}, timestamp={1}, id={2} {3!r}'.format(*self)
  48. def __getnewargs__(self):
  49. return tuple(self)
  50. def __lt__(self, other):
  51. # 0: clock 1: timestamp 3: process id
  52. try:
  53. A, B = self[0], other[0]
  54. # uses logical clock value first
  55. if A and B: # use logical clock if available
  56. if A == B: # equal clocks use lower process id
  57. return self[3] < other[3]
  58. return A < B
  59. return self[1] < other[1] # ... or use timestamp
  60. except IndexError:
  61. return NotImplemented
  62. __gt__ = lambda self, other: other < self
  63. __le__ = lambda self, other: not other < self
  64. __ge__ = lambda self, other: not self < other
  65. clock = property(itemgetter(0))
  66. timestamp = property(itemgetter(1))
  67. id = property(itemgetter(2))
  68. obj = property(itemgetter(3))
  69. class Element(AttributeDict):
  70. """Base class for worker state elements."""
  71. class Worker(Element):
  72. """Worker State."""
  73. heartbeat_max = 4
  74. expire_window = HEARTBEAT_EXPIRE_WINDOW
  75. pid = None
  76. def __init__(self, **fields):
  77. fields.setdefault('freq', 60)
  78. super(Worker, self).__init__(**fields)
  79. self.heartbeats = []
  80. def on_online(self, timestamp=None, local_received=None, **kwargs):
  81. """Callback for the :event:`worker-online` event."""
  82. self.update(**kwargs)
  83. self.update_heartbeat(local_received, timestamp)
  84. def on_offline(self, **kwargs):
  85. """Callback for the :event:`worker-offline` event."""
  86. self.update(**kwargs)
  87. self.heartbeats = []
  88. def on_heartbeat(self, timestamp=None, local_received=None, **kwargs):
  89. """Callback for the :event:`worker-heartbeat` event."""
  90. self.update(**kwargs)
  91. self.update_heartbeat(local_received, timestamp)
  92. def update_heartbeat(self, received, timestamp):
  93. if not received or not timestamp:
  94. return
  95. drift = received - timestamp
  96. if drift > HEARTBEAT_DRIFT_MAX:
  97. warn(DRIFT_WARNING, self.hostname, drift)
  98. heartbeats, hbmax = self.heartbeats, self.heartbeat_max
  99. if not heartbeats or (received and received > heartbeats[-1]):
  100. heappush(heartbeats, received)
  101. if len(heartbeats) > hbmax:
  102. heartbeats[:] = heartbeats[hbmax:]
  103. def __repr__(self):
  104. return '<Worker: {0.hostname} ({0.status_string})'.format(self)
  105. @property
  106. def status_string(self):
  107. return 'ONLINE' if self.alive else 'OFFLINE'
  108. @property
  109. def heartbeat_expires(self):
  110. return heartbeat_expires(self.heartbeats[-1],
  111. self.freq, self.expire_window)
  112. @property
  113. def alive(self):
  114. return bool(self.heartbeats and time() < self.heartbeat_expires)
  115. @property
  116. def id(self):
  117. return '{0.hostname}.{0.pid}'.format(self)
  118. class Task(Element):
  119. """Task State."""
  120. #: How to merge out of order events.
  121. #: Disorder is detected by logical ordering (e.g. :event:`task-received`
  122. #: must have happened before a :event:`task-failed` event).
  123. #:
  124. #: A merge rule consists of a state and a list of fields to keep from
  125. #: that state. ``(RECEIVED, ('name', 'args')``, means the name and args
  126. #: fields are always taken from the RECEIVED state, and any values for
  127. #: these fields received before or after is simply ignored.
  128. merge_rules = {states.RECEIVED: ('name', 'args', 'kwargs',
  129. 'retries', 'eta', 'expires')}
  130. #: meth:`info` displays these fields by default.
  131. _info_fields = ('args', 'kwargs', 'retries', 'result',
  132. 'eta', 'runtime', 'expires', 'exception',
  133. 'exchange', 'routing_key')
  134. #: Default values.
  135. _defaults = dict(uuid=None, name=None, state=states.PENDING,
  136. received=False, sent=False, started=False,
  137. succeeded=False, failed=False, retried=False,
  138. revoked=False, args=None, kwargs=None, eta=None,
  139. expires=None, retries=None, worker=None, result=None,
  140. exception=None, timestamp=None, runtime=None,
  141. traceback=None, exchange=None, routing_key=None,
  142. clock=0)
  143. def __init__(self, **fields):
  144. super(Task, self).__init__(**dict(self._defaults, **fields))
  145. def update(self, state, timestamp, fields):
  146. """Update state from new event.
  147. :param state: State from event.
  148. :param timestamp: Timestamp from event.
  149. :param fields: Event data.
  150. """
  151. time_received = fields.get('local_received') or 0
  152. if self.worker and time_received:
  153. self.worker.update_heartbeat(time_received, timestamp)
  154. if state != states.RETRY and self.state != states.RETRY and \
  155. states.state(state) < states.state(self.state):
  156. # this state logically happens-before the current state, so merge.
  157. self.merge(state, timestamp, fields)
  158. else:
  159. self.state = state
  160. self.timestamp = timestamp
  161. super(Task, self).update(fields)
  162. def merge(self, state, timestamp, fields):
  163. """Merge with out of order event."""
  164. keep = self.merge_rules.get(state)
  165. if keep is not None:
  166. fields = dict((key, fields.get(key)) for key in keep)
  167. super(Task, self).update(fields)
  168. def on_sent(self, timestamp=None, **fields):
  169. """Callback for the :event:`task-sent` event."""
  170. self.sent = timestamp
  171. self.update(states.PENDING, timestamp, fields)
  172. def on_received(self, timestamp=None, **fields):
  173. """Callback for the :event:`task-received` event."""
  174. self.received = timestamp
  175. self.update(states.RECEIVED, timestamp, fields)
  176. def on_started(self, timestamp=None, **fields):
  177. """Callback for the :event:`task-started` event."""
  178. self.started = timestamp
  179. self.update(states.STARTED, timestamp, fields)
  180. def on_failed(self, timestamp=None, **fields):
  181. """Callback for the :event:`task-failed` event."""
  182. self.failed = timestamp
  183. self.update(states.FAILURE, timestamp, fields)
  184. def on_retried(self, timestamp=None, **fields):
  185. """Callback for the :event:`task-retried` event."""
  186. self.retried = timestamp
  187. self.update(states.RETRY, timestamp, fields)
  188. def on_succeeded(self, timestamp=None, **fields):
  189. """Callback for the :event:`task-succeeded` event."""
  190. self.succeeded = timestamp
  191. self.update(states.SUCCESS, timestamp, fields)
  192. def on_revoked(self, timestamp=None, **fields):
  193. """Callback for the :event:`task-revoked` event."""
  194. self.revoked = timestamp
  195. self.update(states.REVOKED, timestamp, fields)
  196. def on_unknown_event(self, type, timestamp=None, **fields):
  197. self.update(type.upper(), timestamp, fields)
  198. def info(self, fields=None, extra=[]):
  199. """Information about this task suitable for on-screen display."""
  200. fields = self._info_fields if fields is None else fields
  201. def _keys():
  202. for key in list(fields) + list(extra):
  203. value = getattr(self, key, None)
  204. if value is not None:
  205. yield key, value
  206. return dict(_keys())
  207. def __repr__(self):
  208. return '<Task: {0.name}({0.uuid}) {0.state}>'.format(self)
  209. @property
  210. def ready(self):
  211. return self.state in states.READY_STATES
  212. class State(object):
  213. """Records clusters state."""
  214. event_count = 0
  215. task_count = 0
  216. def __init__(self, callback=None,
  217. max_workers_in_memory=5000, max_tasks_in_memory=10000):
  218. self.max_workers_in_memory = max_workers_in_memory
  219. self.max_tasks_in_memory = max_tasks_in_memory
  220. self.workers = LRUCache(limit=self.max_workers_in_memory)
  221. self.tasks = LRUCache(limit=self.max_tasks_in_memory)
  222. self._taskheap = []
  223. self.event_callback = callback
  224. self._mutex = threading.Lock()
  225. def freeze_while(self, fun, *args, **kwargs):
  226. clear_after = kwargs.pop('clear_after', False)
  227. with self._mutex:
  228. try:
  229. return fun(*args, **kwargs)
  230. finally:
  231. if clear_after:
  232. self._clear()
  233. def clear_tasks(self, ready=True):
  234. with self._mutex:
  235. return self._clear_tasks(ready)
  236. def _clear_tasks(self, ready=True):
  237. if ready:
  238. in_progress = dict(
  239. (uuid, task) for uuid, task in self.itertasks()
  240. if task.state not in states.READY_STATES)
  241. self.tasks.clear()
  242. self.tasks.update(in_progress)
  243. else:
  244. self.tasks.clear()
  245. self._taskheap[:] = []
  246. def _clear(self, ready=True):
  247. self.workers.clear()
  248. self._clear_tasks(ready)
  249. self.event_count = 0
  250. self.task_count = 0
  251. def clear(self, ready=True):
  252. with self._mutex:
  253. return self._clear(ready)
  254. def get_or_create_worker(self, hostname, **kwargs):
  255. """Get or create worker by hostname.
  256. Returns tuple of ``(worker, was_created)``.
  257. """
  258. try:
  259. worker = self.workers[hostname]
  260. worker.update(kwargs)
  261. return worker, False
  262. except KeyError:
  263. worker = self.workers[hostname] = Worker(
  264. hostname=hostname, **kwargs)
  265. return worker, True
  266. def get_or_create_task(self, uuid):
  267. """Get or create task by uuid."""
  268. try:
  269. return self.tasks[uuid], True
  270. except KeyError:
  271. task = self.tasks[uuid] = Task(uuid=uuid)
  272. return task, False
  273. def worker_event(self, type, fields):
  274. """Process worker event."""
  275. try:
  276. hostname = fields['hostname']
  277. except KeyError:
  278. pass
  279. else:
  280. worker, created = self.get_or_create_worker(hostname)
  281. handler = getattr(worker, 'on_' + type, None)
  282. if handler:
  283. handler(**fields)
  284. return worker, created
  285. def task_event(self, type, fields):
  286. """Process task event."""
  287. uuid = fields.pop('uuid')
  288. hostname = fields.pop('hostname')
  289. worker, _ = self.get_or_create_worker(hostname)
  290. task, created = self.get_or_create_task(uuid)
  291. task.worker = worker
  292. taskheap = self._taskheap
  293. timestamp = fields.get('timestamp') or 0
  294. clock = 0 if type == 'sent' else fields.get('clock')
  295. heappush(taskheap, _lamportinfo(clock, timestamp, worker.id, task))
  296. curcount = len(self.tasks)
  297. if len(taskheap) > self.max_tasks_in_memory * 2:
  298. taskheap[:] = taskheap[curcount:]
  299. handler = getattr(task, 'on_' + type, None)
  300. if type == 'received':
  301. self.task_count += 1
  302. if handler:
  303. handler(**fields)
  304. else:
  305. task.on_unknown_event(type, **fields)
  306. return created
  307. def event(self, event):
  308. with self._mutex:
  309. return self._dispatch_event(event)
  310. def _dispatch_event(self, event):
  311. self.event_count += 1
  312. event = kwdict(event)
  313. group, _, subject = event.pop('type').partition('-')
  314. getattr(self, group + '_event')(subject, event)
  315. if self.event_callback:
  316. self.event_callback(self, event)
  317. def itertasks(self, limit=None):
  318. for index, row in enumerate(items(self.tasks)):
  319. yield row
  320. if limit and index + 1 >= limit:
  321. break
  322. def tasks_by_time(self, limit=None):
  323. """Generator giving tasks ordered by time,
  324. in ``(uuid, Task)`` tuples."""
  325. seen = set()
  326. for evtup in islice(reversed(self._taskheap), 0, limit):
  327. uuid = evtup[3].uuid
  328. if uuid not in seen:
  329. yield uuid, evtup[3]
  330. seen.add(uuid)
  331. tasks_by_timestamp = tasks_by_time
  332. def tasks_by_type(self, name, limit=None):
  333. """Get all tasks by type.
  334. Returns a list of ``(uuid, Task)`` tuples.
  335. """
  336. return islice(
  337. ((uuid, task) for uuid, task in self.tasks_by_time()
  338. if task.name == name),
  339. 0, limit,
  340. )
  341. def tasks_by_worker(self, hostname, limit=None):
  342. """Get all tasks by worker.
  343. """
  344. return islice(
  345. ((uuid, task) for uuid, task in self.tasks_by_time()
  346. if task.worker.hostname == hostname),
  347. 0, limit,
  348. )
  349. def task_types(self):
  350. """Returns a list of all seen task types."""
  351. return list(sorted(set(task.name for task in values(self.tasks))))
  352. def alive_workers(self):
  353. """Returns a list of (seemingly) alive workers."""
  354. return [w for w in values(self.workers) if w.alive]
  355. def __repr__(self):
  356. return '<State: events={0.event_count} tasks={0.task_count}>' \
  357. .format(self)
  358. def __getstate__(self):
  359. d = dict(vars(self))
  360. d.pop('_mutex')
  361. return d
  362. def __setstate__(self, state):
  363. self.__dict__ = state
  364. self._mutex = threading.Lock()
  365. state = State()