events.py 82 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208
  1. # -*- coding: utf-8 -*-
  2. # Copyright 2014-2016 OpenMarket Ltd
  3. # Copyright 2018 New Vector Ltd
  4. #
  5. # Licensed under the Apache License, Version 2.0 (the "License");
  6. # you may not use this file except in compliance with the License.
  7. # You may obtain a copy of the License at
  8. #
  9. # http://www.apache.org/licenses/LICENSE-2.0
  10. #
  11. # Unless required by applicable law or agreed to in writing, software
  12. # distributed under the License is distributed on an "AS IS" BASIS,
  13. # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  14. # See the License for the specific language governing permissions and
  15. # limitations under the License.
  16. from collections import OrderedDict, deque, namedtuple
  17. from functools import wraps
  18. import itertools
  19. import logging
  20. from canonicaljson import json
  21. from twisted.internet import defer
  22. from synapse.storage.events_worker import EventsWorkerStore
  23. from synapse.util.async import ObservableDeferred
  24. from synapse.util.frozenutils import frozendict_json_encoder
  25. from synapse.util.logcontext import (
  26. PreserveLoggingContext, make_deferred_yieldable,
  27. )
  28. from synapse.util.logutils import log_function
  29. from synapse.util.metrics import Measure
  30. from synapse.api.constants import EventTypes
  31. from synapse.api.errors import SynapseError
  32. from synapse.util.caches.descriptors import cached, cachedInlineCallbacks
  33. from synapse.types import get_domain_from_id, RoomStreamToken
  34. import synapse.metrics
  35. # these are only included to make the type annotations work
  36. from synapse.events import EventBase # noqa: F401
  37. from synapse.events.snapshot import EventContext # noqa: F401
  38. from six.moves import range
  39. from six import itervalues, iteritems
  40. from prometheus_client import Counter
  41. logger = logging.getLogger(__name__)
  42. persist_event_counter = Counter("synapse_storage_events_persisted_events", "")
  43. event_counter = Counter("synapse_storage_events_persisted_events_sep", "",
  44. ["type", "origin_type", "origin_entity"])
  45. # The number of times we are recalculating the current state
  46. state_delta_counter = Counter("synapse_storage_events_state_delta", "")
  47. # The number of times we are recalculating state when there is only a
  48. # single forward extremity
  49. state_delta_single_event_counter = Counter(
  50. "synapse_storage_events_state_delta_single_event", "")
  51. # The number of times we are reculating state when we could have resonably
  52. # calculated the delta when we calculated the state for an event we were
  53. # persisting.
  54. state_delta_reuse_delta_counter = Counter(
  55. "synapse_storage_events_state_delta_reuse_delta", "")
  56. def encode_json(json_object):
  57. return frozendict_json_encoder.encode(json_object)
  58. class _EventPeristenceQueue(object):
  59. """Queues up events so that they can be persisted in bulk with only one
  60. concurrent transaction per room.
  61. """
  62. _EventPersistQueueItem = namedtuple("_EventPersistQueueItem", (
  63. "events_and_contexts", "backfilled", "deferred",
  64. ))
  65. def __init__(self):
  66. self._event_persist_queues = {}
  67. self._currently_persisting_rooms = set()
  68. def add_to_queue(self, room_id, events_and_contexts, backfilled):
  69. """Add events to the queue, with the given persist_event options.
  70. NB: due to the normal usage pattern of this method, it does *not*
  71. follow the synapse logcontext rules, and leaves the logcontext in
  72. place whether or not the returned deferred is ready.
  73. Args:
  74. room_id (str):
  75. events_and_contexts (list[(EventBase, EventContext)]):
  76. backfilled (bool):
  77. Returns:
  78. defer.Deferred: a deferred which will resolve once the events are
  79. persisted. Runs its callbacks *without* a logcontext.
  80. """
  81. queue = self._event_persist_queues.setdefault(room_id, deque())
  82. if queue:
  83. # if the last item in the queue has the same `backfilled` setting,
  84. # we can just add these new events to that item.
  85. end_item = queue[-1]
  86. if end_item.backfilled == backfilled:
  87. end_item.events_and_contexts.extend(events_and_contexts)
  88. return end_item.deferred.observe()
  89. deferred = ObservableDeferred(defer.Deferred(), consumeErrors=True)
  90. queue.append(self._EventPersistQueueItem(
  91. events_and_contexts=events_and_contexts,
  92. backfilled=backfilled,
  93. deferred=deferred,
  94. ))
  95. return deferred.observe()
  96. def handle_queue(self, room_id, per_item_callback):
  97. """Attempts to handle the queue for a room if not already being handled.
  98. The given callback will be invoked with for each item in the queue,
  99. of type _EventPersistQueueItem. The per_item_callback will continuously
  100. be called with new items, unless the queue becomnes empty. The return
  101. value of the function will be given to the deferreds waiting on the item,
  102. exceptions will be passed to the deferreds as well.
  103. This function should therefore be called whenever anything is added
  104. to the queue.
  105. If another callback is currently handling the queue then it will not be
  106. invoked.
  107. """
  108. if room_id in self._currently_persisting_rooms:
  109. return
  110. self._currently_persisting_rooms.add(room_id)
  111. @defer.inlineCallbacks
  112. def handle_queue_loop():
  113. try:
  114. queue = self._get_drainining_queue(room_id)
  115. for item in queue:
  116. # handle_queue_loop runs in the sentinel logcontext, so
  117. # there is no need to preserve_fn when running the
  118. # callbacks on the deferred.
  119. try:
  120. ret = yield per_item_callback(item)
  121. item.deferred.callback(ret)
  122. except Exception:
  123. item.deferred.errback()
  124. finally:
  125. queue = self._event_persist_queues.pop(room_id, None)
  126. if queue:
  127. self._event_persist_queues[room_id] = queue
  128. self._currently_persisting_rooms.discard(room_id)
  129. # set handle_queue_loop off on the background. We don't want to
  130. # attribute work done in it to the current request, so we drop the
  131. # logcontext altogether.
  132. with PreserveLoggingContext():
  133. handle_queue_loop()
  134. def _get_drainining_queue(self, room_id):
  135. queue = self._event_persist_queues.setdefault(room_id, deque())
  136. try:
  137. while True:
  138. yield queue.popleft()
  139. except IndexError:
  140. # Queue has been drained.
  141. pass
  142. _EventCacheEntry = namedtuple("_EventCacheEntry", ("event", "redacted_event"))
  143. def _retry_on_integrity_error(func):
  144. """Wraps a database function so that it gets retried on IntegrityError,
  145. with `delete_existing=True` passed in.
  146. Args:
  147. func: function that returns a Deferred and accepts a `delete_existing` arg
  148. """
  149. @wraps(func)
  150. @defer.inlineCallbacks
  151. def f(self, *args, **kwargs):
  152. try:
  153. res = yield func(self, *args, **kwargs)
  154. except self.database_engine.module.IntegrityError:
  155. logger.exception("IntegrityError, retrying.")
  156. res = yield func(self, *args, delete_existing=True, **kwargs)
  157. defer.returnValue(res)
  158. return f
  159. class EventsStore(EventsWorkerStore):
  160. EVENT_ORIGIN_SERVER_TS_NAME = "event_origin_server_ts"
  161. EVENT_FIELDS_SENDER_URL_UPDATE_NAME = "event_fields_sender_url"
  162. def __init__(self, db_conn, hs):
  163. super(EventsStore, self).__init__(db_conn, hs)
  164. self.register_background_update_handler(
  165. self.EVENT_ORIGIN_SERVER_TS_NAME, self._background_reindex_origin_server_ts
  166. )
  167. self.register_background_update_handler(
  168. self.EVENT_FIELDS_SENDER_URL_UPDATE_NAME,
  169. self._background_reindex_fields_sender,
  170. )
  171. self.register_background_index_update(
  172. "event_contains_url_index",
  173. index_name="event_contains_url_index",
  174. table="events",
  175. columns=["room_id", "topological_ordering", "stream_ordering"],
  176. where_clause="contains_url = true AND outlier = false",
  177. )
  178. # an event_id index on event_search is useful for the purge_history
  179. # api. Plus it means we get to enforce some integrity with a UNIQUE
  180. # clause
  181. self.register_background_index_update(
  182. "event_search_event_id_idx",
  183. index_name="event_search_event_id_idx",
  184. table="event_search",
  185. columns=["event_id"],
  186. unique=True,
  187. psql_only=True,
  188. )
  189. self._event_persist_queue = _EventPeristenceQueue()
  190. self._state_resolution_handler = hs.get_state_resolution_handler()
  191. def persist_events(self, events_and_contexts, backfilled=False):
  192. """
  193. Write events to the database
  194. Args:
  195. events_and_contexts: list of tuples of (event, context)
  196. backfilled: ?
  197. """
  198. partitioned = {}
  199. for event, ctx in events_and_contexts:
  200. partitioned.setdefault(event.room_id, []).append((event, ctx))
  201. deferreds = []
  202. for room_id, evs_ctxs in iteritems(partitioned):
  203. d = self._event_persist_queue.add_to_queue(
  204. room_id, evs_ctxs,
  205. backfilled=backfilled,
  206. )
  207. deferreds.append(d)
  208. for room_id in partitioned:
  209. self._maybe_start_persisting(room_id)
  210. return make_deferred_yieldable(
  211. defer.gatherResults(deferreds, consumeErrors=True)
  212. )
  213. @defer.inlineCallbacks
  214. @log_function
  215. def persist_event(self, event, context, backfilled=False):
  216. """
  217. Args:
  218. event (EventBase):
  219. context (EventContext):
  220. backfilled (bool):
  221. Returns:
  222. Deferred: resolves to (int, int): the stream ordering of ``event``,
  223. and the stream ordering of the latest persisted event
  224. """
  225. deferred = self._event_persist_queue.add_to_queue(
  226. event.room_id, [(event, context)],
  227. backfilled=backfilled,
  228. )
  229. self._maybe_start_persisting(event.room_id)
  230. yield make_deferred_yieldable(deferred)
  231. max_persisted_id = yield self._stream_id_gen.get_current_token()
  232. defer.returnValue((event.internal_metadata.stream_ordering, max_persisted_id))
  233. def _maybe_start_persisting(self, room_id):
  234. @defer.inlineCallbacks
  235. def persisting_queue(item):
  236. with Measure(self._clock, "persist_events"):
  237. yield self._persist_events(
  238. item.events_and_contexts,
  239. backfilled=item.backfilled,
  240. )
  241. self._event_persist_queue.handle_queue(room_id, persisting_queue)
  242. @_retry_on_integrity_error
  243. @defer.inlineCallbacks
  244. def _persist_events(self, events_and_contexts, backfilled=False,
  245. delete_existing=False):
  246. """Persist events to db
  247. Args:
  248. events_and_contexts (list[(EventBase, EventContext)]):
  249. backfilled (bool):
  250. delete_existing (bool):
  251. Returns:
  252. Deferred: resolves when the events have been persisted
  253. """
  254. if not events_and_contexts:
  255. return
  256. if backfilled:
  257. stream_ordering_manager = self._backfill_id_gen.get_next_mult(
  258. len(events_and_contexts)
  259. )
  260. else:
  261. stream_ordering_manager = self._stream_id_gen.get_next_mult(
  262. len(events_and_contexts)
  263. )
  264. with stream_ordering_manager as stream_orderings:
  265. for (event, context), stream, in zip(
  266. events_and_contexts, stream_orderings
  267. ):
  268. event.internal_metadata.stream_ordering = stream
  269. chunks = [
  270. events_and_contexts[x:x + 100]
  271. for x in range(0, len(events_and_contexts), 100)
  272. ]
  273. for chunk in chunks:
  274. # We can't easily parallelize these since different chunks
  275. # might contain the same event. :(
  276. # NB: Assumes that we are only persisting events for one room
  277. # at a time.
  278. # map room_id->list[event_ids] giving the new forward
  279. # extremities in each room
  280. new_forward_extremeties = {}
  281. # map room_id->(type,state_key)->event_id tracking the full
  282. # state in each room after adding these events
  283. current_state_for_room = {}
  284. # map room_id->(to_delete, to_insert) where each entry is
  285. # a map (type,key)->event_id giving the state delta in each
  286. # room
  287. state_delta_for_room = {}
  288. if not backfilled:
  289. with Measure(self._clock, "_calculate_state_and_extrem"):
  290. # Work out the new "current state" for each room.
  291. # We do this by working out what the new extremities are and then
  292. # calculating the state from that.
  293. events_by_room = {}
  294. for event, context in chunk:
  295. events_by_room.setdefault(event.room_id, []).append(
  296. (event, context)
  297. )
  298. for room_id, ev_ctx_rm in iteritems(events_by_room):
  299. # Work out new extremities by recursively adding and removing
  300. # the new events.
  301. latest_event_ids = yield self.get_latest_event_ids_in_room(
  302. room_id
  303. )
  304. new_latest_event_ids = yield self._calculate_new_extremeties(
  305. room_id, ev_ctx_rm, latest_event_ids
  306. )
  307. latest_event_ids = set(latest_event_ids)
  308. if new_latest_event_ids == latest_event_ids:
  309. # No change in extremities, so no change in state
  310. continue
  311. new_forward_extremeties[room_id] = new_latest_event_ids
  312. len_1 = (
  313. len(latest_event_ids) == 1
  314. and len(new_latest_event_ids) == 1
  315. )
  316. if len_1:
  317. all_single_prev_not_state = all(
  318. len(event.prev_events) == 1
  319. and not event.is_state()
  320. for event, ctx in ev_ctx_rm
  321. )
  322. # Don't bother calculating state if they're just
  323. # a long chain of single ancestor non-state events.
  324. if all_single_prev_not_state:
  325. continue
  326. state_delta_counter.inc()
  327. if len(new_latest_event_ids) == 1:
  328. state_delta_single_event_counter.inc()
  329. # This is a fairly handwavey check to see if we could
  330. # have guessed what the delta would have been when
  331. # processing one of these events.
  332. # What we're interested in is if the latest extremities
  333. # were the same when we created the event as they are
  334. # now. When this server creates a new event (as opposed
  335. # to receiving it over federation) it will use the
  336. # forward extremities as the prev_events, so we can
  337. # guess this by looking at the prev_events and checking
  338. # if they match the current forward extremities.
  339. for ev, _ in ev_ctx_rm:
  340. prev_event_ids = set(e for e, _ in ev.prev_events)
  341. if latest_event_ids == prev_event_ids:
  342. state_delta_reuse_delta_counter.inc()
  343. break
  344. logger.info(
  345. "Calculating state delta for room %s", room_id,
  346. )
  347. current_state = yield self._get_new_state_after_events(
  348. room_id,
  349. ev_ctx_rm,
  350. latest_event_ids,
  351. new_latest_event_ids,
  352. )
  353. if current_state is not None:
  354. current_state_for_room[room_id] = current_state
  355. delta = yield self._calculate_state_delta(
  356. room_id, current_state,
  357. )
  358. if delta is not None:
  359. state_delta_for_room[room_id] = delta
  360. yield self.runInteraction(
  361. "persist_events",
  362. self._persist_events_txn,
  363. events_and_contexts=chunk,
  364. backfilled=backfilled,
  365. delete_existing=delete_existing,
  366. state_delta_for_room=state_delta_for_room,
  367. new_forward_extremeties=new_forward_extremeties,
  368. )
  369. persist_event_counter.inc(len(chunk))
  370. synapse.metrics.event_persisted_position.set(
  371. chunk[-1][0].internal_metadata.stream_ordering,
  372. )
  373. for event, context in chunk:
  374. if context.app_service:
  375. origin_type = "local"
  376. origin_entity = context.app_service.id
  377. elif self.hs.is_mine_id(event.sender):
  378. origin_type = "local"
  379. origin_entity = "*client*"
  380. else:
  381. origin_type = "remote"
  382. origin_entity = get_domain_from_id(event.sender)
  383. event_counter.labels(event.type, origin_type, origin_entity).inc()
  384. for room_id, new_state in iteritems(current_state_for_room):
  385. self.get_current_state_ids.prefill(
  386. (room_id, ), new_state
  387. )
  388. for room_id, latest_event_ids in iteritems(new_forward_extremeties):
  389. self.get_latest_event_ids_in_room.prefill(
  390. (room_id,), list(latest_event_ids)
  391. )
  392. @defer.inlineCallbacks
  393. def _calculate_new_extremeties(self, room_id, event_contexts, latest_event_ids):
  394. """Calculates the new forward extremeties for a room given events to
  395. persist.
  396. Assumes that we are only persisting events for one room at a time.
  397. """
  398. new_latest_event_ids = set(latest_event_ids)
  399. # First, add all the new events to the list
  400. new_latest_event_ids.update(
  401. event.event_id for event, ctx in event_contexts
  402. if not event.internal_metadata.is_outlier() and not ctx.rejected
  403. )
  404. # Now remove all events that are referenced by the to-be-added events
  405. new_latest_event_ids.difference_update(
  406. e_id
  407. for event, ctx in event_contexts
  408. for e_id, _ in event.prev_events
  409. if not event.internal_metadata.is_outlier() and not ctx.rejected
  410. )
  411. # And finally remove any events that are referenced by previously added
  412. # events.
  413. rows = yield self._simple_select_many_batch(
  414. table="event_edges",
  415. column="prev_event_id",
  416. iterable=list(new_latest_event_ids),
  417. retcols=["prev_event_id"],
  418. keyvalues={
  419. "room_id": room_id,
  420. "is_state": False,
  421. },
  422. desc="_calculate_new_extremeties",
  423. )
  424. new_latest_event_ids.difference_update(
  425. row["prev_event_id"] for row in rows
  426. )
  427. defer.returnValue(new_latest_event_ids)
  428. @defer.inlineCallbacks
  429. def _get_new_state_after_events(self, room_id, events_context, old_latest_event_ids,
  430. new_latest_event_ids):
  431. """Calculate the current state dict after adding some new events to
  432. a room
  433. Args:
  434. room_id (str):
  435. room to which the events are being added. Used for logging etc
  436. events_context (list[(EventBase, EventContext)]):
  437. events and contexts which are being added to the room
  438. old_latest_event_ids (iterable[str]):
  439. the old forward extremities for the room.
  440. new_latest_event_ids (iterable[str]):
  441. the new forward extremities for the room.
  442. Returns:
  443. Deferred[dict[(str,str), str]|None]:
  444. None if there are no changes to the room state, or
  445. a dict of (type, state_key) -> event_id].
  446. """
  447. if not new_latest_event_ids:
  448. return
  449. # map from state_group to ((type, key) -> event_id) state map
  450. state_groups_map = {}
  451. for ev, ctx in events_context:
  452. if ctx.state_group is None:
  453. # I don't think this can happen, but let's double-check
  454. raise Exception(
  455. "Context for new extremity event %s has no state "
  456. "group" % (ev.event_id, ),
  457. )
  458. if ctx.state_group in state_groups_map:
  459. continue
  460. state_groups_map[ctx.state_group] = ctx.current_state_ids
  461. # We need to map the event_ids to their state groups. First, let's
  462. # check if the event is one we're persisting, in which case we can
  463. # pull the state group from its context.
  464. # Otherwise we need to pull the state group from the database.
  465. # Set of events we need to fetch groups for. (We know none of the old
  466. # extremities are going to be in events_context).
  467. missing_event_ids = set(old_latest_event_ids)
  468. event_id_to_state_group = {}
  469. for event_id in new_latest_event_ids:
  470. # First search in the list of new events we're adding.
  471. for ev, ctx in events_context:
  472. if event_id == ev.event_id:
  473. event_id_to_state_group[event_id] = ctx.state_group
  474. break
  475. else:
  476. # If we couldn't find it, then we'll need to pull
  477. # the state from the database
  478. missing_event_ids.add(event_id)
  479. if missing_event_ids:
  480. # Now pull out the state groups for any missing events from DB
  481. event_to_groups = yield self._get_state_group_for_events(
  482. missing_event_ids,
  483. )
  484. event_id_to_state_group.update(event_to_groups)
  485. # State groups of old_latest_event_ids
  486. old_state_groups = set(
  487. event_id_to_state_group[evid] for evid in old_latest_event_ids
  488. )
  489. # State groups of new_latest_event_ids
  490. new_state_groups = set(
  491. event_id_to_state_group[evid] for evid in new_latest_event_ids
  492. )
  493. # If they old and new groups are the same then we don't need to do
  494. # anything.
  495. if old_state_groups == new_state_groups:
  496. return
  497. # Now that we have calculated new_state_groups we need to get
  498. # their state IDs so we can resolve to a single state set.
  499. missing_state = new_state_groups - set(state_groups_map)
  500. if missing_state:
  501. group_to_state = yield self._get_state_for_groups(missing_state)
  502. state_groups_map.update(group_to_state)
  503. if len(new_state_groups) == 1:
  504. # If there is only one state group, then we know what the current
  505. # state is.
  506. defer.returnValue(state_groups_map[new_state_groups.pop()])
  507. # Ok, we need to defer to the state handler to resolve our state sets.
  508. def get_events(ev_ids):
  509. return self.get_events(
  510. ev_ids, get_prev_content=False, check_redacted=False,
  511. )
  512. state_groups = {
  513. sg: state_groups_map[sg] for sg in new_state_groups
  514. }
  515. events_map = {ev.event_id: ev for ev, _ in events_context}
  516. logger.debug("calling resolve_state_groups from preserve_events")
  517. res = yield self._state_resolution_handler.resolve_state_groups(
  518. room_id, state_groups, events_map, get_events
  519. )
  520. defer.returnValue(res.state)
  521. @defer.inlineCallbacks
  522. def _calculate_state_delta(self, room_id, current_state):
  523. """Calculate the new state deltas for a room.
  524. Assumes that we are only persisting events for one room at a time.
  525. Returns:
  526. 2-tuple (to_delete, to_insert) where both are state dicts,
  527. i.e. (type, state_key) -> event_id. `to_delete` are the entries to
  528. first be deleted from current_state_events, `to_insert` are entries
  529. to insert.
  530. """
  531. existing_state = yield self.get_current_state_ids(room_id)
  532. existing_events = set(itervalues(existing_state))
  533. new_events = set(ev_id for ev_id in itervalues(current_state))
  534. changed_events = existing_events ^ new_events
  535. if not changed_events:
  536. return
  537. to_delete = {
  538. key: ev_id for key, ev_id in iteritems(existing_state)
  539. if ev_id in changed_events
  540. }
  541. events_to_insert = (new_events - existing_events)
  542. to_insert = {
  543. key: ev_id for key, ev_id in iteritems(current_state)
  544. if ev_id in events_to_insert
  545. }
  546. defer.returnValue((to_delete, to_insert))
  547. @log_function
  548. def _persist_events_txn(self, txn, events_and_contexts, backfilled,
  549. delete_existing=False, state_delta_for_room={},
  550. new_forward_extremeties={}):
  551. """Insert some number of room events into the necessary database tables.
  552. Rejected events are only inserted into the events table, the events_json table,
  553. and the rejections table. Things reading from those table will need to check
  554. whether the event was rejected.
  555. Args:
  556. txn (twisted.enterprise.adbapi.Connection): db connection
  557. events_and_contexts (list[(EventBase, EventContext)]):
  558. events to persist
  559. backfilled (bool): True if the events were backfilled
  560. delete_existing (bool): True to purge existing table rows for the
  561. events from the database. This is useful when retrying due to
  562. IntegrityError.
  563. state_delta_for_room (dict[str, (list[str], list[str])]):
  564. The current-state delta for each room. For each room, a tuple
  565. (to_delete, to_insert), being a list of event ids to be removed
  566. from the current state, and a list of event ids to be added to
  567. the current state.
  568. new_forward_extremeties (dict[str, list[str]]):
  569. The new forward extremities for each room. For each room, a
  570. list of the event ids which are the forward extremities.
  571. """
  572. all_events_and_contexts = events_and_contexts
  573. max_stream_order = events_and_contexts[-1][0].internal_metadata.stream_ordering
  574. self._update_current_state_txn(txn, state_delta_for_room, max_stream_order)
  575. self._update_forward_extremities_txn(
  576. txn,
  577. new_forward_extremities=new_forward_extremeties,
  578. max_stream_order=max_stream_order,
  579. )
  580. # Ensure that we don't have the same event twice.
  581. events_and_contexts = self._filter_events_and_contexts_for_duplicates(
  582. events_and_contexts,
  583. )
  584. self._update_room_depths_txn(
  585. txn,
  586. events_and_contexts=events_and_contexts,
  587. backfilled=backfilled,
  588. )
  589. # _update_outliers_txn filters out any events which have already been
  590. # persisted, and returns the filtered list.
  591. events_and_contexts = self._update_outliers_txn(
  592. txn,
  593. events_and_contexts=events_and_contexts,
  594. )
  595. # From this point onwards the events are only events that we haven't
  596. # seen before.
  597. if delete_existing:
  598. # For paranoia reasons, we go and delete all the existing entries
  599. # for these events so we can reinsert them.
  600. # This gets around any problems with some tables already having
  601. # entries.
  602. self._delete_existing_rows_txn(
  603. txn,
  604. events_and_contexts=events_and_contexts,
  605. )
  606. self._store_event_txn(
  607. txn,
  608. events_and_contexts=events_and_contexts,
  609. )
  610. # Insert into event_to_state_groups.
  611. self._store_event_state_mappings_txn(txn, events_and_contexts)
  612. # _store_rejected_events_txn filters out any events which were
  613. # rejected, and returns the filtered list.
  614. events_and_contexts = self._store_rejected_events_txn(
  615. txn,
  616. events_and_contexts=events_and_contexts,
  617. )
  618. # From this point onwards the events are only ones that weren't
  619. # rejected.
  620. self._update_metadata_tables_txn(
  621. txn,
  622. events_and_contexts=events_and_contexts,
  623. all_events_and_contexts=all_events_and_contexts,
  624. backfilled=backfilled,
  625. )
  626. def _update_current_state_txn(self, txn, state_delta_by_room, max_stream_order):
  627. for room_id, current_state_tuple in iteritems(state_delta_by_room):
  628. to_delete, to_insert = current_state_tuple
  629. txn.executemany(
  630. "DELETE FROM current_state_events WHERE event_id = ?",
  631. [(ev_id,) for ev_id in itervalues(to_delete)],
  632. )
  633. self._simple_insert_many_txn(
  634. txn,
  635. table="current_state_events",
  636. values=[
  637. {
  638. "event_id": ev_id,
  639. "room_id": room_id,
  640. "type": key[0],
  641. "state_key": key[1],
  642. }
  643. for key, ev_id in iteritems(to_insert)
  644. ],
  645. )
  646. state_deltas = {key: None for key in to_delete}
  647. state_deltas.update(to_insert)
  648. self._simple_insert_many_txn(
  649. txn,
  650. table="current_state_delta_stream",
  651. values=[
  652. {
  653. "stream_id": max_stream_order,
  654. "room_id": room_id,
  655. "type": key[0],
  656. "state_key": key[1],
  657. "event_id": ev_id,
  658. "prev_event_id": to_delete.get(key, None),
  659. }
  660. for key, ev_id in iteritems(state_deltas)
  661. ]
  662. )
  663. txn.call_after(
  664. self._curr_state_delta_stream_cache.entity_has_changed,
  665. room_id, max_stream_order,
  666. )
  667. # Invalidate the various caches
  668. # Figure out the changes of membership to invalidate the
  669. # `get_rooms_for_user` cache.
  670. # We find out which membership events we may have deleted
  671. # and which we have added, then we invlidate the caches for all
  672. # those users.
  673. members_changed = set(
  674. state_key for ev_type, state_key in state_deltas
  675. if ev_type == EventTypes.Member
  676. )
  677. for member in members_changed:
  678. self._invalidate_cache_and_stream(
  679. txn, self.get_rooms_for_user_with_stream_ordering, (member,)
  680. )
  681. for host in set(get_domain_from_id(u) for u in members_changed):
  682. self._invalidate_cache_and_stream(
  683. txn, self.is_host_joined, (room_id, host)
  684. )
  685. self._invalidate_cache_and_stream(
  686. txn, self.was_host_joined, (room_id, host)
  687. )
  688. self._invalidate_cache_and_stream(
  689. txn, self.get_users_in_room, (room_id,)
  690. )
  691. self._invalidate_cache_and_stream(
  692. txn, self.get_current_state_ids, (room_id,)
  693. )
  694. def _update_forward_extremities_txn(self, txn, new_forward_extremities,
  695. max_stream_order):
  696. for room_id, new_extrem in iteritems(new_forward_extremities):
  697. self._simple_delete_txn(
  698. txn,
  699. table="event_forward_extremities",
  700. keyvalues={"room_id": room_id},
  701. )
  702. txn.call_after(
  703. self.get_latest_event_ids_in_room.invalidate, (room_id,)
  704. )
  705. self._simple_insert_many_txn(
  706. txn,
  707. table="event_forward_extremities",
  708. values=[
  709. {
  710. "event_id": ev_id,
  711. "room_id": room_id,
  712. }
  713. for room_id, new_extrem in iteritems(new_forward_extremities)
  714. for ev_id in new_extrem
  715. ],
  716. )
  717. # We now insert into stream_ordering_to_exterm a mapping from room_id,
  718. # new stream_ordering to new forward extremeties in the room.
  719. # This allows us to later efficiently look up the forward extremeties
  720. # for a room before a given stream_ordering
  721. self._simple_insert_many_txn(
  722. txn,
  723. table="stream_ordering_to_exterm",
  724. values=[
  725. {
  726. "room_id": room_id,
  727. "event_id": event_id,
  728. "stream_ordering": max_stream_order,
  729. }
  730. for room_id, new_extrem in iteritems(new_forward_extremities)
  731. for event_id in new_extrem
  732. ]
  733. )
  734. @classmethod
  735. def _filter_events_and_contexts_for_duplicates(cls, events_and_contexts):
  736. """Ensure that we don't have the same event twice.
  737. Pick the earliest non-outlier if there is one, else the earliest one.
  738. Args:
  739. events_and_contexts (list[(EventBase, EventContext)]):
  740. Returns:
  741. list[(EventBase, EventContext)]: filtered list
  742. """
  743. new_events_and_contexts = OrderedDict()
  744. for event, context in events_and_contexts:
  745. prev_event_context = new_events_and_contexts.get(event.event_id)
  746. if prev_event_context:
  747. if not event.internal_metadata.is_outlier():
  748. if prev_event_context[0].internal_metadata.is_outlier():
  749. # To ensure correct ordering we pop, as OrderedDict is
  750. # ordered by first insertion.
  751. new_events_and_contexts.pop(event.event_id, None)
  752. new_events_and_contexts[event.event_id] = (event, context)
  753. else:
  754. new_events_and_contexts[event.event_id] = (event, context)
  755. return list(new_events_and_contexts.values())
  756. def _update_room_depths_txn(self, txn, events_and_contexts, backfilled):
  757. """Update min_depth for each room
  758. Args:
  759. txn (twisted.enterprise.adbapi.Connection): db connection
  760. events_and_contexts (list[(EventBase, EventContext)]): events
  761. we are persisting
  762. backfilled (bool): True if the events were backfilled
  763. """
  764. depth_updates = {}
  765. for event, context in events_and_contexts:
  766. # Remove the any existing cache entries for the event_ids
  767. txn.call_after(self._invalidate_get_event_cache, event.event_id)
  768. if not backfilled:
  769. txn.call_after(
  770. self._events_stream_cache.entity_has_changed,
  771. event.room_id, event.internal_metadata.stream_ordering,
  772. )
  773. if not event.internal_metadata.is_outlier() and not context.rejected:
  774. depth_updates[event.room_id] = max(
  775. event.depth, depth_updates.get(event.room_id, event.depth)
  776. )
  777. for room_id, depth in iteritems(depth_updates):
  778. self._update_min_depth_for_room_txn(txn, room_id, depth)
  779. def _update_outliers_txn(self, txn, events_and_contexts):
  780. """Update any outliers with new event info.
  781. This turns outliers into ex-outliers (unless the new event was
  782. rejected).
  783. Args:
  784. txn (twisted.enterprise.adbapi.Connection): db connection
  785. events_and_contexts (list[(EventBase, EventContext)]): events
  786. we are persisting
  787. Returns:
  788. list[(EventBase, EventContext)] new list, without events which
  789. are already in the events table.
  790. """
  791. txn.execute(
  792. "SELECT event_id, outlier FROM events WHERE event_id in (%s)" % (
  793. ",".join(["?"] * len(events_and_contexts)),
  794. ),
  795. [event.event_id for event, _ in events_and_contexts]
  796. )
  797. have_persisted = {
  798. event_id: outlier
  799. for event_id, outlier in txn
  800. }
  801. to_remove = set()
  802. for event, context in events_and_contexts:
  803. if event.event_id not in have_persisted:
  804. continue
  805. to_remove.add(event)
  806. if context.rejected:
  807. # If the event is rejected then we don't care if the event
  808. # was an outlier or not.
  809. continue
  810. outlier_persisted = have_persisted[event.event_id]
  811. if not event.internal_metadata.is_outlier() and outlier_persisted:
  812. # We received a copy of an event that we had already stored as
  813. # an outlier in the database. We now have some state at that
  814. # so we need to update the state_groups table with that state.
  815. # insert into event_to_state_groups.
  816. try:
  817. self._store_event_state_mappings_txn(txn, ((event, context),))
  818. except Exception:
  819. logger.exception("")
  820. raise
  821. metadata_json = encode_json(
  822. event.internal_metadata.get_dict()
  823. ).decode("UTF-8")
  824. sql = (
  825. "UPDATE event_json SET internal_metadata = ?"
  826. " WHERE event_id = ?"
  827. )
  828. txn.execute(
  829. sql,
  830. (metadata_json, event.event_id,)
  831. )
  832. # Add an entry to the ex_outlier_stream table to replicate the
  833. # change in outlier status to our workers.
  834. stream_order = event.internal_metadata.stream_ordering
  835. state_group_id = context.state_group
  836. self._simple_insert_txn(
  837. txn,
  838. table="ex_outlier_stream",
  839. values={
  840. "event_stream_ordering": stream_order,
  841. "event_id": event.event_id,
  842. "state_group": state_group_id,
  843. }
  844. )
  845. sql = (
  846. "UPDATE events SET outlier = ?"
  847. " WHERE event_id = ?"
  848. )
  849. txn.execute(
  850. sql,
  851. (False, event.event_id,)
  852. )
  853. # Update the event_backward_extremities table now that this
  854. # event isn't an outlier any more.
  855. self._update_backward_extremeties(txn, [event])
  856. return [
  857. ec for ec in events_and_contexts if ec[0] not in to_remove
  858. ]
  859. @classmethod
  860. def _delete_existing_rows_txn(cls, txn, events_and_contexts):
  861. if not events_and_contexts:
  862. # nothing to do here
  863. return
  864. logger.info("Deleting existing")
  865. for table in (
  866. "events",
  867. "event_auth",
  868. "event_json",
  869. "event_content_hashes",
  870. "event_destinations",
  871. "event_edge_hashes",
  872. "event_edges",
  873. "event_forward_extremities",
  874. "event_reference_hashes",
  875. "event_search",
  876. "event_signatures",
  877. "event_to_state_groups",
  878. "guest_access",
  879. "history_visibility",
  880. "local_invites",
  881. "room_names",
  882. "state_events",
  883. "rejections",
  884. "redactions",
  885. "room_memberships",
  886. "topics"
  887. ):
  888. txn.executemany(
  889. "DELETE FROM %s WHERE event_id = ?" % (table,),
  890. [(ev.event_id,) for ev, _ in events_and_contexts]
  891. )
  892. for table in (
  893. "event_push_actions",
  894. ):
  895. txn.executemany(
  896. "DELETE FROM %s WHERE room_id = ? AND event_id = ?" % (table,),
  897. [(ev.event_id,) for ev, _ in events_and_contexts]
  898. )
  899. def _store_event_txn(self, txn, events_and_contexts):
  900. """Insert new events into the event and event_json tables
  901. Args:
  902. txn (twisted.enterprise.adbapi.Connection): db connection
  903. events_and_contexts (list[(EventBase, EventContext)]): events
  904. we are persisting
  905. """
  906. if not events_and_contexts:
  907. # nothing to do here
  908. return
  909. def event_dict(event):
  910. d = event.get_dict()
  911. d.pop("redacted", None)
  912. d.pop("redacted_because", None)
  913. return d
  914. self._simple_insert_many_txn(
  915. txn,
  916. table="event_json",
  917. values=[
  918. {
  919. "event_id": event.event_id,
  920. "room_id": event.room_id,
  921. "internal_metadata": encode_json(
  922. event.internal_metadata.get_dict()
  923. ).decode("UTF-8"),
  924. "json": encode_json(event_dict(event)).decode("UTF-8"),
  925. }
  926. for event, _ in events_and_contexts
  927. ],
  928. )
  929. self._simple_insert_many_txn(
  930. txn,
  931. table="events",
  932. values=[
  933. {
  934. "stream_ordering": event.internal_metadata.stream_ordering,
  935. "topological_ordering": event.depth,
  936. "depth": event.depth,
  937. "event_id": event.event_id,
  938. "room_id": event.room_id,
  939. "type": event.type,
  940. "processed": True,
  941. "outlier": event.internal_metadata.is_outlier(),
  942. "content": encode_json(event.content).decode("UTF-8"),
  943. "origin_server_ts": int(event.origin_server_ts),
  944. "received_ts": self._clock.time_msec(),
  945. "sender": event.sender,
  946. "contains_url": (
  947. "url" in event.content
  948. and isinstance(event.content["url"], basestring)
  949. ),
  950. }
  951. for event, _ in events_and_contexts
  952. ],
  953. )
  954. def _store_rejected_events_txn(self, txn, events_and_contexts):
  955. """Add rows to the 'rejections' table for received events which were
  956. rejected
  957. Args:
  958. txn (twisted.enterprise.adbapi.Connection): db connection
  959. events_and_contexts (list[(EventBase, EventContext)]): events
  960. we are persisting
  961. Returns:
  962. list[(EventBase, EventContext)] new list, without the rejected
  963. events.
  964. """
  965. # Remove the rejected events from the list now that we've added them
  966. # to the events table and the events_json table.
  967. to_remove = set()
  968. for event, context in events_and_contexts:
  969. if context.rejected:
  970. # Insert the event_id into the rejections table
  971. self._store_rejections_txn(
  972. txn, event.event_id, context.rejected
  973. )
  974. to_remove.add(event)
  975. return [
  976. ec for ec in events_and_contexts if ec[0] not in to_remove
  977. ]
  978. def _update_metadata_tables_txn(self, txn, events_and_contexts,
  979. all_events_and_contexts, backfilled):
  980. """Update all the miscellaneous tables for new events
  981. Args:
  982. txn (twisted.enterprise.adbapi.Connection): db connection
  983. events_and_contexts (list[(EventBase, EventContext)]): events
  984. we are persisting
  985. all_events_and_contexts (list[(EventBase, EventContext)]): all
  986. events that we were going to persist. This includes events
  987. we've already persisted, etc, that wouldn't appear in
  988. events_and_context.
  989. backfilled (bool): True if the events were backfilled
  990. """
  991. # Insert all the push actions into the event_push_actions table.
  992. self._set_push_actions_for_event_and_users_txn(
  993. txn,
  994. events_and_contexts=events_and_contexts,
  995. all_events_and_contexts=all_events_and_contexts,
  996. )
  997. if not events_and_contexts:
  998. # nothing to do here
  999. return
  1000. for event, context in events_and_contexts:
  1001. if event.type == EventTypes.Redaction and event.redacts is not None:
  1002. # Remove the entries in the event_push_actions table for the
  1003. # redacted event.
  1004. self._remove_push_actions_for_event_id_txn(
  1005. txn, event.room_id, event.redacts
  1006. )
  1007. self._simple_insert_many_txn(
  1008. txn,
  1009. table="event_auth",
  1010. values=[
  1011. {
  1012. "event_id": event.event_id,
  1013. "room_id": event.room_id,
  1014. "auth_id": auth_id,
  1015. }
  1016. for event, _ in events_and_contexts
  1017. for auth_id, _ in event.auth_events
  1018. if event.is_state()
  1019. ],
  1020. )
  1021. # Update the event_forward_extremities, event_backward_extremities and
  1022. # event_edges tables.
  1023. self._handle_mult_prev_events(
  1024. txn,
  1025. events=[event for event, _ in events_and_contexts],
  1026. )
  1027. for event, _ in events_and_contexts:
  1028. if event.type == EventTypes.Name:
  1029. # Insert into the room_names and event_search tables.
  1030. self._store_room_name_txn(txn, event)
  1031. elif event.type == EventTypes.Topic:
  1032. # Insert into the topics table and event_search table.
  1033. self._store_room_topic_txn(txn, event)
  1034. elif event.type == EventTypes.Message:
  1035. # Insert into the event_search table.
  1036. self._store_room_message_txn(txn, event)
  1037. elif event.type == EventTypes.Redaction:
  1038. # Insert into the redactions table.
  1039. self._store_redaction(txn, event)
  1040. elif event.type == EventTypes.RoomHistoryVisibility:
  1041. # Insert into the event_search table.
  1042. self._store_history_visibility_txn(txn, event)
  1043. elif event.type == EventTypes.GuestAccess:
  1044. # Insert into the event_search table.
  1045. self._store_guest_access_txn(txn, event)
  1046. # Insert into the room_memberships table.
  1047. self._store_room_members_txn(
  1048. txn,
  1049. [
  1050. event
  1051. for event, _ in events_and_contexts
  1052. if event.type == EventTypes.Member
  1053. ],
  1054. backfilled=backfilled,
  1055. )
  1056. # Insert event_reference_hashes table.
  1057. self._store_event_reference_hashes_txn(
  1058. txn, [event for event, _ in events_and_contexts]
  1059. )
  1060. state_events_and_contexts = [
  1061. ec for ec in events_and_contexts if ec[0].is_state()
  1062. ]
  1063. state_values = []
  1064. for event, context in state_events_and_contexts:
  1065. vals = {
  1066. "event_id": event.event_id,
  1067. "room_id": event.room_id,
  1068. "type": event.type,
  1069. "state_key": event.state_key,
  1070. }
  1071. # TODO: How does this work with backfilling?
  1072. if hasattr(event, "replaces_state"):
  1073. vals["prev_state"] = event.replaces_state
  1074. state_values.append(vals)
  1075. self._simple_insert_many_txn(
  1076. txn,
  1077. table="state_events",
  1078. values=state_values,
  1079. )
  1080. self._simple_insert_many_txn(
  1081. txn,
  1082. table="event_edges",
  1083. values=[
  1084. {
  1085. "event_id": event.event_id,
  1086. "prev_event_id": prev_id,
  1087. "room_id": event.room_id,
  1088. "is_state": True,
  1089. }
  1090. for event, _ in state_events_and_contexts
  1091. for prev_id, _ in event.prev_state
  1092. ],
  1093. )
  1094. # Prefill the event cache
  1095. self._add_to_cache(txn, events_and_contexts)
  1096. def _add_to_cache(self, txn, events_and_contexts):
  1097. to_prefill = []
  1098. rows = []
  1099. N = 200
  1100. for i in range(0, len(events_and_contexts), N):
  1101. ev_map = {
  1102. e[0].event_id: e[0]
  1103. for e in events_and_contexts[i:i + N]
  1104. }
  1105. if not ev_map:
  1106. break
  1107. sql = (
  1108. "SELECT "
  1109. " e.event_id as event_id, "
  1110. " r.redacts as redacts,"
  1111. " rej.event_id as rejects "
  1112. " FROM events as e"
  1113. " LEFT JOIN rejections as rej USING (event_id)"
  1114. " LEFT JOIN redactions as r ON e.event_id = r.redacts"
  1115. " WHERE e.event_id IN (%s)"
  1116. ) % (",".join(["?"] * len(ev_map)),)
  1117. txn.execute(sql, list(ev_map))
  1118. rows = self.cursor_to_dict(txn)
  1119. for row in rows:
  1120. event = ev_map[row["event_id"]]
  1121. if not row["rejects"] and not row["redacts"]:
  1122. to_prefill.append(_EventCacheEntry(
  1123. event=event,
  1124. redacted_event=None,
  1125. ))
  1126. def prefill():
  1127. for cache_entry in to_prefill:
  1128. self._get_event_cache.prefill((cache_entry[0].event_id,), cache_entry)
  1129. txn.call_after(prefill)
  1130. def _store_redaction(self, txn, event):
  1131. # invalidate the cache for the redacted event
  1132. txn.call_after(self._invalidate_get_event_cache, event.redacts)
  1133. txn.execute(
  1134. "INSERT INTO redactions (event_id, redacts) VALUES (?,?)",
  1135. (event.event_id, event.redacts)
  1136. )
  1137. @defer.inlineCallbacks
  1138. def have_events_in_timeline(self, event_ids):
  1139. """Given a list of event ids, check if we have already processed and
  1140. stored them as non outliers.
  1141. """
  1142. rows = yield self._simple_select_many_batch(
  1143. table="events",
  1144. retcols=("event_id",),
  1145. column="event_id",
  1146. iterable=list(event_ids),
  1147. keyvalues={"outlier": False},
  1148. desc="have_events_in_timeline",
  1149. )
  1150. defer.returnValue(set(r["event_id"] for r in rows))
  1151. @defer.inlineCallbacks
  1152. def have_seen_events(self, event_ids):
  1153. """Given a list of event ids, check if we have already processed them.
  1154. Args:
  1155. event_ids (iterable[str]):
  1156. Returns:
  1157. Deferred[set[str]]: The events we have already seen.
  1158. """
  1159. results = set()
  1160. def have_seen_events_txn(txn, chunk):
  1161. sql = (
  1162. "SELECT event_id FROM events as e WHERE e.event_id IN (%s)"
  1163. % (",".join("?" * len(chunk)), )
  1164. )
  1165. txn.execute(sql, chunk)
  1166. for (event_id, ) in txn:
  1167. results.add(event_id)
  1168. # break the input up into chunks of 100
  1169. input_iterator = iter(event_ids)
  1170. for chunk in iter(lambda: list(itertools.islice(input_iterator, 100)),
  1171. []):
  1172. yield self.runInteraction(
  1173. "have_seen_events",
  1174. have_seen_events_txn,
  1175. chunk,
  1176. )
  1177. defer.returnValue(results)
  1178. def get_seen_events_with_rejections(self, event_ids):
  1179. """Given a list of event ids, check if we rejected them.
  1180. Args:
  1181. event_ids (list[str])
  1182. Returns:
  1183. Deferred[dict[str, str|None):
  1184. Has an entry for each event id we already have seen. Maps to
  1185. the rejected reason string if we rejected the event, else maps
  1186. to None.
  1187. """
  1188. if not event_ids:
  1189. return defer.succeed({})
  1190. def f(txn):
  1191. sql = (
  1192. "SELECT e.event_id, reason FROM events as e "
  1193. "LEFT JOIN rejections as r ON e.event_id = r.event_id "
  1194. "WHERE e.event_id = ?"
  1195. )
  1196. res = {}
  1197. for event_id in event_ids:
  1198. txn.execute(sql, (event_id,))
  1199. row = txn.fetchone()
  1200. if row:
  1201. _, rejected = row
  1202. res[event_id] = rejected
  1203. return res
  1204. return self.runInteraction("get_rejection_reasons", f)
  1205. @defer.inlineCallbacks
  1206. def count_daily_messages(self):
  1207. """
  1208. Returns an estimate of the number of messages sent in the last day.
  1209. If it has been significantly less or more than one day since the last
  1210. call to this function, it will return None.
  1211. """
  1212. def _count_messages(txn):
  1213. sql = """
  1214. SELECT COALESCE(COUNT(*), 0) FROM events
  1215. WHERE type = 'm.room.message'
  1216. AND stream_ordering > ?
  1217. """
  1218. txn.execute(sql, (self.stream_ordering_day_ago,))
  1219. count, = txn.fetchone()
  1220. return count
  1221. ret = yield self.runInteraction("count_messages", _count_messages)
  1222. defer.returnValue(ret)
  1223. @defer.inlineCallbacks
  1224. def count_daily_sent_messages(self):
  1225. def _count_messages(txn):
  1226. # This is good enough as if you have silly characters in your own
  1227. # hostname then thats your own fault.
  1228. like_clause = "%:" + self.hs.hostname
  1229. sql = """
  1230. SELECT COALESCE(COUNT(*), 0) FROM events
  1231. WHERE type = 'm.room.message'
  1232. AND sender LIKE ?
  1233. AND stream_ordering > ?
  1234. """
  1235. txn.execute(sql, (like_clause, self.stream_ordering_day_ago,))
  1236. count, = txn.fetchone()
  1237. return count
  1238. ret = yield self.runInteraction("count_daily_sent_messages", _count_messages)
  1239. defer.returnValue(ret)
  1240. @defer.inlineCallbacks
  1241. def count_daily_active_rooms(self):
  1242. def _count(txn):
  1243. sql = """
  1244. SELECT COALESCE(COUNT(DISTINCT room_id), 0) FROM events
  1245. WHERE type = 'm.room.message'
  1246. AND stream_ordering > ?
  1247. """
  1248. txn.execute(sql, (self.stream_ordering_day_ago,))
  1249. count, = txn.fetchone()
  1250. return count
  1251. ret = yield self.runInteraction("count_daily_active_rooms", _count)
  1252. defer.returnValue(ret)
  1253. @defer.inlineCallbacks
  1254. def _background_reindex_fields_sender(self, progress, batch_size):
  1255. target_min_stream_id = progress["target_min_stream_id_inclusive"]
  1256. max_stream_id = progress["max_stream_id_exclusive"]
  1257. rows_inserted = progress.get("rows_inserted", 0)
  1258. INSERT_CLUMP_SIZE = 1000
  1259. def reindex_txn(txn):
  1260. sql = (
  1261. "SELECT stream_ordering, event_id, json FROM events"
  1262. " INNER JOIN event_json USING (event_id)"
  1263. " WHERE ? <= stream_ordering AND stream_ordering < ?"
  1264. " ORDER BY stream_ordering DESC"
  1265. " LIMIT ?"
  1266. )
  1267. txn.execute(sql, (target_min_stream_id, max_stream_id, batch_size))
  1268. rows = txn.fetchall()
  1269. if not rows:
  1270. return 0
  1271. min_stream_id = rows[-1][0]
  1272. update_rows = []
  1273. for row in rows:
  1274. try:
  1275. event_id = row[1]
  1276. event_json = json.loads(row[2])
  1277. sender = event_json["sender"]
  1278. content = event_json["content"]
  1279. contains_url = "url" in content
  1280. if contains_url:
  1281. contains_url &= isinstance(content["url"], basestring)
  1282. except (KeyError, AttributeError):
  1283. # If the event is missing a necessary field then
  1284. # skip over it.
  1285. continue
  1286. update_rows.append((sender, contains_url, event_id))
  1287. sql = (
  1288. "UPDATE events SET sender = ?, contains_url = ? WHERE event_id = ?"
  1289. )
  1290. for index in range(0, len(update_rows), INSERT_CLUMP_SIZE):
  1291. clump = update_rows[index:index + INSERT_CLUMP_SIZE]
  1292. txn.executemany(sql, clump)
  1293. progress = {
  1294. "target_min_stream_id_inclusive": target_min_stream_id,
  1295. "max_stream_id_exclusive": min_stream_id,
  1296. "rows_inserted": rows_inserted + len(rows)
  1297. }
  1298. self._background_update_progress_txn(
  1299. txn, self.EVENT_FIELDS_SENDER_URL_UPDATE_NAME, progress
  1300. )
  1301. return len(rows)
  1302. result = yield self.runInteraction(
  1303. self.EVENT_FIELDS_SENDER_URL_UPDATE_NAME, reindex_txn
  1304. )
  1305. if not result:
  1306. yield self._end_background_update(self.EVENT_FIELDS_SENDER_URL_UPDATE_NAME)
  1307. defer.returnValue(result)
  1308. @defer.inlineCallbacks
  1309. def _background_reindex_origin_server_ts(self, progress, batch_size):
  1310. target_min_stream_id = progress["target_min_stream_id_inclusive"]
  1311. max_stream_id = progress["max_stream_id_exclusive"]
  1312. rows_inserted = progress.get("rows_inserted", 0)
  1313. INSERT_CLUMP_SIZE = 1000
  1314. def reindex_search_txn(txn):
  1315. sql = (
  1316. "SELECT stream_ordering, event_id FROM events"
  1317. " WHERE ? <= stream_ordering AND stream_ordering < ?"
  1318. " ORDER BY stream_ordering DESC"
  1319. " LIMIT ?"
  1320. )
  1321. txn.execute(sql, (target_min_stream_id, max_stream_id, batch_size))
  1322. rows = txn.fetchall()
  1323. if not rows:
  1324. return 0
  1325. min_stream_id = rows[-1][0]
  1326. event_ids = [row[1] for row in rows]
  1327. rows_to_update = []
  1328. chunks = [
  1329. event_ids[i:i + 100]
  1330. for i in range(0, len(event_ids), 100)
  1331. ]
  1332. for chunk in chunks:
  1333. ev_rows = self._simple_select_many_txn(
  1334. txn,
  1335. table="event_json",
  1336. column="event_id",
  1337. iterable=chunk,
  1338. retcols=["event_id", "json"],
  1339. keyvalues={},
  1340. )
  1341. for row in ev_rows:
  1342. event_id = row["event_id"]
  1343. event_json = json.loads(row["json"])
  1344. try:
  1345. origin_server_ts = event_json["origin_server_ts"]
  1346. except (KeyError, AttributeError):
  1347. # If the event is missing a necessary field then
  1348. # skip over it.
  1349. continue
  1350. rows_to_update.append((origin_server_ts, event_id))
  1351. sql = (
  1352. "UPDATE events SET origin_server_ts = ? WHERE event_id = ?"
  1353. )
  1354. for index in range(0, len(rows_to_update), INSERT_CLUMP_SIZE):
  1355. clump = rows_to_update[index:index + INSERT_CLUMP_SIZE]
  1356. txn.executemany(sql, clump)
  1357. progress = {
  1358. "target_min_stream_id_inclusive": target_min_stream_id,
  1359. "max_stream_id_exclusive": min_stream_id,
  1360. "rows_inserted": rows_inserted + len(rows_to_update)
  1361. }
  1362. self._background_update_progress_txn(
  1363. txn, self.EVENT_ORIGIN_SERVER_TS_NAME, progress
  1364. )
  1365. return len(rows_to_update)
  1366. result = yield self.runInteraction(
  1367. self.EVENT_ORIGIN_SERVER_TS_NAME, reindex_search_txn
  1368. )
  1369. if not result:
  1370. yield self._end_background_update(self.EVENT_ORIGIN_SERVER_TS_NAME)
  1371. defer.returnValue(result)
  1372. def get_current_backfill_token(self):
  1373. """The current minimum token that backfilled events have reached"""
  1374. return -self._backfill_id_gen.get_current_token()
  1375. def get_current_events_token(self):
  1376. """The current maximum token that events have reached"""
  1377. return self._stream_id_gen.get_current_token()
  1378. def get_all_new_forward_event_rows(self, last_id, current_id, limit):
  1379. if last_id == current_id:
  1380. return defer.succeed([])
  1381. def get_all_new_forward_event_rows(txn):
  1382. sql = (
  1383. "SELECT e.stream_ordering, e.event_id, e.room_id, e.type,"
  1384. " state_key, redacts"
  1385. " FROM events AS e"
  1386. " LEFT JOIN redactions USING (event_id)"
  1387. " LEFT JOIN state_events USING (event_id)"
  1388. " WHERE ? < stream_ordering AND stream_ordering <= ?"
  1389. " ORDER BY stream_ordering ASC"
  1390. " LIMIT ?"
  1391. )
  1392. txn.execute(sql, (last_id, current_id, limit))
  1393. new_event_updates = txn.fetchall()
  1394. if len(new_event_updates) == limit:
  1395. upper_bound = new_event_updates[-1][0]
  1396. else:
  1397. upper_bound = current_id
  1398. sql = (
  1399. "SELECT event_stream_ordering, e.event_id, e.room_id, e.type,"
  1400. " state_key, redacts"
  1401. " FROM events AS e"
  1402. " INNER JOIN ex_outlier_stream USING (event_id)"
  1403. " LEFT JOIN redactions USING (event_id)"
  1404. " LEFT JOIN state_events USING (event_id)"
  1405. " WHERE ? < event_stream_ordering"
  1406. " AND event_stream_ordering <= ?"
  1407. " ORDER BY event_stream_ordering DESC"
  1408. )
  1409. txn.execute(sql, (last_id, upper_bound))
  1410. new_event_updates.extend(txn)
  1411. return new_event_updates
  1412. return self.runInteraction(
  1413. "get_all_new_forward_event_rows", get_all_new_forward_event_rows
  1414. )
  1415. def get_all_new_backfill_event_rows(self, last_id, current_id, limit):
  1416. if last_id == current_id:
  1417. return defer.succeed([])
  1418. def get_all_new_backfill_event_rows(txn):
  1419. sql = (
  1420. "SELECT -e.stream_ordering, e.event_id, e.room_id, e.type,"
  1421. " state_key, redacts"
  1422. " FROM events AS e"
  1423. " LEFT JOIN redactions USING (event_id)"
  1424. " LEFT JOIN state_events USING (event_id)"
  1425. " WHERE ? > stream_ordering AND stream_ordering >= ?"
  1426. " ORDER BY stream_ordering ASC"
  1427. " LIMIT ?"
  1428. )
  1429. txn.execute(sql, (-last_id, -current_id, limit))
  1430. new_event_updates = txn.fetchall()
  1431. if len(new_event_updates) == limit:
  1432. upper_bound = new_event_updates[-1][0]
  1433. else:
  1434. upper_bound = current_id
  1435. sql = (
  1436. "SELECT -event_stream_ordering, e.event_id, e.room_id, e.type,"
  1437. " state_key, redacts"
  1438. " FROM events AS e"
  1439. " INNER JOIN ex_outlier_stream USING (event_id)"
  1440. " LEFT JOIN redactions USING (event_id)"
  1441. " LEFT JOIN state_events USING (event_id)"
  1442. " WHERE ? > event_stream_ordering"
  1443. " AND event_stream_ordering >= ?"
  1444. " ORDER BY event_stream_ordering DESC"
  1445. )
  1446. txn.execute(sql, (-last_id, -upper_bound))
  1447. new_event_updates.extend(txn.fetchall())
  1448. return new_event_updates
  1449. return self.runInteraction(
  1450. "get_all_new_backfill_event_rows", get_all_new_backfill_event_rows
  1451. )
  1452. @cached(num_args=5, max_entries=10)
  1453. def get_all_new_events(self, last_backfill_id, last_forward_id,
  1454. current_backfill_id, current_forward_id, limit):
  1455. """Get all the new events that have arrived at the server either as
  1456. new events or as backfilled events"""
  1457. have_backfill_events = last_backfill_id != current_backfill_id
  1458. have_forward_events = last_forward_id != current_forward_id
  1459. if not have_backfill_events and not have_forward_events:
  1460. return defer.succeed(AllNewEventsResult([], [], [], [], []))
  1461. def get_all_new_events_txn(txn):
  1462. sql = (
  1463. "SELECT e.stream_ordering, e.event_id, e.room_id, e.type,"
  1464. " state_key, redacts"
  1465. " FROM events AS e"
  1466. " LEFT JOIN redactions USING (event_id)"
  1467. " LEFT JOIN state_events USING (event_id)"
  1468. " WHERE ? < stream_ordering AND stream_ordering <= ?"
  1469. " ORDER BY stream_ordering ASC"
  1470. " LIMIT ?"
  1471. )
  1472. if have_forward_events:
  1473. txn.execute(sql, (last_forward_id, current_forward_id, limit))
  1474. new_forward_events = txn.fetchall()
  1475. if len(new_forward_events) == limit:
  1476. upper_bound = new_forward_events[-1][0]
  1477. else:
  1478. upper_bound = current_forward_id
  1479. sql = (
  1480. "SELECT event_stream_ordering, event_id, state_group"
  1481. " FROM ex_outlier_stream"
  1482. " WHERE ? > event_stream_ordering"
  1483. " AND event_stream_ordering >= ?"
  1484. " ORDER BY event_stream_ordering DESC"
  1485. )
  1486. txn.execute(sql, (last_forward_id, upper_bound))
  1487. forward_ex_outliers = txn.fetchall()
  1488. else:
  1489. new_forward_events = []
  1490. forward_ex_outliers = []
  1491. sql = (
  1492. "SELECT -e.stream_ordering, e.event_id, e.room_id, e.type,"
  1493. " state_key, redacts"
  1494. " FROM events AS e"
  1495. " LEFT JOIN redactions USING (event_id)"
  1496. " LEFT JOIN state_events USING (event_id)"
  1497. " WHERE ? > stream_ordering AND stream_ordering >= ?"
  1498. " ORDER BY stream_ordering DESC"
  1499. " LIMIT ?"
  1500. )
  1501. if have_backfill_events:
  1502. txn.execute(sql, (-last_backfill_id, -current_backfill_id, limit))
  1503. new_backfill_events = txn.fetchall()
  1504. if len(new_backfill_events) == limit:
  1505. upper_bound = new_backfill_events[-1][0]
  1506. else:
  1507. upper_bound = current_backfill_id
  1508. sql = (
  1509. "SELECT -event_stream_ordering, event_id, state_group"
  1510. " FROM ex_outlier_stream"
  1511. " WHERE ? > event_stream_ordering"
  1512. " AND event_stream_ordering >= ?"
  1513. " ORDER BY event_stream_ordering DESC"
  1514. )
  1515. txn.execute(sql, (-last_backfill_id, -upper_bound))
  1516. backward_ex_outliers = txn.fetchall()
  1517. else:
  1518. new_backfill_events = []
  1519. backward_ex_outliers = []
  1520. return AllNewEventsResult(
  1521. new_forward_events, new_backfill_events,
  1522. forward_ex_outliers, backward_ex_outliers,
  1523. )
  1524. return self.runInteraction("get_all_new_events", get_all_new_events_txn)
  1525. def purge_history(
  1526. self, room_id, token, delete_local_events,
  1527. ):
  1528. """Deletes room history before a certain point
  1529. Args:
  1530. room_id (str):
  1531. token (str): A topological token to delete events before
  1532. delete_local_events (bool):
  1533. if True, we will delete local events as well as remote ones
  1534. (instead of just marking them as outliers and deleting their
  1535. state groups).
  1536. """
  1537. return self.runInteraction(
  1538. "purge_history",
  1539. self._purge_history_txn, room_id, token,
  1540. delete_local_events,
  1541. )
  1542. def _purge_history_txn(
  1543. self, txn, room_id, token_str, delete_local_events,
  1544. ):
  1545. token = RoomStreamToken.parse(token_str)
  1546. # Tables that should be pruned:
  1547. # event_auth
  1548. # event_backward_extremities
  1549. # event_content_hashes
  1550. # event_destinations
  1551. # event_edge_hashes
  1552. # event_edges
  1553. # event_forward_extremities
  1554. # event_json
  1555. # event_push_actions
  1556. # event_reference_hashes
  1557. # event_search
  1558. # event_signatures
  1559. # event_to_state_groups
  1560. # events
  1561. # rejections
  1562. # room_depth
  1563. # state_groups
  1564. # state_groups_state
  1565. # we will build a temporary table listing the events so that we don't
  1566. # have to keep shovelling the list back and forth across the
  1567. # connection. Annoyingly the python sqlite driver commits the
  1568. # transaction on CREATE, so let's do this first.
  1569. #
  1570. # furthermore, we might already have the table from a previous (failed)
  1571. # purge attempt, so let's drop the table first.
  1572. txn.execute("DROP TABLE IF EXISTS events_to_purge")
  1573. txn.execute(
  1574. "CREATE TEMPORARY TABLE events_to_purge ("
  1575. " event_id TEXT NOT NULL,"
  1576. " should_delete BOOLEAN NOT NULL"
  1577. ")"
  1578. )
  1579. # create an index on should_delete because later we'll be looking for
  1580. # the should_delete / shouldn't_delete subsets
  1581. txn.execute(
  1582. "CREATE INDEX events_to_purge_should_delete"
  1583. " ON events_to_purge(should_delete)",
  1584. )
  1585. # We do joins against events_to_purge for e.g. calculating state
  1586. # groups to purge, etc., so lets make an index.
  1587. txn.execute(
  1588. "CREATE INDEX events_to_purge_id"
  1589. " ON events_to_purge(event_id)",
  1590. )
  1591. # First ensure that we're not about to delete all the forward extremeties
  1592. txn.execute(
  1593. "SELECT e.event_id, e.depth FROM events as e "
  1594. "INNER JOIN event_forward_extremities as f "
  1595. "ON e.event_id = f.event_id "
  1596. "AND e.room_id = f.room_id "
  1597. "WHERE f.room_id = ?",
  1598. (room_id,)
  1599. )
  1600. rows = txn.fetchall()
  1601. max_depth = max(row[0] for row in rows)
  1602. if max_depth <= token.topological:
  1603. # We need to ensure we don't delete all the events from the datanase
  1604. # otherwise we wouldn't be able to send any events (due to not
  1605. # having any backwards extremeties)
  1606. raise SynapseError(
  1607. 400, "topological_ordering is greater than forward extremeties"
  1608. )
  1609. logger.info("[purge] looking for events to delete")
  1610. should_delete_expr = "state_key IS NULL"
  1611. should_delete_params = ()
  1612. if not delete_local_events:
  1613. should_delete_expr += " AND event_id NOT LIKE ?"
  1614. should_delete_params += ("%:" + self.hs.hostname, )
  1615. should_delete_params += (room_id, token.topological)
  1616. txn.execute(
  1617. "INSERT INTO events_to_purge"
  1618. " SELECT event_id, %s"
  1619. " FROM events AS e LEFT JOIN state_events USING (event_id)"
  1620. " WHERE e.room_id = ? AND topological_ordering < ?" % (
  1621. should_delete_expr,
  1622. ),
  1623. should_delete_params,
  1624. )
  1625. txn.execute(
  1626. "SELECT event_id, should_delete FROM events_to_purge"
  1627. )
  1628. event_rows = txn.fetchall()
  1629. logger.info(
  1630. "[purge] found %i events before cutoff, of which %i can be deleted",
  1631. len(event_rows), sum(1 for e in event_rows if e[1]),
  1632. )
  1633. logger.info("[purge] Finding new backward extremities")
  1634. # We calculate the new entries for the backward extremeties by finding
  1635. # events to be purged that are pointed to by events we're not going to
  1636. # purge.
  1637. txn.execute(
  1638. "SELECT DISTINCT e.event_id FROM events_to_purge AS e"
  1639. " INNER JOIN event_edges AS ed ON e.event_id = ed.prev_event_id"
  1640. " LEFT JOIN events_to_purge AS ep2 ON ed.event_id = ep2.event_id"
  1641. " WHERE ep2.event_id IS NULL",
  1642. )
  1643. new_backwards_extrems = txn.fetchall()
  1644. logger.info("[purge] replacing backward extremities: %r", new_backwards_extrems)
  1645. txn.execute(
  1646. "DELETE FROM event_backward_extremities WHERE room_id = ?",
  1647. (room_id,)
  1648. )
  1649. # Update backward extremeties
  1650. txn.executemany(
  1651. "INSERT INTO event_backward_extremities (room_id, event_id)"
  1652. " VALUES (?, ?)",
  1653. [
  1654. (room_id, event_id) for event_id, in new_backwards_extrems
  1655. ]
  1656. )
  1657. logger.info("[purge] finding redundant state groups")
  1658. # Get all state groups that are only referenced by events that are
  1659. # to be deleted.
  1660. # This works by first getting state groups that we may want to delete,
  1661. # joining against event_to_state_groups to get events that use that
  1662. # state group, then left joining against events_to_purge again. Any
  1663. # state group where the left join produce *no nulls* are referenced
  1664. # only by events that are going to be purged.
  1665. txn.execute("""
  1666. SELECT state_group FROM
  1667. (
  1668. SELECT DISTINCT state_group FROM events_to_purge
  1669. INNER JOIN event_to_state_groups USING (event_id)
  1670. ) AS sp
  1671. INNER JOIN event_to_state_groups USING (state_group)
  1672. LEFT JOIN events_to_purge AS ep USING (event_id)
  1673. GROUP BY state_group
  1674. HAVING SUM(CASE WHEN ep.event_id IS NULL THEN 1 ELSE 0 END) = 0
  1675. """)
  1676. state_rows = txn.fetchall()
  1677. logger.info("[purge] found %i redundant state groups", len(state_rows))
  1678. # make a set of the redundant state groups, so that we can look them up
  1679. # efficiently
  1680. state_groups_to_delete = set([sg for sg, in state_rows])
  1681. # Now we get all the state groups that rely on these state groups
  1682. logger.info("[purge] finding state groups which depend on redundant"
  1683. " state groups")
  1684. remaining_state_groups = []
  1685. for i in range(0, len(state_rows), 100):
  1686. chunk = [sg for sg, in state_rows[i:i + 100]]
  1687. # look for state groups whose prev_state_group is one we are about
  1688. # to delete
  1689. rows = self._simple_select_many_txn(
  1690. txn,
  1691. table="state_group_edges",
  1692. column="prev_state_group",
  1693. iterable=chunk,
  1694. retcols=["state_group"],
  1695. keyvalues={},
  1696. )
  1697. remaining_state_groups.extend(
  1698. row["state_group"] for row in rows
  1699. # exclude state groups we are about to delete: no point in
  1700. # updating them
  1701. if row["state_group"] not in state_groups_to_delete
  1702. )
  1703. # Now we turn the state groups that reference to-be-deleted state
  1704. # groups to non delta versions.
  1705. for sg in remaining_state_groups:
  1706. logger.info("[purge] de-delta-ing remaining state group %s", sg)
  1707. curr_state = self._get_state_groups_from_groups_txn(
  1708. txn, [sg], types=None
  1709. )
  1710. curr_state = curr_state[sg]
  1711. self._simple_delete_txn(
  1712. txn,
  1713. table="state_groups_state",
  1714. keyvalues={
  1715. "state_group": sg,
  1716. }
  1717. )
  1718. self._simple_delete_txn(
  1719. txn,
  1720. table="state_group_edges",
  1721. keyvalues={
  1722. "state_group": sg,
  1723. }
  1724. )
  1725. self._simple_insert_many_txn(
  1726. txn,
  1727. table="state_groups_state",
  1728. values=[
  1729. {
  1730. "state_group": sg,
  1731. "room_id": room_id,
  1732. "type": key[0],
  1733. "state_key": key[1],
  1734. "event_id": state_id,
  1735. }
  1736. for key, state_id in iteritems(curr_state)
  1737. ],
  1738. )
  1739. logger.info("[purge] removing redundant state groups")
  1740. txn.executemany(
  1741. "DELETE FROM state_groups_state WHERE state_group = ?",
  1742. state_rows
  1743. )
  1744. txn.executemany(
  1745. "DELETE FROM state_groups WHERE id = ?",
  1746. state_rows
  1747. )
  1748. logger.info("[purge] removing events from event_to_state_groups")
  1749. txn.execute(
  1750. "DELETE FROM event_to_state_groups "
  1751. "WHERE event_id IN (SELECT event_id from events_to_purge)"
  1752. )
  1753. for event_id, _ in event_rows:
  1754. txn.call_after(self._get_state_group_for_event.invalidate, (
  1755. event_id,
  1756. ))
  1757. # Delete all remote non-state events
  1758. for table in (
  1759. "events",
  1760. "event_json",
  1761. "event_auth",
  1762. "event_content_hashes",
  1763. "event_destinations",
  1764. "event_edge_hashes",
  1765. "event_edges",
  1766. "event_forward_extremities",
  1767. "event_reference_hashes",
  1768. "event_search",
  1769. "event_signatures",
  1770. "rejections",
  1771. ):
  1772. logger.info("[purge] removing events from %s", table)
  1773. txn.execute(
  1774. "DELETE FROM %s WHERE event_id IN ("
  1775. " SELECT event_id FROM events_to_purge WHERE should_delete"
  1776. ")" % (table,),
  1777. )
  1778. # event_push_actions lacks an index on event_id, and has one on
  1779. # (room_id, event_id) instead.
  1780. for table in (
  1781. "event_push_actions",
  1782. ):
  1783. logger.info("[purge] removing events from %s", table)
  1784. txn.execute(
  1785. "DELETE FROM %s WHERE room_id = ? AND event_id IN ("
  1786. " SELECT event_id FROM events_to_purge WHERE should_delete"
  1787. ")" % (table,),
  1788. (room_id, )
  1789. )
  1790. # Mark all state and own events as outliers
  1791. logger.info("[purge] marking remaining events as outliers")
  1792. txn.execute(
  1793. "UPDATE events SET outlier = ?"
  1794. " WHERE event_id IN ("
  1795. " SELECT event_id FROM events_to_purge "
  1796. " WHERE NOT should_delete"
  1797. ")",
  1798. (True,),
  1799. )
  1800. # synapse tries to take out an exclusive lock on room_depth whenever it
  1801. # persists events (because upsert), and once we run this update, we
  1802. # will block that for the rest of our transaction.
  1803. #
  1804. # So, let's stick it at the end so that we don't block event
  1805. # persistence.
  1806. #
  1807. # We do this by calculating the minimum depth of the backwards
  1808. # extremities. However, the events in event_backward_extremities
  1809. # are ones we don't have yet so we need to look at the events that
  1810. # point to it via event_edges table.
  1811. txn.execute("""
  1812. SELECT COALESCE(MIN(depth), 0)
  1813. FROM event_backward_extremities AS eb
  1814. INNER JOIN event_edges AS eg ON eg.prev_event_id = eb.event_id
  1815. INNER JOIN events AS e ON e.event_id = eg.event_id
  1816. WHERE eb.room_id = ?
  1817. """, (room_id,))
  1818. min_depth, = txn.fetchone()
  1819. logger.info("[purge] updating room_depth to %d", min_depth)
  1820. txn.execute(
  1821. "UPDATE room_depth SET min_depth = ? WHERE room_id = ?",
  1822. (min_depth, room_id,)
  1823. )
  1824. # finally, drop the temp table. this will commit the txn in sqlite,
  1825. # so make sure to keep this actually last.
  1826. txn.execute(
  1827. "DROP TABLE events_to_purge"
  1828. )
  1829. logger.info("[purge] done")
  1830. @defer.inlineCallbacks
  1831. def is_event_after(self, event_id1, event_id2):
  1832. """Returns True if event_id1 is after event_id2 in the stream
  1833. """
  1834. to_1, so_1 = yield self._get_event_ordering(event_id1)
  1835. to_2, so_2 = yield self._get_event_ordering(event_id2)
  1836. defer.returnValue((to_1, so_1) > (to_2, so_2))
  1837. @cachedInlineCallbacks(max_entries=5000)
  1838. def _get_event_ordering(self, event_id):
  1839. res = yield self._simple_select_one(
  1840. table="events",
  1841. retcols=["topological_ordering", "stream_ordering"],
  1842. keyvalues={"event_id": event_id},
  1843. allow_none=True
  1844. )
  1845. if not res:
  1846. raise SynapseError(404, "Could not find event %s" % (event_id,))
  1847. defer.returnValue((int(res["topological_ordering"]), int(res["stream_ordering"])))
  1848. def get_max_current_state_delta_stream_id(self):
  1849. return self._stream_id_gen.get_current_token()
  1850. def get_all_updated_current_state_deltas(self, from_token, to_token, limit):
  1851. def get_all_updated_current_state_deltas_txn(txn):
  1852. sql = """
  1853. SELECT stream_id, room_id, type, state_key, event_id
  1854. FROM current_state_delta_stream
  1855. WHERE ? < stream_id AND stream_id <= ?
  1856. ORDER BY stream_id ASC LIMIT ?
  1857. """
  1858. txn.execute(sql, (from_token, to_token, limit))
  1859. return txn.fetchall()
  1860. return self.runInteraction(
  1861. "get_all_updated_current_state_deltas",
  1862. get_all_updated_current_state_deltas_txn,
  1863. )
  1864. AllNewEventsResult = namedtuple("AllNewEventsResult", [
  1865. "new_forward_events", "new_backfill_events",
  1866. "forward_ex_outliers", "backward_ex_outliers",
  1867. ])