events.py 84 KB

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